Welcome to the resource topic for 2022/1048
Title:
Practical Sublinear Proofs for R1CS from Lattices
Authors: Ngoc Khanh Nguyen, Gregor Seiler
Abstract:We propose a practical sublinear-size zero-knowledge proof system for Rank-1 Constraint Satisfaction (R1CS) based on lattices. The proof size scales asymptotically with the square root of the witness size. Concretely, the size becomes 2-3 times smaller than Ligero (ACM CCS 2017), which also exhibits square root scaling, for large instances of R1CS. At the core lies an interactive variant of the Schwartz-Zippel Lemma that might be of independent interest.
ePrint: https://eprint.iacr.org/2022/1048
Talk: https://www.youtube.com/watch?v=3A8Y63DeQ50
Slides: https://iacr.org/submit/files/slides/2022/crypto/crypto2022/395/slides.pdf
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .