Non-interactive zero-knowledge proofs in the quantum random oracle model
From MaRDI portal
Recommendations
- Quantum proofs of knowledge
- Non-interactive zero knowledge \textit{proofs} in the random oracle model
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- Succinct arguments in the quantum random oracle model
Cited in
(75)- Hidden shift quantum cryptanalysis and implications
- Public key compression for constrained linear signature schemes
- Oracle separations between quantum and non-interactive zero-knowledge classes
- Traceable ring signatures: general framework and post-quantum security
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
- Threshold ring signatures: new definitions and post-quantum security
- Revocable hierarchical attribute-based signatures from lattices
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Improved lattice-based mix-nets for electronic voting
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Online-extractability in the quantum random-oracle model
- Succinct arguments in the quantum random oracle model
- PKP-based signature scheme
- New techniques for SIDH-based NIKE
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
- Supersingular twisted Edwards curves over prime fields. II: Supersingular twisted Edwards curves with the j-invariant equal to 66³
- Interactive physical zero-knowledge proof for Norinori
- Survey of information security
- Post-quantum resettably-sound zero knowledge
- Breaking symmetric cryptosystems using quantum period finding
- Quantum proofs of knowledge
- Computational Security of Quantum Encryption
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model
- scientific article; zbMATH DE number 5568627 (Why is no real title available?)
- Zero knowledge in the random oracle model, revisited
- scientific article; zbMATH DE number 1942416 (Why is no real title available?)
- A Note on the Instantiability of the Quantum Random Oracle
- LESS is more: code-based signatures without syndromes
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World
- Algorithms and Computation
- A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies
- Identification protocols and signature schemes based on supersingular isogeny problems
- Tighter security proofs for GPV-IBE in the quantum random oracle model
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems
- Witness-succinct universally-composable SNARKs
- Proving knowledge of isogenies: a survey
- A lower bound on the length of signatures based on group actions and generic isogenies
- A generic transform from multi-round interactive proof to NIZK
- Efficient NIZKs and signatures from commit-and-open protocols in the QROM
- Code-Based Signature Schemes from Identification Protocols in the Rank Metric
- Lattice-based signatures with tight adaptive corruptions and more
- Improved straight-line extraction in the random oracle model with applications to signature aggregation
- Classically verifiable NIZK for QMA with preprocessing
- On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model
- Redeeming reset indifferentiability and applications to post-quantum security
- Tight adaptive reprogramming in the QROM
- Lattice-Based Proof of a Shuffle
- Universally composable -protocols in the global random-oracle model
- A new framework for quantum oblivious transfer
- Secure Stern Signatures in Quantum Random Oracle Model
- Oblivious transfer from zero-knowledge proofs. Or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states
- Towards compressed permutation oracles
- A post-quantum round-optimal oblivious PRF from isogenies
- Fully dynamic attribute-based signatures for circuits from codes
- Sometimes you can't distribute random-oracle-based proofs
- Lattice-based logarithmic-size forward-secure ring signatures in QROM
- Adaptive UC NIZK for practical applications
- Straight-line knowledge extraction for multi-round protocols
- Code-based zero-knowledge from VOLE-in-the-head and their applications: simpler, faster, and smaller
- Generalized hybrid search with applications to blockchains and hash function security
- Enhancing threshold group action signature schemes: adaptive security and scalability improvements
- Security analysis of ZKPoK based on MQ problem in the multi-instance setting
- Nonadaptive one-way to hiding implies adaptive quantum reprogramming
- Capybara and Tsubaki: verifiable random functions from group actions and isogenies
- On quantum simulation-soundness
- Scalable two-round n-out-of-n and multi-signatures from lattices in the quantum random oracle model
- Non-adaptive one-way to hiding not only implies adaptive quantum reprogramming, but also does better
- Quantum cryptography beyond quantum key distribution
This page was built for publication: Non-interactive zero-knowledge proofs in the quantum random oracle model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948402)
