Zero Knowledge in the Random Oracle Model, Revisited

DOI10.1007/978-3-642-10366-7_25zbMath1267.94102OpenAlexW1495598851MaRDI QIDQ3650706

Hoeteck Wee

Publication date: 15 December 2009

Published in: Advances in Cryptology – ASIACRYPT 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10366-7_25

zbMATH Keywords

random oracle modelzero-knowledgesequential compositionobfuscation

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

Interactive Oracle Proofs ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ Spartan and bulletproofs are simulation-extractable (for free!) ⋮ Selective Opening Security from Simulatable Data Encapsulation ⋮ Let attackers program ideal models: modularity and composability for adaptive compromise ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Predictable Arguments of Knowledge ⋮ Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems ⋮ A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles ⋮ TARDIS: a foundation of time-lock puzzles in UC

This page was built for publication: Zero Knowledge in the Random Oracle Model, Revisited