An almost-constant round interactive zero-knowledge proof

DOI10.1016/0020-0190(92)90094-CzbMath0753.68038OpenAlexW1999954816MaRDI QIDQ1198029

M. V. D. Burmester

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90094-c

zbMATH Keywords

zero-knowledge proofsArthur-Merlin black-box IZKP

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Data encryption (aspects in computer science) (68P25) Information theory (general) (94A15)

Related Items

Round-optimal perfect zero-knowledge proofs

Cites Work

• Minimum disclosure proofs of knowledge
• Zero-knowledge proofs of identity
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• The Knowledge Complexity of Interactive Proof Systems
• Computational Complexity of Probabilistic Turing Machines
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An almost-constant round interactive zero-knowledge proof