Eye for an eye: efficient concurrent zero-knowledge in the timing model

DOI10.1007/978-3-642-11799-2_31MaRDI QIDQ3408213zbMATH OpenOpenAlexFDO

Authors Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam

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)

Recommendations

• scientific article; zbMATH DE number 1775426
• Optimistic concurrent zero knowledge
• Concurrent zero-knowledge
• Concurrent zero-knowledge: Reducing the need for timing constraints
• On concurrent zero-knowledge with pre-processing. (Extended abstract)

Cites work

• A note on the round-complexity of concurrent zero-knowledge
• A unified framework for concurrent security
• Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
• Concurrent and resettable zero-knowledge in poly-logarithmic rounds
• Concurrent general composition of secure protocols in the timing model
• Concurrent zero-knowledge
• Concurrent zero-knowledge with timing, revisited
• Foundations of Cryptography
• How to construct constant-round zero-knowledge proof systems for NP
• Local zero knowledge
• On Constant-Round Concurrent Zero-Knowledge
• On the concurrent composition of zero-knowledge proofs
• Responsive round complexity and concurrent zero knowledge
• Single-prover concurrent zero knowledge in almost constant rounds
• The Knowledge Complexity of Interactive Proof Systems
• Theory of Cryptography
• Universally composable commitments (extended abstract)

Cited in

(1)

• Random walks and concurrent zero-knowledge

This page was built for publication: Eye for an eye: efficient concurrent zero-knowledge in the timing model

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