Zongyang Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zongyang Zhang has a total of 78 co-authors. Here are the top co-authors by number of shared publications:
Jianwei Liu
School of Cyber Science and Technology, Beihang University, Beijing, China
10 shared publications- Jianwei Liu
Beihang University
6 shared publications Geng Li
National Computer Network Emergency Response Technical Team/Coordination Center of China
3 shared publicationsYanting Zhang
Beihang University
3 shared publicationsZibo Zhou
School of Cyber Science and Technology, Beihang University, Beijing, China
3 shared publications- Bernardo Magri
University of Manchester
2 shared publications
Latest Publications
- 15 November 2026
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 220
Ship: Signature-free MVBA with reduced communication and amortized linear complexity
- 15 November 2026
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 220
Ship: Signature-free MVBA with reduced communication and amortized linear complexity
- 9 October 2026
- Published by Springer Nature
- p. 253-273
Efficient MPC-Based Role Assignment for the YOSO Model
- 9 October 2026
- Published by Springer Nature
- p. 253-273
Efficient MPC-Based Role Assignment for the YOSO Model
- 22 July 2026
- Published by Springer Nature
- p. 351-381
The Cost of Fluidity: Communication Complexity Trade-Offs in Fluid MPC
- 22 July 2026
- Published by Springer Nature
- p. 351-381
The Cost of Fluidity: Communication Complexity Trade-Offs in Fluid MPC
- 20 February 2026
- Published by Springer Nature in Frontiers of Computer Science
- Vol. 20 (10) , 2010813
CP-SuperSpartan: commit-and-prove SNARKs for customizable constraint systems
- 20 February 2026
- Published by Springer Nature in Frontiers of Computer Science
- Vol. 20 (10) , 2010813
CP-SuperSpartan: commit-and-prove SNARKs for customizable constraint systems
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 35 (1) , 307-321
DyCAPS: Asynchronous Dynamic-Committee Proactive Secret Sharing
Dynamic-committee proactive secret sharing (DPSS) enables the refresh of secret shares and the alternation of shareholders without changing the secret. Such a proactivization functionality makes DPSS a promising technology for long-term key management and committee governance. In non-asynchronous networks, CHURP (CCS 2019) and COBRA (S&P 2022) have achieved best-case square and cubic communication cost, respectively, with regard to the number of shareholders. However, the overhead of asynchronous DPSS remains high. In this paper, we fill this gap and propose DyCAPS, an efficient asynchronous DPSS protocol with a cubic communication cost. DyCAPS supports the transfer of both low- and high-threshold secret shares among dynamic committees with the same communication and computation complexity. Experimental results show that proactivization between two disjoint committees of 4 (resp., 64) members takes 1.3 s (resp., 51 s).
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 35 (1) , 307-321
DyCAPS: Asynchronous Dynamic-Committee Proactive Secret Sharing
Dynamic-committee proactive secret sharing (DPSS) enables the refresh of secret shares and the alternation of shareholders without changing the secret. Such a proactivization functionality makes DPSS a promising technology for long-term key management and committee governance. In non-asynchronous networks, CHURP (CCS 2019) and COBRA (S&P 2022) have achieved best-case square and cubic communication cost, respectively, with regard to the number of shareholders. However, the overhead of asynchronous DPSS remains high. In this paper, we fill this gap and propose DyCAPS, an efficient asynchronous DPSS protocol with a cubic communication cost. DyCAPS supports the transfer of both low- and high-threshold secret shares among dynamic committees with the same communication and computation complexity. Experimental results show that proactivization between two disjoint committees of 4 (resp., 64) members takes 1.3 s (resp., 51 s).
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 453-467
QV-net: Decentralized Self-Tallying Quadratic Voting with Maximal Ballot Secrecy
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 453-467
Open AccessQV-net: Decentralized Self-Tallying Quadratic Voting with Maximal Ballot Secrecy
- Open Access
- 13 July 2025
- Published by Springer Nature in Cybersecurity
- Vol. 8 (1) , 1-14
Efficient and secure multi-party computation protocol supporting deep learning
Privacy-preserving deep learning based on secure multi-party computation (MPC) has emerged as a critical research focus in recent years. While existing approaches predominantly employ additive secret sharing with a fixed number of parties, they have yet to fully leverage the more efficient Shamir-based schemes. However, the adoption of Shamir secret sharing faces two key challenges: limitations of decimal computation and signed number representation. Furthermore, current solutions often lack optimization for specific computational modules and rely on conventional methods ill-suited for MPC environments. To address these issues, this paper proposes a fixed-point decimal-supported Shamir secret sharing scheme. A key innovation is our truncation algorithm, which effectively manages the expanded decimal digits resulting from multiplication operations, enabling comprehensive fixed-point arithmetic within the Shamir-based MPC framework. Extensive large-scale simulations validate the accuracy of our truncation method. Moreover, we introduce optimized protocols for two crucial deep learning operations: convolution and Softmax function computation. Our convolution protocol leverages the Winograd algorithm to significantly reduce multiplication gate count, yielding over 50% performance improvement. For Softmax computation, we extend existing two-party protocols to a multi-party Shamir setting, developing the nQSMax algorithm. This algorithm achieves exceptional accuracy exceeding 99% within seconds, requiring only a few iterations.
- 13 July 2025
- Published by Springer Nature in Cybersecurity
- Vol. 8 (1) , 1-14
Open AccessEfficient and secure multi-party computation protocol supporting deep learning
Privacy-preserving deep learning based on secure multi-party computation (MPC) has emerged as a critical research focus in recent years. While existing approaches predominantly employ additive secret sharing with a fixed number of parties, they have yet to fully leverage the more efficient Shamir-based schemes. However, the adoption of Shamir secret sharing faces two key challenges: limitations of decimal computation and signed number representation. Furthermore, current solutions often lack optimization for specific computational modules and rely on conventional methods ill-suited for MPC environments. To address these issues, this paper proposes a fixed-point decimal-supported Shamir secret sharing scheme. A key innovation is our truncation algorithm, which effectively manages the expanded decimal digits resulting from multiplication operations, enabling comprehensive fixed-point arithmetic within the Shamir-based MPC framework. Extensive large-scale simulations validate the accuracy of our truncation method. Moreover, we introduce optimized protocols for two crucial deep learning operations: convolution and Softmax function computation. Our convolution protocol leverages the Winograd algorithm to significantly reduce multiplication gate count, yielding over 50% performance improvement. For Softmax computation, we extend existing two-party protocols to a multi-party Shamir setting, developing the nQSMax algorithm. This algorithm achieves exceptional accuracy exceeding 99% within seconds, requiring only a few iterations.
- Open Access
- 9 July 2025
- Published by Springer Nature in Cybersecurity
- Vol. 8 (1) , 1-15
Efficient inner product arguments with sublogarithmic proof and sub-square-root verifier
Inner product arguments are core building blocks of numerous cryptographic primitives and therefore minimizing their complexity is a central goal in this research area. In this paper, we follow the work of Kim et al. (ASIACRYPT’22) and propose the first inner product argument having sublogarithmic communication complexity and sub-square-root verifier complexity simultaneously. We first devise a new subvector combination method for recursion and utilize an aggregated multi-exponentiation argument to prove some committed group elements are valid. We then modify the commitment keys in inner product arguments to be structured and reduce the verifier complexity by delegating the costly computations to the prover. Compared with the state-of-the-art inner product arguments, our protocol is highly competitive in terms of asymptotic complexity.
- 9 July 2025
- Published by Springer Nature in Cybersecurity
- Vol. 8 (1) , 1-15
Open AccessEfficient inner product arguments with sublogarithmic proof and sub-square-root verifier
Inner product arguments are core building blocks of numerous cryptographic primitives and therefore minimizing their complexity is a central goal in this research area. In this paper, we follow the work of Kim et al. (ASIACRYPT’22) and propose the first inner product argument having sublogarithmic communication complexity and sub-square-root verifier complexity simultaneously. We first devise a new subvector combination method for recursion and utilize an aggregated multi-exponentiation argument to prove some committed group elements are valid. We then modify the commitment keys in inner product arguments to be structured and reduce the verifier complexity by delegating the costly computations to the prover. Compared with the state-of-the-art inner product arguments, our protocol is highly competitive in terms of asymptotic complexity.
- Open Access
- 1 June 2025
- Published by KEAI Publishing in Digital Communications and Networks
- Vol. 11 (3) , 700-710
A consensus-based solution for cryptocurrencies arbitrage bots in intelligent blockchain
- 1 June 2025
- Published by KEAI Publishing in Digital Communications and Networks
- Vol. 11 (3) , 700-710
Open AccessA consensus-based solution for cryptocurrencies arbitrage bots in intelligent blockchain
- Top Cited Papers
- 16 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Surveys & Tutorials
- Vol. 28, 985-1024
Zero-Knowledge Proof-Based Verifiable Decentralized Machine Learning in Communication Network: A Comprehensive Survey
Over recent decades, machine learning has significantly advanced network communication, enabling improved decision-making, user behavior analysis, and fault detection. Simultaneously, the growth of communication networks has facilitated the efficient collection of large-scale training data. Traditional centralized machine learning, however, requires collecting data from users, raising significant concerns about privacy and security. Decentralized approaches, where participants exchange computation results instead of raw private data, mitigate these risks but introduce challenges related to trust and verifiability. A critical issue arises: How can one ensure the integrity and validity of computation results shared by other participants? Existing survey articles predominantly address security and privacy concerns in decentralized machine learning, whereas this survey uniquely highlights the emerging issue of verifiability. Recognizing the critical role of zero-knowledge proofs in ensuring verifiability, we present a comprehensive review of Zero-Knowledge Proof-based Verifiable Machine Learning (ZKP-VML). To clarify the research problem, we present a definition of ZKP-VML consisting of four algorithms and several key security properties. In addition, we provide an overview of the current research landscape by systematically organizing the research timeline and categorizing existing schemes based on their security properties. Furthermore, through an in-depth analysis of each existing scheme, we summarize their technical contributions and optimization strategies, aiming to uncover common design principles underlying ZKP-VML schemes. Building on the reviews and analysis presented, we identify current research challenges and suggest future research directions. To the best of our knowledge, this is the most comprehensive survey to date on verifiable decentralized machine learning and ZKP-VML.
- 16 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Surveys & Tutorials
- Vol. 28, 985-1024
Top Cited PapersZero-Knowledge Proof-Based Verifiable Decentralized Machine Learning in Communication Network: A Comprehensive Survey
Over recent decades, machine learning has significantly advanced network communication, enabling improved decision-making, user behavior analysis, and fault detection. Simultaneously, the growth of communication networks has facilitated the efficient collection of large-scale training data. Traditional centralized machine learning, however, requires collecting data from users, raising significant concerns about privacy and security. Decentralized approaches, where participants exchange computation results instead of raw private data, mitigate these risks but introduce challenges related to trust and verifiability. A critical issue arises: How can one ensure the integrity and validity of computation results shared by other participants? Existing survey articles predominantly address security and privacy concerns in decentralized machine learning, whereas this survey uniquely highlights the emerging issue of verifiability. Recognizing the critical role of zero-knowledge proofs in ensuring verifiability, we present a comprehensive review of Zero-Knowledge Proof-based Verifiable Machine Learning (ZKP-VML). To clarify the research problem, we present a definition of ZKP-VML consisting of four algorithms and several key security properties. In addition, we provide an overview of the current research landscape by systematically organizing the research timeline and categorizing existing schemes based on their security properties. Furthermore, through an in-depth analysis of each existing scheme, we summarize their technical contributions and optimization strategies, aiming to uncover common design principles underlying ZKP-VML schemes. Building on the reviews and analysis presented, we identify current research challenges and suggest future research directions. To the best of our knowledge, this is the most comprehensive survey to date on verifiable decentralized machine learning and ZKP-VML.