A non-PCP approach to succinct quantum-safe zero-knowledge
From MaRDI portal
Publication:2096535
DOI10.1007/978-3-030-56880-1_16zbMATH Open1501.94031OpenAlexW3037467273MaRDI QIDQ2096535FDOQ2096535
Authors: Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler 
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_16
Recommendations
Cites Work
- On ideal lattices and learning with errors over rings
- Trapdoors for hard lattices and new cryptographic constructions
- Title not available (Why is that?)
- Lattice signatures without trapdoors
- Predicting Lattice Reduction
- New bounds in some transference theorems in the geometry of numbers
- Efficient zero-knowledge arguments from two-tiered homomorphic commitments
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Asymptotically Efficient Lattice-Based Digital Signatures
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Efficient identity-based encryption over NTRU lattices
- Updatable and universal common reference strings with applications to zk-SNARKs
- The algebraic group model and its applications
- Practical product proofs for lattice commitments
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- On the size of pairing-based non-interactive arguments
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Revisiting post-quantum Fiat-Shamir
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Computational integrity with a public random string from quasi-linear PCPs
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Lattice-based zero-knowledge SNARGs for arithmetic circuits
Cited In (34)
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- Efficient NIZKs and signatures from commit-and-open protocols in the QROM
- Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\)
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Algorithms and Computation
- Fiat-Shamir transformation of multi-round interactive proofs
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments
- Lattice-based inner product argument
- A compressed \(\varSigma \)-protocol theory for lattices
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Quantum rewinding for many-round protocols
- Practical sublinear proofs for R1CS from lattices
- Orion: zero knowledge proof with linear prover time
- Sumcheck arguments and their applications
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
- LaBRADOR: compact proofs for R1CS from Module-SIS
- Lattice-based timed cryptography
- DualRing: generic construction of ring signatures with efficient instantiations
- Compact privacy protocols from post-quantum and timed classical assumptions
- Asymptotically quasi-optimal cryptography
- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Concretely efficient lattice-based polynomial commitment from standard assumptions
- Field-agnostic SNARKs from expand-accumulate codes
- Greyhound: fast polynomial commitments from lattices
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- Lower bound on SNARGs in the random oracle model
- Commitments with efficient zero-knowledge arguments from subset sum problems
Uses Software
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)
