Constant-round perfect zero-knowledge computationally convincing protocols

DOI10.1016/0304-3975(91)90259-5MaRDI QIDQ808240zbMATH OpenOpenAlexFDO

Authors Gilles Brassard, Claude Crépeau, Moti 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

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

Recommendations

• scientific article; zbMATH DE number 176509
• scientific article; zbMATH DE number 4053065
• How to construct constant-round zero-knowledge proof systems for NP
• scientific article; zbMATH DE number 4191106
• Perfect zero-knowledge arguments for NP using any one-way permutation

Cites work

• A discrete logarithm implementation of perfect zero-knowledge blobs
• A Mathematical Theory of Communication
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• scientific article; zbMATH DE number 4191106 (Why is no real title available?)
• scientific article; zbMATH DE number 3957197 (Why is no real title available?)
• 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 4041785 (Why is no real title available?)
• scientific article; zbMATH DE number 4057443 (Why is no real title available?)
• scientific article; zbMATH DE number 4101088 (Why is no real title available?)
• scientific article; zbMATH DE number 16481 (Why is no real title available?)
• scientific article; zbMATH DE number 176509 (Why is no real title available?)
• scientific article; zbMATH DE number 177820 (Why is no real title available?)
• Minimum disclosure proofs of knowledge
• The Knowledge Complexity of Interactive Proof Systems
• Zero-knowledge proofs of identity
• Zero-Knowledge Simulation of Boolean Circuits

Cited in

(14)

• Perfect zero-knowledge arguments for NP using any one-way permutation
• 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
• Promise zero knowledge and its applications to round optimal MPC
• A black-box approach to post-quantum zero-knowledge in constant rounds
• Existence of 3-round zero-knowledge proof systems for NP
• scientific article; zbMATH DE number 176509 (Why is no real title available?)
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
• On Constant-Round Concurrent Zero-Knowledge
• On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes
• The black-box simulation barrier persists in a fully quantum world

This page was built for publication: Constant-round perfect zero-knowledge computationally convincing protocols

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