Zhenfeng Zhang
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
Zhenfeng Zhang has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Jiang Zhang
State Key Laboratory of Cryptology
6 shared publications - Jing Xu
Chinese Academy of Sciences
3 shared publications Haodong Jiang
State Key Laboratory of Mathematical Engineering and Advanced Computing
2 shared publicationsLong Chen
Chinese Academy of Sciences
2 shared publicationsMinqian Wang
Chinese Academy of Sciences
2 shared publications- Xuexian Hu
Institute of Software, Chinese Academy of Sciences
2 shared publications
Latest Publications
- 29 November 2023
- Published by Springer Nature in Journal of Cryptology
- Vol. 37 (1) , 1-57
Lattice-Based Programmable Hash Functions and Applications
- 29 November 2023
- Published by Springer Nature in Journal of Cryptology
- Vol. 37 (1) , 1-57
Lattice-Based Programmable Hash Functions and Applications
- 26 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 15 (4) , 5057-5066
Fog-Centric Authenticated Key Agreement Scheme Without Trusted Parties
Fog computing can effectively provide a variety of application support for the fast-growing number of Internet of Things devices. However, the unique characteristics of fog computing also bring new security problems, especially the identity authentication in fog computing will face new challenges: Low latency (cloud servers should not be involved in authentication); fog servers are not completely trusted; robustness (no user reregistration is required when a fog server leaves fog) and lightweight (fog devices have constrained resources). In order to solve these problems faced by identity authentication in fog computing, we propose an authentication scheme suitable for fog computing environment, which implements mutual authentication between fog users and fog devices with the cooperation of incompletely trusted fog servers. Formal security analysis using the extended real-or-random (ROR) model shows that the proposed scheme is provably secure, and informal security analysis shows that the proposed scheme can resist known attacks. Compared with existing schemes, the proposed scheme supports more functionality features. In addition, a comparative analysis of the communication costs and calculation costs of various schemes shows that our scheme is more suitable for application in fog computing environment than the existing schemes.
- 26 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 15 (4) , 5057-5066
Fog-Centric Authenticated Key Agreement Scheme Without Trusted Parties
Fog computing can effectively provide a variety of application support for the fast-growing number of Internet of Things devices. However, the unique characteristics of fog computing also bring new security problems, especially the identity authentication in fog computing will face new challenges: Low latency (cloud servers should not be involved in authentication); fog servers are not completely trusted; robustness (no user reregistration is required when a fog server leaves fog) and lightweight (fog devices have constrained resources). In order to solve these problems faced by identity authentication in fog computing, we propose an authentication scheme suitable for fog computing environment, which implements mutual authentication between fog users and fog devices with the cooperation of incompletely trusted fog servers. Formal security analysis using the extended real-or-random (ROR) model shows that the proposed scheme is provably secure, and informal security analysis shows that the proposed scheme can resist known attacks. Compared with existing schemes, the proposed scheme supports more functionality features. In addition, a comparative analysis of the communication costs and calculation costs of various schemes shows that our scheme is more suitable for application in fog computing environment than the existing schemes.
- 29 April 2020
- Published by Springer Nature
- p. 37-65
Tweaking the Asymmetry of Asymmetric-Key Cryptography on Lattices: KEMs and Signatures of Smaller Sizes
- 29 April 2020
- Published by Springer Nature
- p. 37-65
Tweaking the Asymmetry of Asymmetric-Key Cryptography on Lattices: KEMs and Signatures of Smaller Sizes
- 6 April 2019
- Published by Springer Nature
- p. 618-645
Key Encapsulation Mechanism with Explicit Rejection in the Quantum Random Oracle Model
- 6 April 2019
- Published by Springer Nature
- p. 618-645
Key Encapsulation Mechanism with Explicit Rejection in the Quantum Random Oracle Model
- 15 February 2019
- Published by Springer Nature in Wireless Personal Communications
- Vol. 106 (2) , 321-343
Revisiting the Security of Qian et al.’s Revised Tree-$\hbox {LSHB}^+$ Protocol- 15 February 2019
- Published by Springer Nature in Wireless Personal Communications
- Vol. 106 (2) , 321-343
Revisiting the Security of Qian et al.’s Revised Tree-$\hbox {LSHB}^+$ Protocol- 29 October 2018
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 62 (4) , 490-506
Non-transferable Proxy Re-encryption
- 29 October 2018
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 62 (4) , 490-506
Non-transferable Proxy Re-encryption
- 23 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 18 (1) , 145-159
Accountable Proxy Re-Encryption for Secure Data Sharing
Proxy re-encryption (PRE) provides a promising solution for encrypted data sharing in public cloud. When data owner Alice is going to share her encrypted data with data consumer Bob, Alice generates a re-encryption key and sends it to the cloud server (proxy); by using it, the proxy can transform Alice's ciphertexts into Bob's without learning anything about the underlying plaintexts. Despite that existing PRE schemes can prevent the proxy from recovering Alice's secret key by collusion attacks with Bob, due to the inherent functionality of PRE, it is inevitable that the proxy and Bob together are capable to gain and distribute Alice's decryption capabilities. Even worse, the malicious proxy can deny that it has leaked the decryption capabilities and has very little risk of getting caught. To tackle this problem, we introduce the concept of Accountable Proxy Re-Encryption (APRE), whereby if the proxy is accused to abuse the re-encryption key for distributing Alice's decryption capability, a tracing algorithm can decide whether it is innocent or not. We then present a non-interactive APRE scheme and prove its CPA security and accountability under DBDH assumption in the standard model. Finally, we show how to extend it to a CCA secure one.
- 23 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 18 (1) , 145-159
Accountable Proxy Re-Encryption for Secure Data Sharing
Proxy re-encryption (PRE) provides a promising solution for encrypted data sharing in public cloud. When data owner Alice is going to share her encrypted data with data consumer Bob, Alice generates a re-encryption key and sends it to the cloud server (proxy); by using it, the proxy can transform Alice's ciphertexts into Bob's without learning anything about the underlying plaintexts. Despite that existing PRE schemes can prevent the proxy from recovering Alice's secret key by collusion attacks with Bob, due to the inherent functionality of PRE, it is inevitable that the proxy and Bob together are capable to gain and distribute Alice's decryption capabilities. Even worse, the malicious proxy can deny that it has leaked the decryption capabilities and has very little risk of getting caught. To tackle this problem, we introduce the concept of Accountable Proxy Re-Encryption (APRE), whereby if the proxy is accused to abuse the re-encryption key for distributing Alice's decryption capability, a tracing algorithm can decide whether it is innocent or not. We then present a non-interactive APRE scheme and prove its CPA security and accountability under DBDH assumption in the standard model. Finally, we show how to extend it to a CCA secure one.
- 24 July 2018
- Published by Springer Nature
- p. 96-125
IND-CCA-Secure Key Encapsulation Mechanism in the Quantum Random Oracle Model, Revisited
- 24 July 2018
- Published by Springer Nature
- p. 96-125
IND-CCA-Secure Key Encapsulation Mechanism in the Quantum Random Oracle Model, Revisited