Interactive hashing can simplify zero-knowledge protocol design without computational assumptions. (Extended abstract)

DOI10.1007/3-540-48329-2_9MaRDI QIDQ4341736zbMATH OpenFDO

Authors Ivan B. Damgård

Publication date 20 July 1997

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

Full work available at URL https://doi.org/10.1007/3-540-48329-2_9

Mathematics Subject Classification ID

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

Cited in

(6)

• On relationships between statistical zero-knowledge proofs
• High entropy random selection protocols
• Rationality in the Full-Information Model
• How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
• An Equivalence Between Zero Knowledge and Commitments
• Adaptive zero-knowledge proofs and adaptively secure oblivious transfer

This page was built for publication: Interactive hashing can simplify zero-knowledge protocol design without computational assumptions. (Extended abstract)

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