Zero-Knowledge Simulation of Boolean Circuits

DOI10.1007/3-540-47721-7_16MaRDI QIDQ3778677zbMATH OpenOpenAlexFDO

Authors Gilles Brassard, Claude Crépeau

Publication date 1987

Published in Advances in Cryptology — CRYPTO’ 86 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-47721-7_16

zbMATH Keywords

randomnessnon-determinismprotocolNPzero-knowledge interactive proof

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Noninteractive Zero-Knowledge
• On relationships between statistical zero-knowledge proofs
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• scientific article; zbMATH DE number 4053065
• scientific article; zbMATH DE number 94166

Cited in

(14)

• Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
• scientific article; zbMATH DE number 4037759 (Why is no real title available?)
• Reduction zero-knowledge
• Oblivious transfer from weakly random self-reducible public-key cryptosystem
• Minimum disclosure proofs of knowledge
• Signatures of knowledge for Boolean circuits under standard assumptions
• BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
• Cryptographic protocols and voting
• On the communication complexity of zero-knowledge proofs
• A uniform-complexity treatment of encryption and zero-knowledge
• Observation and interaction. Invited paper
• Secure circuit evaluation. A protocol based on hiding information from an oracle
• How to simulate it -- a tutorial on the simulation proof technique
• Constant-round perfect zero-knowledge computationally convincing protocols

This page was built for publication: Zero-Knowledge Simulation of Boolean Circuits

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