Constant-round perfect zero-knowledge computationally convincing protocols

DOI10.1016/0304-3975(91)90259-5zbMath0731.68032MaRDI QIDQ808240

Gilles Brassard, Claude Crépeau, Mordechai M. Yung

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90259-5

zbMATH Keywords

computationally convincing; one-way certified group actions; perfect zero-knowledge protocol

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68M10: Network design and communication in computer systems

68P25: Data encryption (aspects in computer science)

Related Items

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, A uniform-complexity treatment of encryption and zero-knowledge, Round-optimal perfect zero-knowledge proofs, The knowledge complexity of quadratic residuosity languages, Practical proofs of knowledge without relying on theoretical proofs of membership on languages, Existence of 3-round zero-knowledge proof systems for NP

Cites Work

• A Mathematical Theory of Communication
• A discrete logarithm implementation of perfect zero-knowledge blobs
• Minimum disclosure proofs of knowledge
• Zero-knowledge proofs of identity
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Zero-Knowledge Simulation of Boolean Circuits
• The Knowledge Complexity of Interactive Proof Systems
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item