Practical sublinear proofs for R1CS from lattices

DOI10.1007/978-3-031-15979-4_5MaRDI QIDQ6104331zbMATH OpenFDO

Authors Ngoc Khanh Nguyen, Gregor Seiler

Publication date 28 June 2023

Published in Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)

zbMATH Keywords

Schwartz-Zippel lemmasublinear-size zero-knowledge proof system

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Aurora: transparent succinct arguments for R1CS
• Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
• Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
• Linear Algebra with Sub-linear Zero-Knowledge Arguments
• Linear-time zero-knowledge proofs for arithmetic circuit satisfiability

Cites work

• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• A compressed \(\varSigma \)-protocol theory for lattices
• A non-PCP approach to succinct quantum-safe zero-knowledge
• Algebraic methods for interactive proof systems
• Aurora: transparent succinct arguments for R1CS
• Efficient zero-knowledge arguments from two-tiered homomorphic commitments
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Generalized Compact Knapsacks Are Collision Resistant
• IP = PSPACE
• Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
• More efficient commitments from structured lattice assumptions
• On ideal lattices and learning with errors over rings
• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
• Practical product proofs for lattice commitments
• Quadratic span programs and succinct NIZKs without PCPs
• SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
• Short lattice-based one-out-of-many proofs and applications to ring signatures
• Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
• Shorter lattice-based zero-knowledge proofs via one-time commitments
• Snarks for C: verifying program executions succinctly and in zero knowledge
• Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
• Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
• Theory of Cryptography
• Worst-case to average-case reductions for module lattices
• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions

Cited in

(9)

• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
• Distilling Constraints in Zero-Knowledge Protocols
• Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments
• Lattice-based succinct arguments for NP with polylogarithmic-time verification
• Aurora: transparent succinct arguments for R1CS
• Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
• SLAP: succinct lattice-based polynomial commitments from standard assumptions
• Concretely efficient lattice-based polynomial commitment from standard assumptions
• LaBRADOR: compact proofs for R1CS from Module-SIS

This page was built for publication: Practical sublinear proofs for R1CS from lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6104331)