On the communication complexity of zero-knowledge proofs

DOI10.1007/BF02620135MaRDI QIDQ1261016zbMATH OpenOpenAlexDBLPWikidataFDO

Authors René Peralta, Joan Boyar, C. Lund

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

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

Recommendations

• scientific article; zbMATH DE number 4191124
• Subquadratic zero-knowledge
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• scientific article; zbMATH DE number 1559559
• scientific article; zbMATH DE number 177820

Cites work

• scientific article; zbMATH DE number 4037760 (Why is no real title available?)
• scientific article; zbMATH DE number 4039794 (Why is no real title available?)
• scientific article; zbMATH DE number 4101088 (Why is no real title available?)
• A discrete logarithm implementation of perfect zero-knowledge blobs
• Minimum disclosure proofs of knowledge
• Probabilistic encryption
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Short propositional formulas represent nondeterministic computations
• Some simplified NP-complete graph problems
• Subquadratic zero-knowledge
• The Knowledge Complexity of Interactive Proof Systems
• The complexity of theorem-proving procedures
• Zero-Knowledge Simulation of Boolean Circuits
• Zero-knowledge proofs of identity

Cited in

(16)

• scientific article; zbMATH DE number 708807 (Why is no real title available?)
• scientific article; zbMATH DE number 4191106 (Why is no real title available?)
• scientific article; zbMATH DE number 4037759 (Why is no real title available?)
• Subquadratic zero-knowledge
• scientific article; zbMATH DE number 4191124 (Why is no real title available?)
• Tight bounds for the multiplicative complexity of symmetric functions
• scientific article; zbMATH DE number 31277 (Why is no real title available?)
• On the complexity of interactive proofs with bounded communication
• The Complexity of Zero Knowledge
• Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
• A uniform-complexity treatment of encryption and zero-knowledge
• Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions
• Zero-information protocols and unambiguity in Arthur-Merlin communication
• Efficient generic zero-knowledge proofs from commitments (extended abstract)
• Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
• scientific article; zbMATH DE number 1559559 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1261016)