@inproceedings{31498403836b45c0a1acf07fe1c3db31,
title = "On Round Optimal Statistical Zero Knowledge Arguments",
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.",
author = "Nir Bitansky and Omer Paneth",
note = "Publisher Copyright: {\textcopyright} 2019, International Association for Cryptologic Research.; 39th Annual International Cryptology Conference, CRYPTO 2019 ; Conference date: 18-08-2019 Through 22-08-2019",
year = "2019",
doi = "10.1007/978-3-030-26954-8\_5",
language = "الإنجليزيّة",
isbn = "9783030269531",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "128--156",
editor = "Daniele Micciancio and Alexandra Boldyreva",
booktitle = "Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings",
address = "ألمانيا",
}