Round-optimal perfect zero-knowledge proofs

DOI10.1016/0020-0190(94)90015-9zbMath0803.68031OpenAlexW2167553233MaRDI QIDQ1322120

Giuseppe Persiano, Giovanni Di Crescenzo

Publication date: 5 May 1994

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90015-9

zbMATH Keywords

zero-knowledge proofscommunication complexitycomputer security

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data encryption (aspects in computer science) (68P25)

Related Items (3)

Practical proofs of knowledge without relying on theoretical proofs of membership on languages ⋮ On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes ⋮ Which languages have 4-round zero-knowledge proofs?

Cites Work

• Unnamed Item
• Constant-round perfect zero-knowledge computationally convincing protocols
• Practic zero-knowledge proofs: Giving hints and using deficiencies
• An almost-constant round interactive zero-knowledge proof
• Noninteractive Zero-Knowledge
• The knowledge complexity of interactive proof-systems
• The Lattice Point Covering Theorem for Rectangles

This page was built for publication: Round-optimal perfect zero-knowledge proofs