Paper 2022/552
Improving Line-Point Zero Knowledge: Two Multiplications for the Price of One
Samuel Dittmer, Yuval Ishai, Steve Lu, and Rafail Ostrovsky
Abstract
Recent advances in fast protocols for \textit{vector oblivious linear evaluation} (VOLE) have inspired a family of new VOLE-based lightweight designated-verifier NIZK protocols (Weng et al., S\&P 2021, Baum et al., Crypto 2021, Dittmer et al., ITC 2021, Yang et al., CCS 2021). In particular, the Line-Point Zero Knowledge (LPZK) protocol of Dittmer et al.\ has the advantage of being entirely non-cryptographic given a single instance of a random VOLE correlation.
We present improvements to LPZK through the introduction of additional structure to the correlated randomness. Using an efficiently realizable variant of the VOLE correlation, we reduce the online proof size of LPZK by roughly 2x: from roughly 2 field elements per multiplication gate, or 1 element in the random oracle variant, to only 1 or
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint. MINOR revision.
- Keywords
- zero-knowledge proofslinear interactive proofsvector oblivious linear evaluation
- Contact author(s)
-
samuel dittmer @ gmail com
yuval ishai @ gmail com
steve @ stealthsoftwareinc com
rafail @ cs ucla edu - History
- 2022-05-10: received
- Short URL
- https://ia.cr/2022/552
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/552, author = {Samuel Dittmer and Yuval Ishai and Steve Lu and Rafail Ostrovsky}, title = {Improving Line-Point Zero Knowledge: Two Multiplications for the Price of One}, howpublished = {Cryptology {ePrint} Archive, Paper 2022/552}, year = {2022}, url = {https://eprint.iacr.org/2022/552} }