A non-PCP approach to succinct quantum-safe zero-knowledge
From MaRDI portal
Publication:2096535
Recommendations
Cites work
- A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Asymptotically Efficient Lattice-Based Digital Signatures
- Aurora: transparent succinct arguments for R1CS
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Computational integrity with a public random string from quasi-linear PCPs
- Efficient identity-based encryption over NTRU lattices
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Efficient zero-knowledge arguments from two-tiered homomorphic commitments
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- Lattice signatures without trapdoors
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Lattice-based zero-knowledge SNARGs for arithmetic circuits
- New bounds in some transference theorems in the geometry of numbers
- On ideal lattices and learning with errors over rings
- On the size of pairing-based non-interactive arguments
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Practical product proofs for lattice commitments
- Predicting Lattice Reduction
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Revisiting post-quantum Fiat-Shamir
- Scalable zero knowledge with no trusted setup
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- The algebraic group model and its applications
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Trapdoors for hard lattices and new cryptographic constructions
- Updatable and universal common reference strings with applications to zk-SNARKs
Cited in
(42)- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- DualRing: generic construction of ring signatures with efficient instantiations
- Sumcheck arguments and their applications
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- A compressed \(\varSigma \)-protocol theory for lattices
- Asymptotically quasi-optimal cryptography
- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
- Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\)
- Compact privacy protocols from post-quantum and timed classical assumptions
- Algorithms and Computation
- Practical sublinear proofs for R1CS from lattices
- Efficient NIZKs and signatures from commit-and-open protocols in the QROM
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- Lattice-based inner product argument
- Lower bound on SNARGs in the random oracle model
- Orion: zero knowledge proof with linear prover time
- Quantum rewinding for many-round protocols
- Fiat-Shamir transformation of multi-round interactive proofs
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- LaBRADOR: compact proofs for R1CS from Module-SIS
- Lattice-based timed cryptography
- Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
- Commitments with efficient zero-knowledge arguments from subset sum problems
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
- Greyhound: fast polynomial commitments from lattices
- Field-agnostic SNARKs from expand-accumulate codes
- Concretely efficient lattice-based polynomial commitment from standard assumptions
- \textsf{LatticeFold+}: faster, simpler, shorter lattice-based folding for succinct proof systems
- Straight-line knowledge extraction for multi-round protocols
- Lattice-based zero-knowledge proofs for blockchain confidential transactions
- RoK, paper, SISsors toolkit for lattice-based succinct arguments (extended abstract)
- Lova: lattice-based folding scheme from unstructured lattices
- RoK and Roll -- verifier-efficient random projection for \(\tilde{O}(\lambda )\)-size lattice arguments (extended abstract)
- Inner-product commitments over integers with applications to succinct arguments
- Quantum rewinding for IOP-based succinct arguments
This page was built for publication: A non-PCP approach to succinct quantum-safe zero-knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096535)
