Paper 2019/640
On Round Optimal Statistical Zero Knowledge Arguments
Nir Bitansky and Omer Paneth
Abstract
We construct the first three message statistical zero knowledge arguments for all of NP, matching the known lower bound. We do so based on keyless multi-collision resistant hash functions and other standard primitives (based on the Learning with Errors assumption) --- the same assumptions used to obtain round optimal computational zero knowledge. The main component in our constructions is a statistically witness indistinguishable argument of knowledge based on a new notion of statistically hiding commitments with subset opening.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published by the IACR in CRYPTO 2019
- Keywords
- zero knowledgecollision resistancestatistically hiding commitments
- Contact author(s)
-
nbitansky @ gmail com
omerpa @ gmail com - History
- 2019-06-03: received
- Short URL
- https://ia.cr/2019/640
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/640,
author = {Nir Bitansky and Omer Paneth},
title = {On Round Optimal Statistical Zero Knowledge Arguments},
howpublished = {Cryptology {ePrint} Archive, Paper 2019/640},
year = {2019},
url = {https://eprint.iacr.org/2019/640}
}
