On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations

DOI10.1007/978-3-642-32284-6_4zbMath1295.94043OpenAlexW2120033653MaRDI QIDQ5200455

Valerio Pastro, Ronald Cramer, Ivan B. Damgård

Publication date: 6 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://eprint.iacr.org/2011/301

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (6)

Compact Lossy and All-but-One Trapdoor Functions from Lattice ⋮ Secret Sharing Schemes with Algebraic Properties and Applications ⋮ Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures ⋮ Efficient Leakage Resilient Circuit Compilers ⋮ Better Preprocessing for Secure Multiparty Computation ⋮ Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics

This page was built for publication: On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations