The methods of eliminating vulnerabilities of zero-knowledge succinct non-interactive arguments of knowlede are considered. The methods are based on the security of public parameters formation in the form of common reference strings using a trusted third party and multilateral interaction. The multilateral formation of the common reference strings uses the only honest party with a fixed and unlimited set of participants, as well as verification of the reliability of the results. Examples of increasing the level of security of zero-knowledge succinct non-interactive arguments of knowledge based on the correction of proof verification equations and the values of the common reference strings, eliminating redundant elements from the common reference strings and the keys of proof formation are given. The protocols that develop the construction of the common reference strings from static to updatable and universal versions are mentioned.
Download file
Counter downloads: 7
- Title Secure formation of public parameters and elimination of vulnerabilities of zero-knowledge succint non-interactive arguments of knowledge
- Headline Secure formation of public parameters and elimination of vulnerabilities of zero-knowledge succint non-interactive arguments of knowledge
- Publesher
Tomsk State University - Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 61
- Date:
- DOI 10.17223/20710410/61/3
Keywords
succinct non-interactive arguments, public parameters, common reference strings, securityAuthors
References
Мартыненков И. В. Краткие неинтерактивные аргументы с нулевым разглашением на основе наборов полиномов // Прикладная дискретная математика. 2023. №59. С. 34-72.
Рато В., Howell J., Gentry С., and Baykova М. Pinocchio: Nearly practical verifiable computation // Proc. 34th IEEE Svmp. Security and Privacy. Oakland, 2013. P. 238-252.
Ben-Sasson E., Chiesa A., Tromer E., and Virza M. Succinct non-interactive Zero Knowledge for a von Neumann architecture // Proc. 23rd USENIX Security Svmp. San Diego, CA, USA, 2014. P.781-796.
Hopwood D., Bowe S., Hornby T., and Wilcox N. Zcash Protocol Specification. Version 2021.2.16 [NU5], 2021. 213p.
Bowe S., Gabizon A., and Green M.D. A Multi-Party Protocol for Constructing the Public Parameters of the Pinocchio zk-SNARK. Cryptology ePrint Archive. Paper 2017/602. 2017. 25p. https://ia.cr/2017/602.
Groth J. On the size of pairing-based non-interactive arguments // LNCS. 2016. V. 9666. P.305-326.
Bowe S., Gabizon A., and Miers L Scalable Multi-Party Computation for zk-SNARK Parameters in the Random Beacon Model. Cryptology ePrint Archive. Paper 2017/1050. 2017. 24p. https://eprint.iacr.org/2017/1050.
Groth J. and Mailer M. Snarkv Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs. Cryptology ePrint Archive. 2017. 36 p. https: //eprint. iacr.org/2017/540.pdf.
Gabizon A. On the Security of the BCTV Pinocchio zk-SNARK Variant. Cryptology ePrint Archive. Paper 2019/119. 2019. 9p. https://eprint.iacr.org/2019/119.
Parno В. A Note on the Unsoundness of vnTinyRAM's SNARK. Cryptology ePrint Archive. Paper 2015/437. 2015. 4p. https://eprint.iacr.org/2015/437.
Mailer M. A Proof of Security for the Sapling Generation of zk-SNARK Parameters in the Generic Group Model. 2018. 12 p. https://github.com/zcash/saplingsecurity-analysis/blob/master/MaryMallerUpdated.pdf.
Groth J., Kohlweiss M., Mailer M., et al. Updatable and Universal Common Reference Strings with Applications to zk-SNARKs. Cryptology ePrint Archive. Paper 2018/280. 2018. 38 p. https://eprint.iacr.org/2018/280.
Mailer M., Bowe S., Kohlweiss M., and Meiklejohn S. Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings. Cryptology ePrint Archive. Paper 2019/099. 2019. 20p. https://eprint.iacr.org/2019/099.
Ben-Sasson E., Chiesa A., Green M., et al. Secure sampling of public parameters for succinct zero knowledge proofs // IEEE Svmp. SP 2015. San Jose, CA, USA, 2015. P.287-304.
Campanelli M., Gennaro R., Goldfeder S., and Nizzardo L. Zero-knowledge contingent payments revisited: Attacks and payments for services // Proc. ACM SIGSAC Conf. CCS'17. N.Y.: ACM, 2017. P.229-243.
Schnorr C. Efficient identification and signatures for smart cards // LNCS. 1990. V. 435. P.239-252.
Черёмушкин А. В. Криптографические протоколы. Основные свойства и уязвимости. М.: Издателвский центр "Академия", 2009. 272 с.
Groth J. Short pairing-based non-interactive zero-knowledge arguments // LNCS. 2010. V.6477. P.321-340.
Ben-Sasson E., Chiesa A., TromerE., and Virza M. Succinct Non-interactive Zero Knowledge for a von Neumann Architecture. Updated version. 2019. 37 p. https: //eprint. iacr.org/2013/879.pdf.
Baches M., Barbosa M., Fiore D., and ReischukR.M. ADSNARK: Nearly practical and privacy-preserving proofs on authenticated data // Proc. 2015 IEEE Svmp. Security and Privacy. San Jose, CA, USA, 2015. P.271-286.
Fuchsbauer G. Subversion-Zero-Knowledge Snarks. Cryptology ePrint Archive. Paper 2017/587. 2017. 32p. https://eprint.iacr.org/2017/587.
zkSNARK implementation in JavaScript & WASM https://github.com/iden3/snarkjs.
C++ library for zkSNARKs. https://github.com/scipr-lab/libsnark.
Марты,пепков И. В. Способы повышения производителвности кратких неинтерактивных аргументов с нулевым разглашением и анализ достигнутых резулвтатов // Прикладная дискретная математика. 2023. №60. С. 40-58.
Gennaro R., Gentry С., Parno В., and Raykova М. Quadratic span programs and succinct NIZKs without PCPs // LNCS. 2013. V.7881. P.626-645.
Ben-Sasson E., Chiesa A., Genkin D., et al. SNARKs for C: Verifying program executions succinctly and in zero knowledge // LNCS. 2013. V. 8043. P. 90-108.
Danezis G., Fourne A.G., Groth J., and Kohlweiss M. Square span programs with applications to succinct NIZK arguments // LNCS. 2014. V.8873. P.532-550.
Ben-Sasson E., Chiesa A., Tromer E., and Virza M. Scalable zero knowledge via cycles of elliptic curves // LNCS. 2014. V.8617. P.276-294.
Costello C., Fournet C., Flowell J., et al. Geppetto: Versatile verifiable computation // Proc. IEEE Svmp. Slr 15. IEEE Computer Society, USA, 2015. P.253-270.
Secure formation of public parameters and elimination of vulnerabilities of zero-knowledge succint non-interactive arguments of knowledge | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2023. № 61. DOI: 10.17223/20710410/61/3
Download full-text version
Counter downloads: 213