Adaptive proofs of knowledge in the random oracle model
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2079934
- Adaptive proofs have straightline extractors (in the random oracle model)
- Combining Encryption and Proof of Knowledge in the Random Oracle Model
- On the Non-malleability of the Fiat-Shamir Transform
- On the hardness of proving CCA-security of Signed ElGamal
Cited in
(15)- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Naor-Yung paradigm with shared randomness and applications
- Practical dynamic group signatures without knowledge extractors
- Generalized proofs of knowledge with fully dynamic setup
- Naor-Yung Paradigm with Shared Randomness and Applications
- scientific article; zbMATH DE number 2079934 (Why is no real title available?)
- Combining Encryption and Proof of Knowledge in the Random Oracle Model
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Proof-carrying data from arithmetized random oracles
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- Adaptive proofs have straightline extractors (in the random oracle model)
- Practical round-optimal blind signatures in the ROM from standard assumptions
- Fully dynamic group signatures from subset difference methods under simple assumptions
- Adaptively-secure three-round threshold Schnorr from DL
This page was built for publication: Adaptive proofs of knowledge in the random oracle model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941213)
