Practical sublinear proofs for R1CS from lattices

DOI10.1007/978-3-031-15979-4_5zbMATH Open1514.94121MaRDI QIDQ6104331FDOQ6104331

Authors: Ngoc Khanh Nguyen, Gregor Seiler 

Publication date: 28 June 2023

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

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

zbMATH Keywords

Schwartz-Zippel lemmasublinear-size zero-knowledge proof system

Mathematics Subject Classification ID

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

Cites Work

• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
• On ideal lattices and learning with errors over rings
• Title not available (Why is that?)
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• A non-PCP approach to succinct quantum-safe zero-knowledge
• Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments
• Worst-case to average-case reductions for module lattices
• Generalized Compact Knapsacks Are Collision Resistant
• Theory of Cryptography
• Algebraic methods for interactive proof systems
• IP = PSPACE
• Quadratic Span Programs and Succinct NIZKs without PCPs
• More efficient commitments from structured lattice assumptions
• Practical product proofs for lattice commitments
• 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
• Short lattice-based one-out-of-many proofs and applications to ring signatures
• Shorter lattice-based zero-knowledge proofs via one-time commitments
• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
• SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
• Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
• A compressed \(\varSigma \)-protocol theory for lattices
• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
• Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations

Cited In (8)

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

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)