{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T16:16:34Z","timestamp":1776701794676,"version":"3.51.2"},"reference-count":77,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T00:00:00Z","timestamp":1776643200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NATO Science for Peace and Security Programme","award":["G7394"],"award-info":[{"award-number":["G7394"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>Polynomial commitment schemes (PCS) enable a prover to commit to a polynomial and later reveal evaluations with succinct, verifiable proofs. As critical components of modern cryptographic systems like Verkle trees and zk-SNARKs, these methods are experiencing a significant transition from classical to post-quantum designs. This comprehensive research systematically compares the major scheme families to examine this progression, from pairing-based KZG and transparent Bulletproofs to lattice-based and hash-based post-quantum alternatives. We present a unified taxonomy that maps the classical-to-post-quantum transition across trust models, security assumptions, and efficiency measures after conducting a PRISMA-guided systematic review of 77 works. Our analysis reveals a fundamental trade-off between efficiency and security: classical schemes, which rely on quantum-vulnerable assumptions, provide optimal performance with constant-sized proofs, while post-quantum alternatives offer quantum resistance at the cost of larger proofs and higher computational overhead. By combining research works, we highlight recurrent problems with adaptive security, verification efficiency, and proof conciseness. We offer a specific research roadmap with prioritized short-, medium-, and long-term directions to close the performance gap between quantum-resistant and classical architectures based on our quantitative analysis. This study offers a technical reference and a strategic roadmap for constructing practical post-quantum polynomial commitments.<\/jats:p>","DOI":"10.3390\/cryptography10020027","type":"journal-article","created":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T14:53:23Z","timestamp":1776696803000},"page":"27","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial Commitment Schemes from Classical Constructions to Post-Quantum Directions"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3109-7971","authenticated-orcid":false,"given":"Maksim","family":"Iavich","sequence":"first","affiliation":[{"name":"Department of Computer Science, Caucasus University, 0102 Tbilisi, Georgia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1997-465X","authenticated-orcid":false,"given":"Tamari","family":"Kuchukhidze","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Caucasus University, 0102 Tbilisi, Georgia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6577-1904","authenticated-orcid":false,"given":"Razvan","family":"Bocu","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Transilvania University of Brasov, 500036 Brasov, Romania"}]}],"member":"1968","published-online":{"date-parts":[[2026,4,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Gaur, R., Prakash, S., Kumar, S., Abhishek, K., Msahli, M., and Wahid, A. (2022). A machine-learning\u2013blockchain-based authentication using smart contracts for an IoHT system. Sensors, 22.","DOI":"10.3390\/s22239074"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Arun, A., Ganesh, C., Lokam, S., Mopuri, T., and Sridhar, S. (2023). Dew: A transparent constant-sized polynomial commitment scheme. IACR International Conference on Public-Key Cryptography, Springer Nature.","DOI":"10.1007\/978-3-031-31371-4_19"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Zeilberger, H., Chen, B., and Fisch, B. (2024). BaseFold: Efficient field-agnostic polynomial commitment schemes from foldable codes. Annual International Cryptology Conference, Springer Nature.","DOI":"10.1007\/978-3-031-68403-6_5"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., and Tromer, E. (2012). From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, Association for Computing Machinery.","DOI":"10.1145\/2090236.2090263"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Sasson, E.B., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., and Virza, M. (2014). Zerocash: Decentralized anonymous payments from bitcoin. 2014 IEEE Symposium on Security and Privacy, IEEE.","DOI":"10.1109\/SP.2014.36"},{"key":"ref_6","unstructured":"Kuszmaul, J. (2019). Verkle trees. Proceedings of the 2019 MIT PRIMES Conference, MIT Mathematics."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Dhillon, V., Metcalf, D., and Hooper, M. (2025). Unpacking ethereum. AI Frameworks Enabled by Blockchain: Creating Trustworthy and Responsible AI Using Distributed Ledger Technology, Apress.","DOI":"10.1007\/979-8-8688-1402-0"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Fiore, D., and Querol, A. (2019). LegoSNARK: Modular design and composition of succinct zero-knowledge proofs. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery.","DOI":"10.1145\/3319535.3339820"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Wee, H., and Wu, D.J. (2023). Succinct vector, polynomial, and functional commitments from lattices. Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer Nature.","DOI":"10.1007\/978-3-031-30620-4_13"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Catalano, D., and Fiore, D. (2013). Vector commitments and their applications. International Workshop on Public Key Cryptography, Springer.","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0036144598347011","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"41","year":"1999","journal-title":"SIAM Rev."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Kate, A., Zaverucha, G.M., and Goldberg, I. (2010). Constant-size commitments to polynomials and their applications. International Conference on the Theory and Application of Cryptology and Information Security, Springer.","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., and Maxwell, G. (2018). Bulletproofs: Short proofs for confidential transactions and more. 2018 IEEE Symposium on Security and Privacy (SP), IEEE.","DOI":"10.1109\/SP.2018.00020"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1007\/s11227-025-07018-y","article-title":"Quantum-resistant blockchain and performance analysis","volume":"81","author":"Wu","year":"2025","journal-title":"J. Supercomput."},{"key":"ref_15","first-page":"1043","article-title":"Brakedown: Linear-time and post-quantum SNARKs for R1CS","volume":"2021","author":"Golovnev","year":"2021","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Xie, T., Zhang, Y., and Song, D. (2022). Orion: Zero knowledge proof with linear prover time. Annual International Cryptology Conference, Springer Nature.","DOI":"10.1007\/978-3-031-15985-5_11"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Peikert, C., Pepin, Z., and Sharp, C. (2021). Vector and functional commitments from lattices. Theory of Cryptography Conference, Springer International Publishing.","DOI":"10.1007\/978-3-030-90456-2_16"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Cini, V., Lai, R.W., Malavolta, G., and Thyagarajan, S.A. (2022). Lattice-based SNARKs: Publicly verifiable, preprocessing, and recursively composable. Annual International Cryptology Conference, Springer Nature.","DOI":"10.1007\/978-3-031-15979-4_4"},{"key":"ref_19","first-page":"46","article-title":"Scalable, transparent, and post-quantum secure computational integrity","volume":"2018","author":"Bentov","year":"2018","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., and Ward, N.P. (2019). Aurora: Transparent succinct arguments for R1CS. Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer International Publishing.","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., and Ward, N. (2020). Marlin: Preprocessing zkSNARKs with universal and updatable SRS. Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer International Publishing.","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"ref_22","unstructured":"Gabizon, A., and Williamson, Z.J. (2026, April 16). Plookup: A Simplified Polynomial Protocol for Lookup Tables. Cryptology ePrint Archive 2020, Paper 2020\/315. Available online: https:\/\/eprint.iacr.org\/2020\/315."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Groth, J., and Petit, C. (2016). Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer.","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"42081","DOI":"10.1109\/ACCESS.2022.3167806","article-title":"Bulletproofs+: Shorter proofs for a privacy-enhanced distributed ledger","volume":"10","author":"Chung","year":"2022","journal-title":"IEEE Access"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Fisch, B., and Szepieniec, A. (2020). Transparent SNARKs from DARK compilers. Advances in Cryptology\u2013EUROCRYPT 2020, Springer.","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., and Vaikuntanathan, V. (2008). Trapdoors for hard lattices and new cryptographic constructions. Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, Association for Computing Machinery.","DOI":"10.1145\/1374376.1374407"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J. (2025). Post-quantum cryptography. Encyclopedia of Cryptography, Security and Privacy, Springer Nature.","DOI":"10.1007\/978-3-030-71522-9_386"},{"key":"ref_28","first-page":"481","article-title":"How to prove any NP statement jointly? Efficient Distributed-prover Zero-Knowledge Protocols","volume":"2022","author":"Dayama","year":"2022","journal-title":"Proc. Priv. Enhanc. Technol."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/j.ijsu.2010.02.007","article-title":"Preferred reporting items for systematic reviews and meta-analyses: The PRISMA statement","volume":"8","author":"Moher","year":"2010","journal-title":"Int. J. Surg."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Panait, A.E., and Olimid, R.F. (2020). On using zk-SNARKs and zk-STARKs in blockchain-based identity management. International Conference on Information Technology and Communications Security, Springer International Publishing.","DOI":"10.1007\/978-3-030-69255-1_9"},{"key":"ref_31","unstructured":"Libert, B., Ramanna, S.C., and Yung, M. (2016). Functional commitment schemes: From polynomial commitments to pairing-based accumulators from simple assumptions. 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016), Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Goharshady, A.K., and Pourdamghani, A. (2019). Probabilistic smart contracts: Secure randomness on the blockchain. 2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC), IEEE.","DOI":"10.1109\/BLOC.2019.8751326"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., and Fujisaki, E. (2002). A statistically-hiding integer commitment scheme based on groups with hidden order. International Conference on the Theory and Application of Cryptology and Information Security, Springer.","DOI":"10.1007\/3-540-36178-2_8"},{"key":"ref_34","unstructured":"Zhang, J., Xie, T., Hoang, T., Shi, E., and Zhang, Y. (2022). Polynomial commitment with a {One-to-Many} prover and applications. 31st USENIX Security Symposium (USENIX Security 22), USENIX Association."},{"key":"ref_35","unstructured":"South, T., Camuto, A., Jain, S., Nguyen, S., Mahari, R., Paquin, C., Morton, J., and Pentland, A.S. (2024). Verifiable evaluations of machine learning models using zkSNARKs. arXiv."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Guo, F., Mu, Y., and Chen, Z. (2007). Mutative identity-based signatures or dynamic credentials without random oracles. International Conference on Cryptology and Network Security, Springer.","DOI":"10.1007\/978-3-540-76969-9_1"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Chen, M., Chiesa, A., Gur, T., O\u2019Connor, J., and Spooner, N. (2023). Proof-carrying data from arithmetized random oracles. Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer Nature.","DOI":"10.1007\/978-3-031-30617-4_13"},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Setty, S. (2020). Spartan: Efficient and general-purpose zkSNARKs without trusted setup. Annual International Cryptology Conference, Springer International Publishing.","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"ref_39","unstructured":"Pei, D., Salomaa, A., and Ding, C. (1996). Chinese Remainder Theorem: Applications in Computing, Coding, Cryptography, World Scientific."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1561\/0400000074","article-title":"A decade of lattice cryptography","volume":"10","author":"Peikert","year":"2016","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Zhang, J., Xie, T., Zhang, Y., and Song, D. (2020). Transparent polynomial delegation and its applications to zero knowledge proof. 2020 IEEE Symposium on Security and Privacy (SP), IEEE.","DOI":"10.1109\/SP40000.2020.00052"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"den Hollander, T., and Slamanig, D. (2024). A crack in the firmament: Restoring soundness of the Orion proof system and more. Cryptol. ePrint Arch.","DOI":"10.1007\/978-981-95-5116-3_13"},{"key":"ref_43","first-page":"427","article-title":"Polaris: Transparent succinct zero-knowledge arguments for R1CS with efficient verifier","volume":"2022","author":"Fu","year":"2022","journal-title":"Proc. Priv. Enhanc. Technol."},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Xie, T., Zhang, J., Zhang, Y., Papamanthou, C., and Song, D. (2019). Libra: Succinct zero-knowledge proofs with optimal prover computation. Annual International Cryptology Conference, Springer International Publishing.","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Lipmaa, H., Parisella, R., and Siim, J. (2025). On knowledge-soundness of plonk in ROM from falsifiable assumptions. Annual International Cryptology Conference, Springer Nature.","DOI":"10.1007\/978-3-032-01907-3_12"},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Aranha, D.F., Bennedsen, E.M., Campanelli, M., Ganesh, C., Orlandi, C., and Takahashi, A. (2022). ECLIPSE: Enhanced compiling method for pedersen-committed zkSNARK engines. IACR International Conference on Public-Key Cryptography, Springer International Publishing.","DOI":"10.1007\/978-3-030-97121-2_21"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Ganesh, C., Khoshakhlagh, H., Kohlweiss, M., Nitulescu, A., and Zaj\u0105c, M. (2022). What makes fiat\u2013shamir zksnarks (updatable srs) simulation extractable?. International Conference on Security and Cryptography for Networks, Springer International Publishing.","DOI":"10.1007\/978-3-031-14791-3_32"},{"key":"ref_48","unstructured":"Kappos, G., Yousaf, H., Maller, M., and Meiklejohn, S. (2018). An empirical analysis of anonymity in zcash. 27th USENIX Security Symposium (USENIX Security 18), USENIX Association."},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Lavaur, T., Lacan, J., and Chanel, C.P. (2022). Enabling blockchain services for ioe with zk-rollups. Sensors, 22.","DOI":"10.20944\/preprints202208.0023.v1"},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Lin, K.W., and Chen, Y.C. (2023). A file verification scheme based on verkle trees. 2023 International Conference on Consumer Electronics-Taiwan (ICCE-Taiwan), IEEE.","DOI":"10.1109\/ICCE-Taiwan58799.2023.10226788"},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Lee, J. (2021). Dory: Efficient, transparent arguments for generalised inner products and polynomial commitments. Theory of Cryptography Conference, Springer International Publishing.","DOI":"10.1007\/978-3-030-90453-1_1"},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Stadler, M. (1996). Publicly verifiable secret sharing. International Conference on the Theory and Applications of Cryptographic Techniques, Springer.","DOI":"10.1007\/3-540-68339-9_17"},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Cascudo, I., and David, B. (2024). Publicly verifiable secret sharing over class groups and applications to DKG and YOSO. Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer Nature.","DOI":"10.1007\/978-3-031-58740-5_8"},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Shor, P.W. (1994). Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE.","DOI":"10.1109\/SFCS.1994.365700"},{"key":"ref_55","unstructured":"Cheon, J.H., and Johansson, T. (2017). Post-Quantum Cryptography, National Institute of Standards and Technology. Technical Report NIST IR 8105."},{"key":"ref_56","first-page":"1","article-title":"Hash function of finalist SHA-3: Analysis study","volume":"2","author":"Alahmad","year":"2014","journal-title":"Int. J. Adv. Comput. Sci. Inf. Technol."},{"key":"ref_57","doi-asserted-by":"crossref","unstructured":"Boneh, D., B\u00fcnz, B., and Fisch, B. (2019). Batching techniques for accumulators with applications to IOPs and stateless blockchains. Annual International Cryptology Conference, Springer International Publishing.","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"de Castro, L., and Peikert, C. (2023). Functional commitments for all functions, with transparent setup and from SIS. Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer Nature.","DOI":"10.1007\/978-3-031-30620-4_10"},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"127404","DOI":"10.1016\/j.eswa.2025.127404","article-title":"Semantically enhanced selective image encryption scheme with parallel computing","volume":"279","author":"Liu","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.matcom.2022.07.029","article-title":"A parallel image encryption algorithm using intra bitplane scrambling","volume":"204","author":"Song","year":"2023","journal-title":"Math. Comput. Simul."},{"key":"ref_61","doi-asserted-by":"crossref","unstructured":"Groth, J. (2016). On the size of pairing-based non-interactive arguments. Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer.","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"ref_62","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Maller, M., Mishra, P., Tyagi, N., and Vesely, P. (2021). Proofs for inner pairing products and applications. International Conference on the Theory and Application of Cryptology and Information Security, Springer International Publishing.","DOI":"10.1007\/978-3-030-92078-4_3"},{"key":"ref_63","doi-asserted-by":"crossref","unstructured":"Lipmaa, H. (2012). Secure accumulators from euclidean rings without trusted setup. International Conference on Applied Cryptography and Network Security, Springer.","DOI":"10.1007\/978-3-642-31284-7_14"},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Maller, M., Bowe, S., Kohlweiss, M., and Meiklejohn, S. (2019). Sonic: Zero-knowledge SNARKs from linear-size universal and updatable structured reference strings. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery.","DOI":"10.1145\/3319535.3339817"},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3292548","article-title":"Post-quantum lattice-based cryptography implementations: A survey","volume":"51","author":"Nejatollahi","year":"2019","journal-title":"ACM Comput. Surv."},{"key":"ref_66","doi-asserted-by":"crossref","unstructured":"Gailly, N., Maller, M., and Nitulescu, A. (2022). Snarkpack: Practical snark aggregation. International Conference on Financial Cryptography and Data Security, Springer International Publishing.","DOI":"10.1007\/978-3-031-18283-9_10"},{"key":"ref_67","doi-asserted-by":"crossref","unstructured":"Canetti, R., Jain, P., Swanberg, M., and Varia, M. (2022). Universally composable end-to-end secure messaging. Annual International Cryptology Conference, Springer Nature.","DOI":"10.1007\/978-3-031-15979-4_1"},{"key":"ref_68","doi-asserted-by":"crossref","unstructured":"Boneh, D., Kim, S., and Wu, D.J. (2017). Constrained keys for invertible pseudorandom functions. Theory of Cryptography Conference, Springer International Publishing.","DOI":"10.1007\/978-3-319-70500-2_9"},{"key":"ref_69","doi-asserted-by":"crossref","unstructured":"\u010capko, D., Vukmirovi\u0107, S., and Nedi\u0107, N. (2022). State of the art of zero-knowledge proofs in blockchain. 2022 30th Telecommunications Forum (TELFOR), IEEE.","DOI":"10.1109\/TELFOR56187.2022.9983760"},{"key":"ref_70","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Ojha, D., and Spooner, N. (2020). Fractal: Post-quantum and transparent recursive proofs from holography. Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer International Publishing.","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"ref_71","doi-asserted-by":"crossref","unstructured":"Devadas, L., Goyal, R., Kalai, Y., and Vaikuntanathan, V. (2022). Rate-1 non-interactive arguments for batch-NP and applications. 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), IEEE.","DOI":"10.1109\/FOCS54457.2022.00103"},{"key":"ref_72","unstructured":"Bowe, S., Grigg, J., and Hopwood, D. (2026, April 16). Recursive Proof Composition Without a Trusted Setup. Cryptology ePrint Archive, 2019, Paper 2019\/1021. Available online: https:\/\/eprint.iacr.org\/2019\/1021."},{"key":"ref_73","unstructured":"Vlasov, A., and Panarin, K. (2026, April 16). Transparent Polynomial Commitment Scheme with Polylogarithmic Communication Complexity. Cryptology ePrint Archive 2019, Paper 2019\/1020. Available online: https:\/\/eprint.iacr.org\/2019\/1020."},{"key":"ref_74","doi-asserted-by":"crossref","unstructured":"Karantaidou, I., and Baldimtsi, F. (2021). Efficient constructions of pairing based accumulators. 2021 IEEE 34th Computer Security Foundations Symposium (CSF), IEEE.","DOI":"10.1109\/CSF51468.2021.00033"},{"key":"ref_75","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Nguyen, N.K., and Plan\u00e7on, M. (2022). Lattice-based zero-knowledge proofs and applications: Shorter, simpler, and more general. Annual International Cryptology Conference, Springer Nature.","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"ref_76","unstructured":"Boneh, D., Drake, J., Fisch, B., and Gabizon, A. (2026, April 16). Halo Infinite: Recursive zk-SNARKs from Any Additive Polynomial Commitment Scheme. Cryptology ePrint Archive 2020, Paper 2020\/1536. Available online: https:\/\/eprint.iacr.org\/2020\/1536."},{"key":"ref_77","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1007\/s42452-019-0989-z","article-title":"A survey on zero knowledge range proofs and applications","volume":"1","author":"Morais","year":"2019","journal-title":"SN Appl. Sci."}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/10\/2\/27\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T15:18:09Z","timestamp":1776698289000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/10\/2\/27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,20]]},"references-count":77,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,4]]}},"alternative-id":["cryptography10020027"],"URL":"https:\/\/doi.org\/10.3390\/cryptography10020027","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,20]]}}}