International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: On Round Optimal Statistical Zero Knowledge Arguments

Authors:
Nir Bitansky
Omer Paneth
Download:
DOI: 10.1007/978-3-030-26954-8_5
Search ePrint
Search Google
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 the Learning with Errors assumption—the same assumptions used to obtain round optimal computational zero knowledge.The main component in our construction is a statistically witness indistinguishable argument of knowledge based on a new notion of statistically hiding commitments with subset opening.
BibTeX
@article{crypto-2019-29912,
  title={On Round Optimal Statistical Zero Knowledge Arguments},
  booktitle={Advances in Cryptology – CRYPTO 2019},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={11694},
  pages={128-156},
  doi={10.1007/978-3-030-26954-8_5},
  author={Nir Bitansky and Omer Paneth},
  year=2019
}