On the communication complexity of zero-knowledge proofs

DOI10.1007/BF02620135zbMath0782.68064OpenAlexW2022025391WikidataQ62472241 ScholiaQ62472241MaRDI QIDQ1261016

René Peralta, Carstent Lund, Joan. Boyar

Publication date: 29 August 1993

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

Full work available at URL: https://doi.org/10.1007/bf02620135

zbMATH Keywords

cryptographic protocolszero-knowledge proofs of knowledge

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (1)

Tight bounds for the multiplicative complexity of symmetric functions

Cites Work

• A discrete logarithm implementation of perfect zero-knowledge blobs
• Probabilistic encryption
• Short propositional formulas represent nondeterministic computations
• Minimum disclosure proofs of knowledge
• Zero-knowledge proofs of identity
• Some simplified NP-complete graph problems
• Zero-Knowledge Simulation of Boolean Circuits
• The Knowledge Complexity of Interactive Proof Systems
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Subquadratic zero-knowledge
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the communication complexity of zero-knowledge proofs