Junzuo Lai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Junzuo Lai has a total of 101 co-authors. Here are the top co-authors by number of shared publications:
- Zhengan Huang
Peng Cheng Laboratory
11 shared publications - Jian Weng
Guangzhou University
6 shared publications - Gongxian Zeng
Peng Cheng Laboratory
5 shared publications - Peng Li
Institute of Trustworthy Networks and Systems, School of Software, Tsinghua University, Beijing, China
5 shared publications - Anjia Yang
Jinan University
4 shared publications - Robert Huijie Deng
Singapore Management University, Singapore, Singapore
4 shared publications
Latest Publications
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (5) , 11658-11670
Verifiable Encrypted Timed Signature Scheme and Its Application in Blockchains
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (5) , 11658-11670
Verifiable Encrypted Timed Signature Scheme and Its Application in Blockchains
- 21 July 2026
- Published by Springer Nature
- p. 3-24
Multi-authority Attribute-Based Anonymous Credentials with Public Traceability and Revocation
- 21 July 2026
- Published by Springer Nature
- p. 3-24
Multi-authority Attribute-Based Anonymous Credentials with Public Traceability and Revocation
- 23 October 2025
- Published by Springer Nature
- p. 141-159
Zero-Knowledge Protocols with PVC Security: Striking the Balance Between Security and Efficiency
- 23 October 2025
- Published by Springer Nature
- p. 141-159
Zero-Knowledge Protocols with PVC Security: Striking the Balance Between Security and Efficiency
- 10 May 2025
- Published by Springer Nature
- p. 135-139
Attribute-Based Encryption with Offline Computation and Outsourced Decryption
- 10 May 2025
- Published by Springer Nature
- p. 135-139
Attribute-Based Encryption with Offline Computation and Outsourced Decryption
- Open Access
- 7 May 2025
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 57 (10) , 1-34
Cryptographic Primitives in Script-based and Scriptless Payment Channel Networks: A Survey
Payment Channel Networks (PCNs), pivotal for blockchain scalability, facilitate multiple off-chain payments between any two users. They utilize scripts to define and execute payment conditions in various blockchains, but this poses privacy, efficiency, and compatibility challenges. To overcome these, scriptless cleverly embeds payment conditions into digital signatures instead of complex scripts. Cryptography effectively safeguards the construction and publication of transactions in script-based and scriptless PCNs. Although several surveys analyze PCN protocols, only a few discuss their underlying scripting languages and none explore the cryptography involved. This survey is the first to comprehensively overview cryptography in PCNs from scripting perspectives, filling the existing knowledge void. Our analysis offers a complete picture of script-based and scriptless protocols and their coexistence. We then explore advanced cryptographic primitives in both categories, systematically studying these for the first time, and demonstrate their instantiations in atomic swaps. Finally, we research vast related surveys and provide a future-oriented outlook.
- 7 May 2025
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 57 (10) , 1-34
Open AccessCryptographic Primitives in Script-based and Scriptless Payment Channel Networks: A Survey
Payment Channel Networks (PCNs), pivotal for blockchain scalability, facilitate multiple off-chain payments between any two users. They utilize scripts to define and execute payment conditions in various blockchains, but this poses privacy, efficiency, and compatibility challenges. To overcome these, scriptless cleverly embeds payment conditions into digital signatures instead of complex scripts. Cryptography effectively safeguards the construction and publication of transactions in script-based and scriptless PCNs. Although several surveys analyze PCN protocols, only a few discuss their underlying scripting languages and none explore the cryptography involved. This survey is the first to comprehensively overview cryptography in PCNs from scripting perspectives, filling the existing knowledge void. Our analysis offers a complete picture of script-based and scriptless protocols and their coexistence. We then explore advanced cryptographic primitives in both categories, systematically studying these for the first time, and demonstrate their instantiations in atomic swaps. Finally, we research vast related surveys and provide a future-oriented outlook.
- 28 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 13 (2) , 655-666
Delegatable Multi-Authority Attribute-Based Anonymous Credentials
In cloud computing, users need to authenticate to access various resources. Attribute-based anonymous credentials (ABCs) provide a tool for privacy-preserving authentication, allowing users to prove possession of a set of attributes to cloud service providers anonymously. Most existing works on ABC deal with credentials on attributes issued by a single authority (issuer). In reality, it is more practical for users to obtain credentials on attributes from multiple authorities. There are a few works on multi-authority ABC, which do not support delegation needed in real deployments. In this paper, we present the first delegatable multi-authority attribute-based anonymous credential system, which simultaneously achieves revocation and traceability. We also give the security analysis of our construction. Finally, we implement our system, and the experimental results show its efficiency.
- 28 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 13 (2) , 655-666
Delegatable Multi-Authority Attribute-Based Anonymous Credentials
In cloud computing, users need to authenticate to access various resources. Attribute-based anonymous credentials (ABCs) provide a tool for privacy-preserving authentication, allowing users to prove possession of a set of attributes to cloud service providers anonymously. Most existing works on ABC deal with credentials on attributes issued by a single authority (issuer). In reality, it is more practical for users to obtain credentials on attributes from multiple authorities. There are a few works on multi-authority ABC, which do not support delegation needed in real deployments. In this paper, we present the first delegatable multi-authority attribute-based anonymous credential system, which simultaneously achieves revocation and traceability. We also give the security analysis of our construction. Finally, we implement our system, and the experimental results show its efficiency.
- 25 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (5) , 4847-4860
Privacy-Preserving Ridge Regression Over Encrypted Data Under Multiple Keys
With the increase of private data being collected by data owners, it has been a trend for data owners to store the data on cloud computing platforms. The huge amounts of data in cloud servers bring fresh development opportunities to machine learning, which is applied to build a high-quality machine learning model based on a large training dataset. However, to ensure the privacy of data and facilitate retrieval, data owners often upload encrypted data under their public keys. But it creates new challenges for machine learning to learn a predictive model over these encrypted data under different keys. Most existing privacy-preserving machine learning works make contributions over one dataset or multiple datasets encrypted with the same public key, which limits the utilization of these schemes in practice. In this paper, we consider a more practical scenario as the secure learning algorithm involves multiple data sources encrypted with different public keys. In this setting, we present a novel scheme for privacy-preserving ridge regression over arbitrarily-partitioned datasets to protect the confidentiality of raw data and the model. To achieve secure computing and the best performance, we construct privacy-preserving computation protocols using a linearly-homomorphic encryption (LHE) scheme and an additive homomorphic proxy re-encryption (PRE) scheme. The security analysis shows that our scheme satisfies the predefined security requirements. The theoretical analysis and experimental evaluations on varying datasets demonstrate its practicability.
- 25 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (5) , 4847-4860
Privacy-Preserving Ridge Regression Over Encrypted Data Under Multiple Keys
With the increase of private data being collected by data owners, it has been a trend for data owners to store the data on cloud computing platforms. The huge amounts of data in cloud servers bring fresh development opportunities to machine learning, which is applied to build a high-quality machine learning model based on a large training dataset. However, to ensure the privacy of data and facilitate retrieval, data owners often upload encrypted data under their public keys. But it creates new challenges for machine learning to learn a predictive model over these encrypted data under different keys. Most existing privacy-preserving machine learning works make contributions over one dataset or multiple datasets encrypted with the same public key, which limits the utilization of these schemes in practice. In this paper, we consider a more practical scenario as the secure learning algorithm involves multiple data sources encrypted with different public keys. In this setting, we present a novel scheme for privacy-preserving ridge regression over arbitrarily-partitioned datasets to protect the confidentiality of raw data and the model. To achieve secure computing and the best performance, we construct privacy-preserving computation protocols using a linearly-homomorphic encryption (LHE) scheme and an additive homomorphic proxy re-encryption (PRE) scheme. The security analysis shows that our scheme satisfies the predefined security requirements. The theoretical analysis and experimental evaluations on varying datasets demonstrate its practicability.
- Open Access
- 1 January 2025
- Published by Institution of Engineering and Technology (IET) in IET Information Security
- Vol. 2025 (1)
Secure and Editable: A Blockchain Voting System Based on Chameleon Hash With Ephemeral Trapdoors
Blockchain technology has become a popular choice for electronic voting systems due to its transparency, security, and decentralization. However, it is not a perfect solution, as its inherent immutability poses challenges in blockchain‐based e‐voting systems. Specifically, without the physical security provided by traditional polling stations, preventing bribery and coercion becomes more difficult. Additionally, because of blockchain’s immutability, voters who are coerced or mistakenly vote cannot correct their choice. To address these issues, this paper proposes a secure blockchain‐based voting system with editable ballots. The system uses chameleon hashes with ephemeral trapdoors and a timestamp mechanism, allowing voters to modify their ballots within a legitimate timeframe. Additionally, a modified Paillier cryptosystem and blind signature technology are used to ensure that any modifications leave no trace. We simulate and evaluate the system using Fabric 2.2, focusing on computational complexity and system stability. Analysis of experimental results shows that the blockchain‐based voting system with an editable ballot mechanism proposed in this article has good computational cost and stability performance under normal use pressure.
- 1 January 2025
- Published by Institution of Engineering and Technology (IET) in IET Information Security
- Vol. 2025 (1)
Open AccessSecure and Editable: A Blockchain Voting System Based on Chameleon Hash With Ephemeral Trapdoors
Blockchain technology has become a popular choice for electronic voting systems due to its transparency, security, and decentralization. However, it is not a perfect solution, as its inherent immutability poses challenges in blockchain‐based e‐voting systems. Specifically, without the physical security provided by traditional polling stations, preventing bribery and coercion becomes more difficult. Additionally, because of blockchain’s immutability, voters who are coerced or mistakenly vote cannot correct their choice. To address these issues, this paper proposes a secure blockchain‐based voting system with editable ballots. The system uses chameleon hashes with ephemeral trapdoors and a timestamp mechanism, allowing voters to modify their ballots within a legitimate timeframe. Additionally, a modified Paillier cryptosystem and blind signature technology are used to ensure that any modifications leave no trace. We simulate and evaluate the system using Fabric 2.2, focusing on computational complexity and system stability. Analysis of experimental results shows that the blockchain‐based voting system with an editable ballot mechanism proposed in this article has good computational cost and stability performance under normal use pressure.
- 11 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 1251-1261
AuditPCH: Auditable Payment Channel Hub With Privacy Protection
Anonymous Payment Channel Hub (PCH), one of the most promising layer-two solutions, settles the scalability issue in blockchain while guaranteeing the unlinkability of transacting parties. However, such developments bring conflicting requirements, i.e., hiding the sender-to-receiver relationships from any third party but opening the relationship to the auditor. Existing works do not support these requirements simultaneously since off-chain transactions are not recorded in the blockchain. Further, the privacy protection strategies hinder auditors from capturing the payment relationships. Thus, it is still a challenge to audit the finance activities of PCH transacting parties. This paper proposes a novel anonymous PCH solution called AuditPCH to achieve privacy and auditability. Concretely, we design a Linkable Randomizable Puzzle scheme for constructing conditional transactions, allowing a sender to pay for a receiver via the hub. As such, AuditPCH, with the new LRP scheme, ensures that (1) payment relationships can be protected from the hub and (2) an auditor with necessary trapdoors can associate the sender and receiver of a payment. We prove the security of AuditPCH under the Global Universal Composability framework. The extensive experimental evaluations on AuditPCH are established to demonstrate its functionality and flexibility.
- 11 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 1251-1261
AuditPCH: Auditable Payment Channel Hub With Privacy Protection
Anonymous Payment Channel Hub (PCH), one of the most promising layer-two solutions, settles the scalability issue in blockchain while guaranteeing the unlinkability of transacting parties. However, such developments bring conflicting requirements, i.e., hiding the sender-to-receiver relationships from any third party but opening the relationship to the auditor. Existing works do not support these requirements simultaneously since off-chain transactions are not recorded in the blockchain. Further, the privacy protection strategies hinder auditors from capturing the payment relationships. Thus, it is still a challenge to audit the finance activities of PCH transacting parties. This paper proposes a novel anonymous PCH solution called AuditPCH to achieve privacy and auditability. Concretely, we design a Linkable Randomizable Puzzle scheme for constructing conditional transactions, allowing a sender to pay for a receiver via the hub. As such, AuditPCH, with the new LRP scheme, ensures that (1) payment relationships can be protected from the hub and (2) an auditor with necessary trapdoors can associate the sender and receiver of a payment. We prove the security of AuditPCH under the Global Universal Composability framework. The extensive experimental evaluations on AuditPCH are established to demonstrate its functionality and flexibility.
- 11 December 2024
- Published by Springer Nature
- p. 266-295
Mild Asymmetric Message Franking: Illegal-Messages-Only and Retrospective Content Moderation
- 11 December 2024
- Published by Springer Nature
- p. 266-295
Mild Asymmetric Message Franking: Illegal-Messages-Only and Retrospective Content Moderation