On the amortized complexity of zero-knowledge protocols

DOI10.1007/s00145-013-9145-xzbMath1297.94063OpenAlexW2075960627MaRDI QIDQ744603

Marcel Keller, Ronald Cramer, Ivan B. Damgård

Publication date: 25 September 2014

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-013-9145-x

zbMATH Keywords

proof of knowledgehomomorphic encryptionzero-knowledge\(\varSigma\)-protocolsrandom self-reducible problems

Mathematics Subject Classification ID

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

Related Items

Zero-knowledge arguments for subverted RSA groups, Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack, Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes

Cites Work

• Unnamed Item
• Efficient signature generation by smart cards
• Semi-homomorphic Encryption and Multiparty Computation
• On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge
• Zero-Knowledge Proofs from Secure Multiparty Computation
• Efficient and Secure Comparison for On-Line Auctions
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• The knowledge complexity of interactive proof-systems
• Theory of Cryptography