Paper 2024/1663
A Hidden-Bits Approach to Black-Box Statistical ZAPs from LWE
Abstract
We give a new approach for constructing statistical ZAP arguments (a two-message public-coin statistically witness indistinguishable argument) from quasi-polynomial hardness of the learning with errors (LWE) assumption with a polynomial modulus-to-noise ratio. Previously, all ZAP arguments from lattice-based assumptions relied on correlation-intractable hash functions. In this work, we present the first construction of a ZAP from LWE via the classic hidden-bits paradigm. Our construction matches previous lattice-based schemes by being public-coin and satisfying statistical witness indistinguishability. Moreover, our construction is the first lattice-based ZAP that is fully black-box in the use of cryptography. Previous lattice-based ZAPs based on correlation-intractable hash functions all made non-black-box use of cryptography.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Contact author(s)
-
elibradley @ utexas edu
gclu @ cs utexas edu
shafik @ cs utexas edu
bwaters @ cs utexas edu
dwu4 @ cs utexas edu - History
- 2024-10-18: approved
- 2024-10-14: received
- See all versions
- Short URL
- https://ia.cr/2024/1663
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1663,
author = {Eli Bradley and George Lu and Shafik Nassar and Brent Waters and David J. Wu},
title = {A Hidden-Bits Approach to Black-Box Statistical {ZAPs} from {LWE}},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1663},
year = {2024},
url = {https://eprint.iacr.org/2024/1663}
}
