Theory of Cryptography

DOI10.1007/11681878zbMATH Open1112.94022OpenAlexW3149533473MaRDI QIDQ5898640FDOQ5898640

Authors: Moti Yung, Yunlei Zhao 

Publication date: 12 February 2007

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

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

Recommendations

• Non-interactive zero knowledge \textit{proofs} in the random oracle model
• Zero knowledge in the random oracle model, revisited
• On Constant-Round Concurrent Zero-Knowledge
• Automata, Languages and Programming
• Resettable zero-knowledge (extended abstract)

Mathematics Subject Classification ID

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

Cited In (5)

• Concurrent knowledge extraction in public-key models
• A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
• DSH: Deniable Secret Handshake Framework
• Advances in Cryptology - CRYPTO 2003
• Zero knowledge in the random oracle model, revisited

This page was built for publication: Theory of Cryptography

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