A non-PCP approach to succinct quantum-safe zero-knowledge
From MaRDI portal
Publication:2096535
DOI10.1007/978-3-030-56880-1_16zbMath1501.94031OpenAlexW3037467273MaRDI QIDQ2096535
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
Related Items (21)
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 ⋮ Practical sublinear proofs for R1CS from lattices ⋮ 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 ⋮ Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
Uses Software
Cites Work
- Unnamed Item
- Updatable and universal common reference strings with applications to zk-SNARKs
- New bounds in some transference theorems in the geometry of numbers
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
- The algebraic group model and its applications
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Practical product proofs for lattice commitments
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Lattice-based zero-knowledge SNARGs for arithmetic circuits
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Revisiting post-quantum Fiat-Shamir
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Lattice Signatures without Trapdoors
- Efficient Identity-Based Encryption over NTRU Lattices
- Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
- Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Computational Integrity with a Public Random String from Quasi-Linear PCPs
- Asymptotically Efficient Lattice-Based Digital Signatures
- Predicting Lattice Reduction
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
This page was built for publication: A non-PCP approach to succinct quantum-safe zero-knowledge
