Preprint / Version 1

Polynomial Commitment-Based Zero-Knowledge Proof Schemes

A Brief Review

Authors

  • Becky Mundele Laramie County Community College
  • Chenchen Han Fujian University of Technology

DOI:

https://doi.org/10.21467/preprints.384

Abstract

Blockchain technology is one of the most popular information technologies at present, and its security features are realized through various cryptographic tools. Zero-knowledge proofs are such a tool that can increase data security and improve users’ privacy, and zero-knowledge proof schemes constructed with polynomial commitments have advantages in terms of verification time and proof size. Benefiting from the development of blockchain technology, zero-knowledge proof has also ushered in rapid development. This paper analyzes the research status of zero-knowledge proof schemes based on polynomial commitment construction, and introduces the construction and security of polynomial commitments. Finally, blockchain and some other potential commitment schemes that can be used for zero-knowledge proofs and blockchain construction are introduced as future research directions and engineering applications.

Keywords:

Polynomial commitment;, Zero-knowledge proof, Blockchain technology

Downloads

Download data is not yet available.

References

I. Damgård, “Commitment Schemes and Zero-Knowledge Protocols,” In School organized by the European Educational Forum, 1999, pp. 63-86, doi: 10.1007/3-540-48969-x_3.

A. Kate, G. M. Zaverucha, and I. Goldberg, “Constant-size commitments to polynomials and their applications,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010, vol. 6477 LNCS. doi: 10.1007/978-3-642-17373-8_11.

A. Banerjee, M. Clear and H. Tewari, “Demystifying the Role of zk-SNARKs in Zcash,” 2020 IEEE Conference on Application, Information and Network Security (AINS), 2020, pp. 12-19, doi: 10.1109/AINS50155.2020.9315064.

A. Rahimi and M. A. Maddah-Ali, “Multi-Party Proof Generation in QAP-Based zk-SNARKs,” in IEEE Journal on Selected Areas in Information Theory, vol. 2, no. 3, pp. 931-941, Sept. 2021, doi: 10.1109/JSAIT.2021.3102267.

B. Bünz, J. Bootle, D. Boneh, A. Poelstra, P. Wuille and G. Maxwell, “Bulletproofs: Short Proofs for Confidential Transactions and More,” 2018 IEEE Symposium on Security and Privacy (SP), 2018, pp. 315-334, doi: 10.1109/SP.2018.00020.

M. Maller, M. Kohlweiss, S. Bowe, and S. Meiklejohn, “Sonic: Zero-knowledge snarks from linear-size universal and updatable structured reference strings,” In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019, pp.2111-2128, doi: 10.1145/3319535.3339817.

J. Groth, “On the size of pairing-based non-interactive arguments,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2016, vol. 9666, pp. 305-326, doi: 10.1007/978-3-662-49896-5_11.

A. Gabizon, “AuroraLight: Improved prover efficiency and SRS size in a Sonic-like system,” Cryptol. ePrint Arch., 2019.

A. Chiesa, Y. Hu, M. Maller, P. Mishra, N. Vesely, and N. Ward, “Marlin: preprocessing zksnarks with universal and updatable srs,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2020, vol. 12105 LNCS, pp. 738-768, doi: 10.1007/978-3-030-45721-1_26.

A. Kattis, K. Panarin, and A. Vlasov, “RedShift: Transparent SNARKs from List Polynomial Commitment IOPs,” Eprint.Iacr, 2019.

B. Bünz, B. Fisch, and A. Szepieniec, “Transparent snarks from dark compilers,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2020, vol. 12105 LNCS, pp. 677-706, doi: 10.1007/978-3-030-45721-1_24.

D. Boneh, J. Drake, B. Fisch, and A. Gabizon, “Efficient polynomial commitment schemes for multiple points and polynomials,” IACR Cryptol. ePrint Arch., 2020.

A. Gabizon, Z. J. Williamson, and O. Ciobotaru, “PLONK?: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge,” IACR Cryptol. ePrint Arch., 2020.

D. Boneh, J. Drake, B. Fisch, and A. Gabizon, “Halo infinite: recursive zk-SNARKS from any additive polynomial commitment scheme,” IACR Cryptol. ePrint Arch., 2020.

J. Lee, “Dory: Efficient, Transparent Arguments for Generalised Inner Products and Polynomial Commitments,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2021, vol. 13043 LNCS, pp. 1-34, doi: 10.1007/978-3-030-90453-1_1.

S. Sahraei, S. Avestimehr and R. E. Ali, “Info-Commit: Information-Theoretic Polynomial Commitment,” in IEEE Transactions on Information Forensics and Security, 2022, doi: 10.1109/TIFS.2022.3163581.

C. Han, G. J. Kim, O. Alfarraj, A. Tolba, and Y Ren, “ZT-BDS: A Secure Blockchain-based Zero-trust Data Storage Scheme in 6G Edge IoT,” Journal of Internet Technology, 2022, 23(2), 89-95, doi: 10.53106/160792642022032302009.

J. Wang, C. Han, X. Yu, Y. Ren, and R. S. Sherratt, “Distributed Secure Storage Scheme Based on Sharding Blockchain,” Computers, Materials & Continua, 2022, 70(3), 4485-4502, doi: 10.32604/cmc.2022.020648.

C, Han, “Hierarchical Identity-based Broadcast Cryptography and its Application in Blockchain,” AIJR Preprints, 2021, doi: https://doi.org/10.21467/preprints.346.

D. Catalano and D. Fiore, “Vector commitments and their applications,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013, vol. 7778 LNCS, pp. 55-72, doi: 10.1007/978-3-642-36362-7_5.

B. Libert, S. C. Ramanna, and M. Yung, “Functional commitment schemes: From polynomial commitments to pairing-based accumulators from simple assumptions,” in Leibniz International Proceedings in Informatics, LIPIcs, 2016, vol. 55, doi: 10.4230/LIPIcs.ICALP.2016.30.

S. Srinivasan et al., “Hyperproofs: Aggregating and Maintaining Proofs in Vector Commitments,” Cryptol. ePrint Arch., 2021.

Downloads

Posted

2022-05-02

Section

Working Paper

Categories