Succinct arguments in the quantum random oracle model
From MaRDI portal
Publication:2175929
DOI10.1007/978-3-030-36033-7_1zbMath1455.94140OpenAlexW2991016858MaRDI QIDQ2175929
Nicholas Spooner, Alessandro Chiesa, Peter Manohar
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36033-7_1
Related Items (21)
On tight quantum security of HMAC and NMAC in the quantum random oracle model ⋮ Subquadratic SNARGs in the random oracle model ⋮ Sumcheck arguments and their applications ⋮ Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy ⋮ A Note on the Instantiability of the Quantum Random Oracle ⋮ A PCP theorem for interactive proofs and applications ⋮ QCCA-secure generic transformations in the quantum random oracle model ⋮ Efficient NIZKs and signatures from commit-and-open protocols in the QROM ⋮ NIZK from SNARGs ⋮ Fiat-Shamir transformation of multi-round interactive proofs (Extended version) ⋮ Fiat-Shamir transformation of multi-round interactive proofs ⋮ Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II ⋮ Lattice-based succinct arguments from vanishing polynomials (extended abstract) ⋮ Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head ⋮ Lattice-based timed cryptography ⋮ Post-quantum resettably-sound zero knowledge ⋮ Tight security bounds for Micali's SNARGs ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ \textsc{Fractal}: post-quantum and transparent recursive proofs from holography ⋮ On the compressed-oracle technique, and post-quantum security of proofs of sequential work ⋮ Keyed-fully homomorphic encryption without indistinguishability obfuscation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of interactive proofs with bounded communication
- Minimum disclosure proofs of knowledge
- On interactive proofs with a laconic prover
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
- Leighton-Micali hash-based signatures in the quantum random-oracle model
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- How to record quantum queries, and applications to quantum indifferentiability
- 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
- Security Proofs for Signature Schemes
- Secure Identity-Based Encryption in the Quantum Random Oracle Model
- Zero-knowledge against quantum attacks
- Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
- Random Oracles in a Quantum World
- Proof verification and the hardness of approximation problems
- Delegating Computation
- Interactive Oracle Proofs
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- Quantum lower bounds for the collision and the element distinctness problems
- Interactive PCP
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Probabilistic checking of proofs
- Rapid solution of problems by quantum computation
- Algebraic methods for interactive proof systems
- Interactive proofs and the hardness of approximating cliques
- Computationally Sound Proofs
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
- Fiat-Shamir: from practice to theory
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
- Constant-round interactive proofs for delegating computation
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Quantum cryptanalysis of hash and claw-free functions
This page was built for publication: Succinct arguments in the quantum random oracle model
