Round-optimal fully black-box zero-knowledge arguments from one-way permutations

Carmit Hazay; Muthuramakrishnan Venkitasubramaniam

doi:10.1007/978-3-030-03807-6_10

Round-optimal fully black-box zero-knowledge arguments from one-way permutations

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam

University of Rochester

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

6 Scopus citations

Abstract

In this paper, we revisit the round complexity of designing zero-knowledge (ZK) arguments via a black-box construction from minimal assumptions. Our main result implements a 4-round ZK argument for any language in NP, based on injective one-way functions, that makes black-box use of the underlying function. As a corollary, we also obtain the first 4-round perfect zero-knowledge argument for NP based on claw-free permutations via a black-box construction and 4-round input-delayed commit-and-prove zero-knowledge argument based on injective one-way functions.

Original language	English
Title of host publication	Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings
Editors	Amos Beimel, Stefan Dziembowski
Publisher	Springer Verlag
Pages	263-285
Number of pages	23
ISBN (Print)	9783030038069
DOIs	https://doi.org/10.1007/978-3-030-03807-6_10
State	Published - 2018
Event	16th Theory of Cryptography Conference, TCC 2018 - Panaji, India Duration: 11 Nov 2018 → 14 Nov 2018

Publication series

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

Conference

Conference	16th Theory of Cryptography Conference, TCC 2018
Country/Territory	India
City	Panaji
Period	11/11/18 → 14/11/18

Bibliographical note

Publisher Copyright:
© International Association for Cryptologic Research 2018.

Keywords

Black-box constructions
One-way permutations
Zero-knowledge arguments

Access to Document

10.1007/978-3-030-03807-6_10

Cite this

Hazay, C., & Venkitasubramaniam, M. (2018). Round-optimal fully black-box zero-knowledge arguments from one-way permutations. In A. Beimel, & S. Dziembowski (Eds.), Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings (pp. 263-285). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11239 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-03807-6_10

Hazay, Carmit ; Venkitasubramaniam, Muthuramakrishnan. / Round-optimal fully black-box zero-knowledge arguments from one-way permutations. Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings. editor / Amos Beimel ; Stefan Dziembowski. Springer Verlag, 2018. pp. 263-285 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{b37106523302494396fbd772d6efa33a,

title = "Round-optimal fully black-box zero-knowledge arguments from one-way permutations",

abstract = "In this paper, we revisit the round complexity of designing zero-knowledge (ZK) arguments via a black-box construction from minimal assumptions. Our main result implements a 4-round ZK argument for any language in NP, based on injective one-way functions, that makes black-box use of the underlying function. As a corollary, we also obtain the first 4-round perfect zero-knowledge argument for NP based on claw-free permutations via a black-box construction and 4-round input-delayed commit-and-prove zero-knowledge argument based on injective one-way functions.",

keywords = "Black-box constructions, One-way permutations, Zero-knowledge arguments",

author = "Carmit Hazay and Muthuramakrishnan Venkitasubramaniam",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2018.; 16th Theory of Cryptography Conference, TCC 2018 ; Conference date: 11-11-2018 Through 14-11-2018",

year = "2018",

doi = "10.1007/978-3-030-03807-6_10",

language = "אנגלית",

isbn = "9783030038069",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "263--285",

editor = "Amos Beimel and Stefan Dziembowski",

booktitle = "Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings",

address = "גרמניה",

}

Hazay, C & Venkitasubramaniam, M 2018, Round-optimal fully black-box zero-knowledge arguments from one-way permutations. in A Beimel & S Dziembowski (eds), Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11239 LNCS, Springer Verlag, pp. 263-285, 16th Theory of Cryptography Conference, TCC 2018, Panaji, India, 11/11/18. https://doi.org/10.1007/978-3-030-03807-6_10

Round-optimal fully black-box zero-knowledge arguments from one-way permutations. / Hazay, Carmit; Venkitasubramaniam, Muthuramakrishnan.
Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings. ed. / Amos Beimel; Stefan Dziembowski. Springer Verlag, 2018. p. 263-285 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11239 LNCS).

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

TY - GEN

T1 - Round-optimal fully black-box zero-knowledge arguments from one-way permutations

AU - Hazay, Carmit

AU - Venkitasubramaniam, Muthuramakrishnan

N1 - Publisher Copyright: © International Association for Cryptologic Research 2018.

PY - 2018

Y1 - 2018

N2 - In this paper, we revisit the round complexity of designing zero-knowledge (ZK) arguments via a black-box construction from minimal assumptions. Our main result implements a 4-round ZK argument for any language in NP, based on injective one-way functions, that makes black-box use of the underlying function. As a corollary, we also obtain the first 4-round perfect zero-knowledge argument for NP based on claw-free permutations via a black-box construction and 4-round input-delayed commit-and-prove zero-knowledge argument based on injective one-way functions.

AB - In this paper, we revisit the round complexity of designing zero-knowledge (ZK) arguments via a black-box construction from minimal assumptions. Our main result implements a 4-round ZK argument for any language in NP, based on injective one-way functions, that makes black-box use of the underlying function. As a corollary, we also obtain the first 4-round perfect zero-knowledge argument for NP based on claw-free permutations via a black-box construction and 4-round input-delayed commit-and-prove zero-knowledge argument based on injective one-way functions.

KW - Black-box constructions

KW - One-way permutations

KW - Zero-knowledge arguments

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

U2 - 10.1007/978-3-030-03807-6_10

DO - 10.1007/978-3-030-03807-6_10

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85057094658

SN - 9783030038069

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

SP - 263

EP - 285

BT - Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings

A2 - Beimel, Amos

A2 - Dziembowski, Stefan

PB - Springer Verlag

T2 - 16th Theory of Cryptography Conference, TCC 2018

Y2 - 11 November 2018 through 14 November 2018

ER -

Hazay C, Venkitasubramaniam M. Round-optimal fully black-box zero-knowledge arguments from one-way permutations. In Beimel A, Dziembowski S, editors, Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings. Springer Verlag. 2018. p. 263-285. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-03807-6_10

Round-optimal fully black-box zero-knowledge arguments from one-way permutations

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this