Zero knowledge in the random oracle model, revisited
From MaRDI portal
Publication:3650706
Recommendations
Cited in
(18)- TARDIS: a foundation of time-lock puzzles in UC
- Naor-Yung paradigm with shared randomness and applications
- scientific article; zbMATH DE number 1583797 (Why is no real title available?)
- scientific article; zbMATH DE number 1676657 (Why is no real title available?)
- 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
- Selective opening security from simulatable data encapsulation
- Interactive oracle proofs
- Combining Encryption and Proof of Knowledge in the Random Oracle Model
- Predictable arguments of knowledge
- Theory of Cryptography
- Spartan and bulletproofs are simulation-extractable (for free!)
- Let attackers program ideal models: modularity and composability for adaptive compromise
- A new approach to efficient non-malleable zero-knowledge
- Universally composable SNARKs with transparent setup without programmable random oracle
- SNARKs for virtual machines are non-malleable
- A Fiat-Shamir transformation from duplex sponges
- The random oracle model: a twenty-year retrospective
This page was built for publication: Zero knowledge in the random oracle model, revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3650706)