The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
From MaRDI portal
Publication:2104233
DOI10.1007/978-3-030-56877-1_21zbMath1504.94134arXiv2003.05207MaRDI QIDQ2104233
Jelle Don, Serge Fehr, Christian Majenz
Publication date: 7 December 2022
Full work available at URL: https://arxiv.org/abs/2003.05207
94A60: Cryptography
Related Items
Spartan and bulletproofs are simulation-extractable (for free!), Classical and quantum security of elliptic curve VRF, via relative indifferentiability, A generic transform from multi-round interactive proof to NIZK, A thorough treatment of highly-efficient NTRU instantiations, Efficient NIZKs and signatures from commit-and-open protocols in the QROM, A note on the post-quantum security of (ring) signatures, Classically verifiable NIZK for QMA with preprocessing, Redeeming reset indifferentiability and applications to post-quantum security, Tight adaptive reprogramming in the QROM, Constructive post-quantum reductions, Classical vs quantum random oracles, Banquet: short and fast signatures from AES, A non-PCP approach to succinct quantum-safe zero-knowledge, Improved lattice-based mix-nets for electronic voting, A compressed \(\varSigma \)-protocol theory for lattices, A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs, Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model), Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle, Post-quantum resettably-sound zero knowledge
Cites Work
- Unnamed Item
- A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
- SOFIA: \(\mathcal{MQ}\)-based signatures in the QROM
- Signatures from sequential-OR proofs
- Revisiting post-quantum Fiat-Shamir
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Post-quantum security of Fiat-Shamir
- The Fiat–Shamir Transformation in a Quantum World
- Quantum Proofs of Knowledge
- Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
- From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures
- Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials
- Information Security and Privacy
- Computationally Binding Quantum Commitments
