Constant-round perfect zero-knowledge computationally convincing protocols

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

Claude Crépeau, Gilles Brassard, 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 convincingone-way certified group actionsperfect zero-knowledge protocol

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Data encryption (aspects in computer science) (68P25)

Related Items

A black-box approach to post-quantum zero-knowledge in constant rounds, The knowledge complexity of quadratic residuosity languages, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, 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, Existence of 3-round zero-knowledge proof systems for NP, A uniform-complexity treatment of encryption and zero-knowledge, Round-optimal perfect zero-knowledge proofs

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