Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model

DOI10.1007/978-3-642-11799-2_31zbMath1274.94103OpenAlexW1884286281MaRDI QIDQ3408213

Muthuramakrishnan Venkitasubramaniam, Wei-Lung Dustin Tseng, Rafael Pass

Publication date: 24 February 2010

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_31

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Random walks and concurrent zero-knowledge

Cites Work

• How to construct constant-round zero-knowledge proof systems for NP
• Local zero knowledge
• Concurrent zero-knowledge with timing, revisited
• Concurrent general composition of secure protocols in the timing model
• The Knowledge Complexity of Interactive Proof Systems
• Foundations of Cryptography
• A unified framework for concurrent security
• Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
• Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
• Concurrent zero-knowledge
• On Constant-Round Concurrent Zero-Knowledge
• Automata, Languages and Programming
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model