On Round Optimal Statistical Zero Knowledge Arguments

Nir Bitansky; Omer Paneth

doi:10.1007/978-3-030-26954-8_5

On Round Optimal Statistical Zero Knowledge Arguments

Nir Bitansky, Omer Paneth

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English (US)
Title of host publication	Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings
Editors	Daniele Micciancio, Alexandra Boldyreva
Publisher	Springer Verlag
Pages	128-156
Number of pages	29
ISBN (Print)	9783030269531
DOIs	https://doi.org/10.1007/978-3-030-26954-8_5
State	Published - 2019
Event	39th Annual International Cryptology Conference, CRYPTO 2019 - Santa Barbara, United States Duration: Aug 18 2019 → Aug 22 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11694 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	39th Annual International Cryptology Conference, CRYPTO 2019
Country/Territory	United States
City	Santa Barbara
Period	8/18/19 → 8/22/19

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-030-26954-8_5

Cite this

Bitansky, N., & Paneth, O. (2019). On Round Optimal Statistical Zero Knowledge Arguments. In D. Micciancio, & A. Boldyreva (Eds.), Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings (pp. 128-156). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11694 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-26954-8_5

On Round Optimal Statistical Zero Knowledge Arguments. / Bitansky, Nir; Paneth, Omer.
Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings. ed. / Daniele Micciancio; Alexandra Boldyreva. Springer Verlag, 2019. p. 128-156 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11694 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Bitansky, N & Paneth, O 2019, On Round Optimal Statistical Zero Knowledge Arguments. in D Micciancio & A Boldyreva (eds), Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11694 LNCS, Springer Verlag, pp. 128-156, 39th Annual International Cryptology Conference, CRYPTO 2019, Santa Barbara, United States, 8/18/19. https://doi.org/10.1007/978-3-030-26954-8_5

Bitansky N, Paneth O. On Round Optimal Statistical Zero Knowledge Arguments. In Micciancio D, Boldyreva A, editors, Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings. Springer Verlag. 2019. p. 128-156. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-26954-8_5

Bitansky, Nir ; Paneth, Omer. / On Round Optimal Statistical Zero Knowledge Arguments. Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings. editor / Daniele Micciancio ; Alexandra Boldyreva. Springer Verlag, 2019. pp. 128-156 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d1ee825dac6e4e7e8c6fdda815ac5d4b,

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 = "English (US)",

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",

}

TY - GEN

T1 - On Round Optimal Statistical Zero Knowledge Arguments

AU - Bitansky, Nir

AU - Paneth, Omer

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85071670485&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85071670485&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-26954-8_5

DO - 10.1007/978-3-030-26954-8_5

M3 - Conference contribution

AN - SCOPUS:85071670485

SN - 9783030269531

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 128

EP - 156

BT - Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings

A2 - Micciancio, Daniele

A2 - Boldyreva, Alexandra

PB - Springer Verlag

T2 - 39th Annual International Cryptology Conference, CRYPTO 2019

Y2 - 18 August 2019 through 22 August 2019

ER -

On Round Optimal Statistical Zero Knowledge Arguments

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this