Welcome to the resource topic for 2020/518
Title:
Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings
Authors: Muhammed F. Esgin, Ngoc Khanh Nguyen, Gregor Seiler
Abstract:We propose a very fast lattice-based zero-knowledge proof system for exactly proving knowledge of a ternary solution \vec{s} \in \{-1,0,1\}^n to a linear equation A\vec{s}=\vec{u} over \mathbb{Z}_q, which improves upon the protocol by Bootle, Lyubashevsky and Seiler (CRYPTO 2019) by producing proofs that are shorter by a factor of 8. At the core lies a technique that utilizes the module-homomorphic BDLOP commitment scheme (SCN 2018) over the fully splitting cyclotomic ring \mathbb{Z}_q[X]/(X^d + 1) to prove scalar products with the NTT vector of a secret polynomial.
ePrint: https://eprint.iacr.org/2020/518
Talk: https://www.youtube.com/watch?v=4y8QWStFl50
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 .