Systematization of zero-knowledge proof methods
DOI:
https://doi.org/10.30837/rt.2025.4.223.04Keywords:
zero-knowledge proof, zero-knowledge, interactive protocol, zk-SNARK, zk-STARK, cryptographic protocolAbstract
The article systematizes modern methods of zero-knowledge proof (ZKP). Classification features are considered: protocol interactivity, algebraic or stochastic basis, need for trusted setup, type of zero-knowledge, and proof model. Classical schemes (Fiat–Shamir, Schnorr, Blum), modern zk-SNARK and zk-STARK, as well as novel approaches – PLONK, Halo 2, Bulletproofs, lattice-based ZKPs, and machine learning proofs are described. A comparative analysis is conducted according to efficiency, proof size, generation and verification complexity. It is shown that SNARKs provide compactness but require a trusted setup, while STARKs are transparent and post-quantum secure but large. Open problems are highlighted: recursive proofs, standardization, metadata protection, and applications in machine learning. It is concluded that further research in this field is aimed at creating scalable, secure, and quantum-resistant protocols for digital technologies.
References
Meiklejohn S., Mercer R. ZKProof Community Reference. ZKProof Community Docs. 2022. Режим досту-пу: http://docs.zkproof.org/reference.pdf
Lindell Y. How To Simulate It – A Tutorial on the Simulation Proof Technique // IACR Cryptology ePrint Archive. 2016. No. 046. Режим доступу: https://eprint.iacr.org/2016/046.pdf
Boneh D., Shoup V. A Graduate Course in Applied Cryptography. 2020. Ch. 19, 23. Режим доступу: https://crypto.stanford.edu/~dabo/cryptobook/
Ben-Sasson E., Chiesa A., Genkin D., Tromer E., Virza M. Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture // IACR Cryptology ePrint Archive. 2013. No. 879. Режим доступу: https://eprint.iacr.org/2013/879.pdf
Groth J. On the Size of Pairing-Based Non-interactive Arguments // IACR Cryptology ePrint Archive. 2016. No. 260. Режим доступу: https://eprint.iacr.org/2016/260.pdf
Ben-Sasson E., Bentov I., Horesh Y., Riabzev M. Scalable, transparent, and post-quantum secure computational integrity // IACR Cryptology ePrint Archive. 2018. No. 046. Режим доступу: https://eprint.iacr.org/2018/046.pdf
Bünz B., Bootle J., Boneh D., et al. Bulletproofs: Short Proofs for Confidential Transactions and More // IACR Cryptology ePrint Archive. 2017. No. 1066. [Електронний ресурс]. Режим доступу: https://eprint.iacr.org/2017/1066.pdf
Ben-Sasson E., Chiesa A., Spooner N. Interactive Oracle Proofs // Theory of Cryptography Conference (TCC 2016-B). Lecture Notes in Computer Science. Vol. 9985. Springer, 2016. P. 163–190.
Gabizon A., Williamson Z., Ciobotaru O. PLONK: Permutations over Lagrange-Bases for Oecumenical Non-interactive Arguments of Knowledge // IACR Cryptology ePrint Archive. 2019. No. 953. Режим доступу: https://eprint.iacr.org/2019/953.pdf
Bowe S., Gabizon A., Green M., et al. Halo 2: Recursive Proof Composition without a Trusted Setup // IACR Cryptology ePrint Archive. 2019. No. 1021. Режим доступу: https://eprint.iacr.org/2019/1021.pdf
Lyubashevsky V., Seiler G. Zero-Knowledge Proofs from Lattices: New Techniques // Advances in Cryptology – CRYPTO 2022. Lecture Notes in Computer Science. Vol. 13508. Springer, 2022. P. 66–92. DOI: 10.1007/978-3-031-15979-4_3
Hao M., Chen H., et al. zk-ML: Scalable Zero-knowledge Proofs for Non-linear Functions in Machine Learning // IACR Cryptology ePrint Archive. 2025. No. 507. Режим доступу: https://eprint.iacr.org/2025/507.pdf
Rafaël Del Pino: Efficient lattice-based zero-knowledge proofs and applications p. 49. Режим доступу: https://theses.hal.science/tel-02445482v1/document
Muhammed F. Esgin, Ron Steinfeld, Dongxi Liu, Sushmita Ruj: Efficient Hybrid Exact/Relaxed Lattice Proofs and Applications to Rounding and VRFs. Режим доступу: https://eprint.iacr.org/2022/141.pdf
Nicolas Gailly, Mary Maller, Anca Nitulescu: SnarkPack: Practical SNARK Aggregation. Financial Cryptog-raphy and Data Security: 26th International Conference, FC 2022, Grenada, May 2-6, 2022, Revised Selected Papers P. 203–229
Roy Lu: Moore’s Law for Zero Knowledge Proofs. Stanford Blockchain Review Volume 3, Article No. 2. Режим доступу: https://review.stanfordblockchain.xyz/ p/22-moores-law-for-zero-knowledge
Shashidhara R. Promise of Zero-Knowledge Proofs (ZKPs) for Blockchain Privacy and Security: Opportunities, Challenges, and Future Directions. Security and Privacy 8(1) September 2024. Режим доступу: https://www.researchgate.net/publication/ 384056745_Promise_of_Zero-Knowledge_Proofs_ZKPs_for_Blockchain_Privacy_and_Security_ Opportunities_Challenges_and_Future_Directions#:~:text=other%20zk,processes%20transac
Ivan Damgard: On Σ-protocols. CPT 2010, v.2. Режим доступу: https://www.cs.au.dk/~ivan/Sigma.pdf
Garg S. et al. zkSaaS: Zero-Knowledge SNARKs as a Service (USENIX Security 2023). Режим доступу: https://eprint.iacr.org/2023/905.pdf
Arka Rai Choudhuri, Sanjam Garg, Aarushi Goel, Sruthi Sekar, Rohit Sinha: SublonK: Sublinear Prover PLONK // Proceedings on Privacy Enhancing Technologies. 2024. No 3. P. 314–335. Режим доступу: https://petsymposium.org/popets/2024/popets-2024-0080.pdf
Kimi Wu: Revealing The All Mysterious zk-STARKs. Режим доступу: https://medium.com/coinmonks/reveal-mysterious-zk-starks-42d00679c05b
Ngoc Khanh Nguyen, George O'Rourke: More Efficient Lattice-Based Zero-Knowledge Proofs with Straight-Line Extractability. APKC '25 // Proceedings of the 12th ACM ASIA Public-Key Cryptography Workshop. Режим доступу: https://dl.acm.org/doi/10.1145/3709015.3728673
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
