A non-PCP approach to succinct quantum-safe zero-knowledge

DOI10.1007/978-3-030-56880-1_16MaRDI QIDQ2096535zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

latticeszero-knowledge proofsSNARKS

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
• Lattice-based zero-knowledge SNARGs for arithmetic circuits
• Succinct arguments in the quantum random oracle model
• A compressed \(\varSigma \)-protocol theory for lattices
• Advances in Cryptology – CRYPTO 2004

Cites work

• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• 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
• Lattice signatures without trapdoors
• Lattice-based zero-knowledge SNARGs for arithmetic circuits
• Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
• 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

(34)

• Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\)
• 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
• 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
• Sumcheck arguments and their applications
• Practical sublinear proofs for R1CS from lattices
• Orion: zero knowledge proof with linear prover time
• \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
• DualRing: generic construction of ring signatures with efficient instantiations
• LaBRADOR: compact proofs for R1CS from Module-SIS
• Lattice-based timed cryptography
• Asymptotically quasi-optimal cryptography
• Compact privacy protocols from post-quantum and timed classical assumptions
• Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• SLAP: succinct lattice-based polynomial commitments from standard assumptions
• 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

Describes a project that uses

Uses Software

• Ligero
• SPHINCS

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)