Zero-Knowledge Simulation of Boolean Circuits

DOI10.1007/3-540-47721-7_16zbMath0637.94017OpenAlexW1498590645MaRDI QIDQ3778677

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

protocolrandomnessnon-determinismNPzero-knowledge interactive proof

Mathematics Subject Classification ID

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

Related Items

Minimum disclosure proofs of knowledge, Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem, Cryptographic protocols and voting, Secure circuit evaluation. A protocol based on hiding information from an oracle, A uniform-complexity treatment of encryption and zero-knowledge, On the communication complexity of zero-knowledge proofs, Constant-round perfect zero-knowledge computationally convincing protocols