Fenghe Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Fenghe Wang has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
Junquan Wang
4 shared publicationsChengliang Cao
School of Science, Shandong Jianzhu University, Jinan, China
3 shared publicationsChunxiao Wang
Shandong Jianzhu University
3 shared publicationsHan Xiao
School of Science, Shandong Jianzhu University, Jinan, China
3 shared publicationsShaoquan Shi
School of Computer, Shandong Jianzhu University, Jinan, China
3 shared publicationsYe Wang
School of Science, Shandong Jianzhu University, Jinan, China
3 shared publications
Latest Publications
- Open Access
- 17 October 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (20) , 10289
An Ideal Lattice Signcryption Scheme for Data Protection
Signcryption simultaneously provides confidentiality and authenticity, rendering it well-suited for secure data transmission. However, most existing signcryption constructions rely on number-theoretic hard problems, which renders them susceptible to quantum attacks. For this reason, this paper designs a trapdoor-free signcryption scheme over ideal lattices. Our scheme employs bimodal Gaussian rejection sampling to reduce the rejection constant from to , and leverages the Number Theoretic Transform for faster polynomial multiplication. Furthermore, we demonstrate that the scheme simultaneously satisfies IND-CPA confidentiality and EUF-CMA unforgeability based on the R-LWE and R-SIS hardness assumptions within the random oracle model. In contrast to present lattice-based signcryption schemes, the proposed construction achieves smaller key sizes and lower computational cost, making it suitable for privacy-preserving applications.- 17 October 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (20) , 10289
Open AccessAn Ideal Lattice Signcryption Scheme for Data Protection
Signcryption simultaneously provides confidentiality and authenticity, rendering it well-suited for secure data transmission. However, most existing signcryption constructions rely on number-theoretic hard problems, which renders them susceptible to quantum attacks. For this reason, this paper designs a trapdoor-free signcryption scheme over ideal lattices. Our scheme employs bimodal Gaussian rejection sampling to reduce the rejection constant from to , and leverages the Number Theoretic Transform for faster polynomial multiplication. Furthermore, we demonstrate that the scheme simultaneously satisfies IND-CPA confidentiality and EUF-CMA unforgeability based on the R-LWE and R-SIS hardness assumptions within the random oracle model. In contrast to present lattice-based signcryption schemes, the proposed construction achieves smaller key sizes and lower computational cost, making it suitable for privacy-preserving applications. - 30 January 2026
- Published by Elsevier in Journal of Systems Architecture
- Vol. 174
Post quantum secure and efficient data sharing scheme from attribute based encryption for VANETs over lattices
- 30 January 2026
- Published by Elsevier in Journal of Systems Architecture
- Vol. 174
Post quantum secure and efficient data sharing scheme from attribute based encryption for VANETs over lattices
- Open Access
- 11 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 102044-102059
Research on A Lattice-Based Fuzzy Signature and Bimodal Gaussian
Fuzzy signatures differ from standard signature schemes in that they use noisy strings as keys, thereby eliminating the need for user-specific auxiliary data. With the advent of quantum computing, lattice-based digital signatures are considered potential candidates for resisting quantum attacks. In this work, we revisited the lattice-based fuzzy signature scheme proposed by Zheng et al. and demonstrated how the scheme can be implemented more efficiently and securely. In our new signature scheme, our contributions are as follows: The utilization of bimodal Gaussian sampling reduces the number of aborting terminations while simultaneously decreasing the signature size. By eliminating the T matrix from the verification equation, we improve verification efficiency. Additionally, in response to the linear sketch proposed by the authors, we provide a proof of the collision resistance of the mapping h, which further enhances the correctness of the scheme.
- 11 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 102044-102059
Open AccessResearch on A Lattice-Based Fuzzy Signature and Bimodal Gaussian
Fuzzy signatures differ from standard signature schemes in that they use noisy strings as keys, thereby eliminating the need for user-specific auxiliary data. With the advent of quantum computing, lattice-based digital signatures are considered potential candidates for resisting quantum attacks. In this work, we revisited the lattice-based fuzzy signature scheme proposed by Zheng et al. and demonstrated how the scheme can be implemented more efficiently and securely. In our new signature scheme, our contributions are as follows: The utilization of bimodal Gaussian sampling reduces the number of aborting terminations while simultaneously decreasing the signature size. By eliminating the T matrix from the verification equation, we improve verification efficiency. Additionally, in response to the linear sketch proposed by the authors, we provide a proof of the collision resistance of the mapping h, which further enhances the correctness of the scheme.
- 9 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Network
- Vol. 40 (2) , 230-243
Secure and Efficient Attribute-Based Batch Authentication Scheme for VANETs
Cloud server plays an important role in VANETs. Both vehicles and RSUs need to get data and services from the cloud server in VANETs. How to ensure the security and efficiency in the communication with cloud server is a very necessary requirement. The cloud server wishes to ensure the legality of the requirements from vehicles and RSUs before providing its services. At the same time, vehicles etc wish the cloud server to response their requirements as quickly as soon. Especially when a large number of vehicles and RSUs need the services of the cloud server, how to reduce the response time of the cloud server is an interesting topic for VANETs. This paper proposes an efficient attribute-based batch authentication scheme over lattice for VANETs. The fine-grained access control of the cloud server is achieved by designing an attribute-based signature scheme over lattice in this paper. Moreover, the cloud server can batch authenticate multiple messages from different vehicles and RSUs, which is important to reduce the response time of the cloud server in VANETs. We prove that the proposed scheme is strong unforgeable under the adaptive selective attributes and adaptive chosen message attacks in random oracle model, under the hardness of the ring shortest integer solution problem. The comparisons with several known schemes show that the proposed scheme shares some advantages with respect to the space and computation efficiency, such as the signature length and the signing/verifying time which are checked by using the Java program on a personal computer with Intel (R) Core (TM) i9-14900HX processor (2.20GHz) and 32GB RAM. A network simulation by using NS3 is also given to verify the advantages of communication effects, such as the response latency and average message loss ratios. The results show that the proposed batch authentication scheme can save about 94.81% response time of the cloud server in VANETs. Furthermore, the average message loss rate is also controlled within an acceptable interval (much less than 4.15%) even in very tense communication scenario for 1000 vehicles and fast movement speeds (25 m/s). At last, since the post quantum security of the lattice-based cryptographic, the proposed scheme is still secure even under the quantum attacks.
- 9 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Network
- Vol. 40 (2) , 230-243
Secure and Efficient Attribute-Based Batch Authentication Scheme for VANETs
Cloud server plays an important role in VANETs. Both vehicles and RSUs need to get data and services from the cloud server in VANETs. How to ensure the security and efficiency in the communication with cloud server is a very necessary requirement. The cloud server wishes to ensure the legality of the requirements from vehicles and RSUs before providing its services. At the same time, vehicles etc wish the cloud server to response their requirements as quickly as soon. Especially when a large number of vehicles and RSUs need the services of the cloud server, how to reduce the response time of the cloud server is an interesting topic for VANETs. This paper proposes an efficient attribute-based batch authentication scheme over lattice for VANETs. The fine-grained access control of the cloud server is achieved by designing an attribute-based signature scheme over lattice in this paper. Moreover, the cloud server can batch authenticate multiple messages from different vehicles and RSUs, which is important to reduce the response time of the cloud server in VANETs. We prove that the proposed scheme is strong unforgeable under the adaptive selective attributes and adaptive chosen message attacks in random oracle model, under the hardness of the ring shortest integer solution problem. The comparisons with several known schemes show that the proposed scheme shares some advantages with respect to the space and computation efficiency, such as the signature length and the signing/verifying time which are checked by using the Java program on a personal computer with Intel (R) Core (TM) i9-14900HX processor (2.20GHz) and 32GB RAM. A network simulation by using NS3 is also given to verify the advantages of communication effects, such as the response latency and average message loss ratios. The results show that the proposed batch authentication scheme can save about 94.81% response time of the cloud server in VANETs. Furthermore, the average message loss rate is also controlled within an acceptable interval (much less than 4.15%) even in very tense communication scenario for 1000 vehicles and fast movement speeds (25 m/s). At last, since the post quantum security of the lattice-based cryptographic, the proposed scheme is still secure even under the quantum attacks.
- 22 June 2024
- Published by Elsevier in Computer Networks
- Vol. 250
Secure and efficient vehicle data downloading scheme with privacy-preserving in VANETs
- 22 June 2024
- Published by Elsevier in Computer Networks
- Vol. 250
Secure and efficient vehicle data downloading scheme with privacy-preserving in VANETs
- 15 February 2024
- Published by Elsevier in Journal of Systems Architecture
- Vol. 149
Efficient secure channel free identity-based searchable encryption schemes with privacy preserving for cloud storage service
- 15 February 2024
- Published by Elsevier in Journal of Systems Architecture
- Vol. 149
Efficient secure channel free identity-based searchable encryption schemes with privacy preserving for cloud storage service
- Open Access
- 11 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 89595-89602
Lattice-Based Incremental Signature Scheme for the Authenticated Data Update in Fog Computing
To efficiently authenticate the updated data in fog computing, this paper proposed a latticebased incremental digital signature scheme. The proposed scheme is provable secure in the standard model whose security is based on the hardness of the shortest integer solution (SIS) problem. There are several characters of the proposed scheme that are suitable for the application in fog computing. Such as, most of the time-consuming computing operations in the proposed scheme can be finished by the parallel computing. As a result, the computing speed of the proposed scheme can be improved efficiently. On the other hand, compared with a known lattice-based incremental digital signature, both the public key size and the signature length are shorter. Then the store resource and the bandwidth of the fog device can be saved efficiently when it is used in fog computing. Furthermore, a simulated experiment is given to check the functions of the proposed scheme by Java language on PC. The result shows that the computing cost to update a signature is much less than that to resign a message. At the same time, the parallel computing and pre-computing can really efficiently improve the computing speed of the proposed scheme. Since the SIS problem is hard even on quantum computers, the proposed scheme also gives a post-quantum secure solution to authenticate the updated data in fog computing.
- 11 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 89595-89602
Open AccessLattice-Based Incremental Signature Scheme for the Authenticated Data Update in Fog Computing
To efficiently authenticate the updated data in fog computing, this paper proposed a latticebased incremental digital signature scheme. The proposed scheme is provable secure in the standard model whose security is based on the hardness of the shortest integer solution (SIS) problem. There are several characters of the proposed scheme that are suitable for the application in fog computing. Such as, most of the time-consuming computing operations in the proposed scheme can be finished by the parallel computing. As a result, the computing speed of the proposed scheme can be improved efficiently. On the other hand, compared with a known lattice-based incremental digital signature, both the public key size and the signature length are shorter. Then the store resource and the bandwidth of the fog device can be saved efficiently when it is used in fog computing. Furthermore, a simulated experiment is given to check the functions of the proposed scheme by Java language on PC. The result shows that the computing cost to update a signature is much less than that to resign a message. At the same time, the parallel computing and pre-computing can really efficiently improve the computing speed of the proposed scheme. Since the SIS problem is hard even on quantum computers, the proposed scheme also gives a post-quantum secure solution to authenticate the updated data in fog computing.
- Open Access
- 11 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 147481-147489
Lattice-Based Encrypted Verifiably Encryption Signature Scheme for the Fair and Private Electronic Commence
To achieve the fairness and the privacy of the e-commence, and also to consider the quantum security of the e-commence, a lattice-based encrypted verifiably encryption signature scheme (EVES) is proposed in this paper. We achieve the strong unforgeability and the opacity properties in the standard model over lattice without the help of the lattice-based delegation technologies which is one of main tools to achieve the standard model security for the lattice-based cryptography. It is shown that the proposed scheme can be used to design a fair and privacy-preserving e-commence system in cloud, not only for business-to-customer business(B2C) but also for customer-to-customer business(C2C). The main reason is that the verifier can read the details of the EVES by easily computation operations before the EVES is verified. Then the seller who acts as a verifier in EVES scheme can ask a proxy sever to deal the business for him. Then the seller does not need to keep online for most of time. Moreover, we compare the proposed EVES with some known lattice-based VES schemes. Besides the proposed scheme achieves the more cryptographic functions, such as EVES vs VES and standard model vs random oracle model etc., the proposed scheme even has some advantage about the computation cost compared with known lattice-based VES schemes.
- 11 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 147481-147489
Open AccessLattice-Based Encrypted Verifiably Encryption Signature Scheme for the Fair and Private Electronic Commence
To achieve the fairness and the privacy of the e-commence, and also to consider the quantum security of the e-commence, a lattice-based encrypted verifiably encryption signature scheme (EVES) is proposed in this paper. We achieve the strong unforgeability and the opacity properties in the standard model over lattice without the help of the lattice-based delegation technologies which is one of main tools to achieve the standard model security for the lattice-based cryptography. It is shown that the proposed scheme can be used to design a fair and privacy-preserving e-commence system in cloud, not only for business-to-customer business(B2C) but also for customer-to-customer business(C2C). The main reason is that the verifier can read the details of the EVES by easily computation operations before the EVES is verified. Then the seller who acts as a verifier in EVES scheme can ask a proxy sever to deal the business for him. Then the seller does not need to keep online for most of time. Moreover, we compare the proposed EVES with some known lattice-based VES schemes. Besides the proposed scheme achieves the more cryptographic functions, such as EVES vs VES and standard model vs random oracle model etc., the proposed scheme even has some advantage about the computation cost compared with known lattice-based VES schemes.
- 1 August 2016
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 17 (8) , 781-791
Efficient hierarchical identity based encryption scheme in the standard model over lattices
- 1 August 2016
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 17 (8) , 781-791
Efficient hierarchical identity based encryption scheme in the standard model over lattices