Concurrent zero-knowledge: Reducing the need for timing constraints

DOI10.1007/BFB0055746MaRDI QIDQ4249349zbMATH OpenFDO

Authors Cynthia Dwork, Amit Sahai

Publication date 7 March 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0055746

zbMATH Keywords

concurrent zero-knowledgeinteractive proof systempreprocessing protocoltrusted center

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1775426
• Concurrent zero-knowledge
• On concurrent zero-knowledge with pre-processing. (Extended abstract)
• On the concurrent composition of zero-knowledge proofs

Cited in

(16)

• Hybrid commitments and their applications to zero-knowledge proof systems
• Adaptively secure distributed public-key systems.
• On the concurrent composition of quantum zero-knowledge
• Random walks and concurrent zero-knowledge
• Concurrent zero knowledge, revisited
• A new framework for deniable secure key exchange
• Concurrent knowledge extraction in public-key models
• Efficient concurrent zero-knowledge in the auxiliary string model
• Eye for an eye: efficient concurrent zero-knowledge in the timing model
• scientific article; zbMATH DE number 1775426 (Why is no real title available?)
• Spatial Isolation Implies Zero Knowledge Even in a Quantum World
• Concurrent zero-knowledge
• Theory of Cryptography
• A new approach to efficient non-malleable zero-knowledge
• Lower bounds for concurrent zero knowledge
• A note on the Dwork-Naor timed deniable authentication

This page was built for publication: Concurrent zero-knowledge: Reducing the need for timing constraints

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