Xiaohan Yue
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xiaohan Yue has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Yuan He
RIKEN Center for Computational Science, Chuo-ku, Tokyo, Japan
5 shared publications - Haibo Yang
School of Information Science and Engineering, Shenyang University of Technology, Shenyang, China
3 shared publications - Shi Bai
School of Information Science and Engineering, Shenyang University of Technology, Shenyang, China
3 shared publications Xibo Wang
Shenyang University of Technology
3 shared publicationsYuan He
Shenyang University of Technology
3 shared publicationsBing Chen
Shenyang University of Technology
2 shared publications
Latest Publications
- Open Access
- 7 February 2025
- Published by Elsevier in Information Sciences
- Vol. 703
A2SHE: An anonymous authentication scheme for health emergencies in public venues
- 7 February 2025
- Published by Elsevier in Information Sciences
- Vol. 703
Open AccessA2SHE: An anonymous authentication scheme for health emergencies in public venues
- 4 November 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (1) , 1-35
A face authentication-based searchable encryption scheme for mobile device
- 4 November 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (1) , 1-35
A face authentication-based searchable encryption scheme for mobile device
- Open Access
- 29 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 15 (6) , 6092-6111
PAP: A Privacy-Preserving Authentication Scheme With Anonymous Payment for V2G Networks
Vehicle-to-grid (V2G) networks, as an emerging smart grid paradigm, can be integrated with renewable energy resources to provide power services and manage electricity demands. When accessing electricity services, an electric vehicle $\left ({{\mathcal {E}\mathcal {V}}}\right)$ typically provides authentication or/and payment information containing identifying data to a service provider, which raises privacy concerns as malicious entities might trace $\mathcal {E}\mathcal {V}$ activity or exploit personal information. Although numerous anonymous authentication and payment schemes have been presented for V2G networks, no such privacy-preserving scheme supports authentication and payment simultaneously. Therefore, this paper is the first to present a privacy-preserving authentication scheme with anonymous payment for V2G networks (PAP, for short). In addition, this scheme also supports accountability and revocability, which are practical features to prevent malicious behavior; minimal attribute disclosure, which maximizes the privacy of $\mathcal {E}\mathcal {V}$ when responding to the service provider’s flexible access policies; payment binding, which guarantees the accountability in the payment phase; user-controlled linkability, which enables $\mathcal {E}\mathcal {V}$ to decide whether different authentication sessions are linkable for continuous services. On the performance side, we implement PAP with the pairing cryptography library, then evaluate it on different hardware platforms, showing that it is essential for V2G applications.
- 29 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 15 (6) , 6092-6111
Open AccessPAP: A Privacy-Preserving Authentication Scheme With Anonymous Payment for V2G Networks
Vehicle-to-grid (V2G) networks, as an emerging smart grid paradigm, can be integrated with renewable energy resources to provide power services and manage electricity demands. When accessing electricity services, an electric vehicle $\left ({{\mathcal {E}\mathcal {V}}}\right)$ typically provides authentication or/and payment information containing identifying data to a service provider, which raises privacy concerns as malicious entities might trace $\mathcal {E}\mathcal {V}$ activity or exploit personal information. Although numerous anonymous authentication and payment schemes have been presented for V2G networks, no such privacy-preserving scheme supports authentication and payment simultaneously. Therefore, this paper is the first to present a privacy-preserving authentication scheme with anonymous payment for V2G networks (PAP, for short). In addition, this scheme also supports accountability and revocability, which are practical features to prevent malicious behavior; minimal attribute disclosure, which maximizes the privacy of $\mathcal {E}\mathcal {V}$ when responding to the service provider’s flexible access policies; payment binding, which guarantees the accountability in the payment phase; user-controlled linkability, which enables $\mathcal {E}\mathcal {V}$ to decide whether different authentication sessions are linkable for continuous services. On the performance side, we implement PAP with the pairing cryptography library, then evaluate it on different hardware platforms, showing that it is essential for V2G applications.
- Open Access
- 4 July 2024
- Published by Springer Nature in Scientific Reports
- Vol. 14 (1) , 1-20
A high security coding and anti-counterfeiting method based on the nonlinear magnetization response of superparamagnetic nanomaterials
Traditional coding methods based on graphics and digital or magnetic labels have gradually decreased their anti-counterfeiting because of market popularity. This paper presents a new magnetic anti-counterfeiting coding method. This method uses a high-performance coding material, which, along with small changes to the material itself and the particle size of the superparamagnetic nanomaterials, results in a large difference in the nonlinear magnetization response. This method, which adopts 12-site coding and establishes a screening model by measuring the voltage amplitude of 12-site variables, can code different kinds of products, establishing long-term stable coding and decoding means. Through the anti-counterfeiting experiment of wine, the experiment results show that the authenticity of the coded products can be verified using the self-developed magnetic encoding and decoding system. The new coding technology can verify the anti-counterfeiting of 9000 products, with a single detection accuracy of 97% and a detection time of less than one minute. Moreover, this coding method completely depends on the production batch of the superparamagnetic nanomaterials, which is difficult to imitate, and it provides a new coding anti-counterfeiting technology for related industries with a wide range of potential applications.
- 4 July 2024
- Published by Springer Nature in Scientific Reports
- Vol. 14 (1) , 1-20
Open AccessA high security coding and anti-counterfeiting method based on the nonlinear magnetization response of superparamagnetic nanomaterials
Traditional coding methods based on graphics and digital or magnetic labels have gradually decreased their anti-counterfeiting because of market popularity. This paper presents a new magnetic anti-counterfeiting coding method. This method uses a high-performance coding material, which, along with small changes to the material itself and the particle size of the superparamagnetic nanomaterials, results in a large difference in the nonlinear magnetization response. This method, which adopts 12-site coding and establishes a screening model by measuring the voltage amplitude of 12-site variables, can code different kinds of products, establishing long-term stable coding and decoding means. Through the anti-counterfeiting experiment of wine, the experiment results show that the authenticity of the coded products can be verified using the self-developed magnetic encoding and decoding system. The new coding technology can verify the anti-counterfeiting of 9000 products, with a single detection accuracy of 97% and a detection time of less than one minute. Moreover, this coding method completely depends on the production batch of the superparamagnetic nanomaterials, which is difficult to imitate, and it provides a new coding anti-counterfeiting technology for related industries with a wide range of potential applications.
- Open Access
- 29 February 2024
- Published by Springer Nature in Research Square
A high security coding and anti-counterfeiting method based on the nonlinear magnetization response of superparamagnetic nanomaterials
Traditional coding methods based on graphics and digital or magnetic labels have gradually decreased their anti-counterfeiting because of market popularity. This paper presents a new anti-counterfeiting coding method. This method uses a high-performance coding material, which, along with small changes to the material itself and the particle size of the magnetic nanomaterials, results in a large difference in the nonlinear magnetization response. This method, which adopts 12-site coding and establishes a screening model by measuring the voltage amplitude of 12-site variables, can code different kinds of products, establishing long-term stable coding and decoding means. Through the anti-counterfeiting experiment of wine, the experiment results show that the authenticity of the coded products can be verified using the self-developed automatic coding and decoding detection system. The new coding technology can verify the anti-counterfeiting of 9,000 products, with a single detection accuracy of 97% and a detection time of less than one minute. Moreover, this coding method completely depends on the production batch of the superparamagnetic nanomaterials, which is difficult to imitate, and it provides a new coding anti-counterfeiting technology for related industries with a wide range of potential applications.
- 29 February 2024
- Published by Springer Nature in Research Square
Open AccessA high security coding and anti-counterfeiting method based on the nonlinear magnetization response of superparamagnetic nanomaterials
Traditional coding methods based on graphics and digital or magnetic labels have gradually decreased their anti-counterfeiting because of market popularity. This paper presents a new anti-counterfeiting coding method. This method uses a high-performance coding material, which, along with small changes to the material itself and the particle size of the magnetic nanomaterials, results in a large difference in the nonlinear magnetization response. This method, which adopts 12-site coding and establishes a screening model by measuring the voltage amplitude of 12-site variables, can code different kinds of products, establishing long-term stable coding and decoding means. Through the anti-counterfeiting experiment of wine, the experiment results show that the authenticity of the coded products can be verified using the self-developed automatic coding and decoding detection system. The new coding technology can verify the anti-counterfeiting of 9,000 products, with a single detection accuracy of 97% and a detection time of less than one minute. Moreover, this coding method completely depends on the production batch of the superparamagnetic nanomaterials, which is difficult to imitate, and it provides a new coding anti-counterfeiting technology for related industries with a wide range of potential applications.
- Open Access
- 30 October 2023
- Published by Springer Nature in Research Square
A Face-Authentication Based Searchable Encryption Scheme For Mobile Device
In this paper, we introduce Face-Authentication Keyword Encryption Search (FAKES), a novel searchable encryption scheme that eliminates the requirement for clients to manage cryptographic keys by utilizing only the client’s face biometric data for authentication of outsourcing and retrieval of encrypted files. We propose two face biometric-based search-able encryption models that support single-user and multiuser scenarios, respectively. Furthermore, we propose a key recovery approach that relies exclusively on facial bio-metric data, making it easier for users to migrate across devices. Taking into account the limitations of storage and computation on the devices of users, we design a pairing-free elliptic-curve-based encryption algorithm in order to enhance the user’s experience. In order to ensure that cloud servers return the right documents, we provide correctness and security proofs. We also perform a security analysis of FAKES and demonstrate its effectiveness through a series of extensive experiments.
- 30 October 2023
- Published by Springer Nature in Research Square
Open AccessA Face-Authentication Based Searchable Encryption Scheme For Mobile Device
In this paper, we introduce Face-Authentication Keyword Encryption Search (FAKES), a novel searchable encryption scheme that eliminates the requirement for clients to manage cryptographic keys by utilizing only the client’s face biometric data for authentication of outsourcing and retrieval of encrypted files. We propose two face biometric-based search-able encryption models that support single-user and multiuser scenarios, respectively. Furthermore, we propose a key recovery approach that relies exclusively on facial bio-metric data, making it easier for users to migrate across devices. Taking into account the limitations of storage and computation on the devices of users, we design a pairing-free elliptic-curve-based encryption algorithm in order to enhance the user’s experience. In order to ensure that cloud servers return the right documents, we provide correctness and security proofs. We also perform a security analysis of FAKES and demonstrate its effectiveness through a series of extensive experiments.
- 8 June 2019
- Published by Springer Nature
- p. 226-245
A Practical Group Signatures for Providing Privacy-Preserving Authentication with Revocation
- 8 June 2019
- Published by Springer Nature
- p. 226-245
A Practical Group Signatures for Providing Privacy-Preserving Authentication with Revocation
- 1 January 2019
- Published by Springer Nature
- p. 220-233
An Efficient Property-Based Authentication Scheme in the Standard Model
- 1 January 2019
- Published by Springer Nature
- p. 220-233
An Efficient Property-Based Authentication Scheme in the Standard Model
- 1 January 2019
- Published by Springer Nature
- p. 205-219
An Efficient Dynamic Group Signatures Scheme with CCA-Anonymity in Standard Model
- 1 January 2019
- Published by Springer Nature
- p. 205-219
An Efficient Dynamic Group Signatures Scheme with CCA-Anonymity in Standard Model
- Open Access
- 14 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 62584-62600
An Efficient and Secure Anonymous Authentication Scheme for VANETs Based on the Framework of Group Signatures
Vehicular ad hoc networks (VANETs) have stimulated interests in both academic and industry settings. Once deployed, they would bring a new driving experience to drivers. However, in an open-access environment, privacy is one of the greatest challenges, as drivers want to keep their personal information protected. Therefore, many authentication protocols have been proposed as solutions to the privacy issue. In most of the existing protocols, to prevent the revoked entity from generating a valid authentication information, the verifiers must frequently download the revocation list from one or more remote authorities to keep the list up-to-date, which greatly increases the workload of the remote authority. In this paper, to cope with such challenging concerns, based on the idea of group signatures, we propose a novel authentication protocol scheme by using the complete sub-tree method to achieve membership revocation, which ensures forward security. In our scheme, the verifiers can verify the authentication information by getting the latest epoch $t$ without having to obtain the latest revocation list. In the aspect of security, the proposed protocol is featured with forward security, CCA2-anonymity, unforgeability, non-frameability, and traceability. In addition, our scheme adopts a decentralized group model, so that the whole domain of VANETs is divided into sub-regions and any vehicle has to update its non-revoked token periodically from the regional group manager who manages the region where the vehicle stays.
- 14 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 62584-62600
Open AccessAn Efficient and Secure Anonymous Authentication Scheme for VANETs Based on the Framework of Group Signatures
Vehicular ad hoc networks (VANETs) have stimulated interests in both academic and industry settings. Once deployed, they would bring a new driving experience to drivers. However, in an open-access environment, privacy is one of the greatest challenges, as drivers want to keep their personal information protected. Therefore, many authentication protocols have been proposed as solutions to the privacy issue. In most of the existing protocols, to prevent the revoked entity from generating a valid authentication information, the verifiers must frequently download the revocation list from one or more remote authorities to keep the list up-to-date, which greatly increases the workload of the remote authority. In this paper, to cope with such challenging concerns, based on the idea of group signatures, we propose a novel authentication protocol scheme by using the complete sub-tree method to achieve membership revocation, which ensures forward security. In our scheme, the verifiers can verify the authentication information by getting the latest epoch $t$ without having to obtain the latest revocation list. In the aspect of security, the proposed protocol is featured with forward security, CCA2-anonymity, unforgeability, non-frameability, and traceability. In addition, our scheme adopts a decentralized group model, so that the whole domain of VANETs is divided into sub-regions and any vehicle has to update its non-revoked token periodically from the regional group manager who manages the region where the vehicle stays.