A note on constant-round zero-knowledge proofs of knowledge

DOI10.1007/s00145-012-9132-7zbMath1283.94074MaRDI QIDQ380963

Yehuda Lindell

Publication date: 15 November 2013

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-012-9132-7

Mathematics Subject Classification ID

94A60: Cryptography

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

Related Items

How to Simulate It – A Tutorial on the Simulation Proof Technique, Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round, Doubly adaptive zero-knowledge proofs, Concurrent knowledge extraction in public-key models, Constant-round adaptive zero-knowledge proofs for NP, On expected polynomial runtime in cryptography, Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits, On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits, Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Which languages have 4-round zero-knowledge proofs?
• Bit commitment using pseudorandomness
• Parallel coin-tossing and constant-round secure two-party computation
• How to construct constant-round zero-knowledge proof systems for NP
• Security and composition of multiparty cryptographic protocols
• Quantum Communication Attacks on Classical Cryptographic Protocols
• The Knowledge Complexity of Interactive Proof Systems
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• Foundations of Cryptography
• On the Composition of Zero-Knowledge Proof Systems
• Advances in Cryptology – CRYPTO 2004
• Theory of Cryptography