Client-server concurrent zero knowledge with constant rounds and guaranteed complexity

Ran Canetti; Abhishek Jain; Omer Paneth

doi:10.1007/978-3-662-44381-1_19

Client-server concurrent zero knowledge with constant rounds and guaranteed complexity

Ran Canetti, Abhishek Jain, Omer Paneth

School of Computer Science

Tel Aviv University

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

Abstract

The traditional setting for concurrent zero knowledge considers a server that proves a statement in zero-knowledge to multiple clients in multiple concurrent sessions, where the server's actions in a session are independent of all other sessions. Persiano and Visconti [ICALP 05] show how keeping a limited amount of global state across sessions allows the server to significantly reduce the overall complexity while retaining the ability to interact concurrently with an unbounded number of clients. Specifically, they show a protocol that has only slightly super-constant number of rounds; however the communication complexity in each session of their protocol depends on the number of other sessions and has no a-priori bound. This has the drawback that the client has no way to know in advance the amount of resources required for completing a session of the protocol up to the moment where the session is completed. We show a protocol that does not have this drawback. Specifically, in our protocol the client obtains a bound on the communication complexity of each session at the start of the session. Additionally the protocol is constant-rounds. Our protocols is fully concurrent, and assumes only collision-resistant hash functions. The proof requires considerably different techniques than those of Persiano and Visconti. Our main technical tool is an adaptation of the "committed-simulator" technique of Deng et. al [FOCS 09].

Original language	English
Title of host publication	Advances in Cryptology, CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings
Publisher	Springer Verlag
Pages	337-350
Number of pages	14
Edition	PART 2
ISBN (Print)	9783662443804
DOIs	https://doi.org/10.1007/978-3-662-44381-1_19
State	Published - 2014
Event	34rd Annual International Cryptology Conference, CRYPTO 2014 - Santa Barbara, CA, United States Duration: 17 Aug 2014 → 21 Aug 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 2
Volume	8617 LNCS

Conference

Conference	34rd Annual International Cryptology Conference, CRYPTO 2014
Country/Territory	United States
City	Santa Barbara, CA
Period	17/08/14 → 21/08/14

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-662-44381-1_19

Cite this

Canetti, R., Jain, A., & Paneth, O. (2014). Client-server concurrent zero knowledge with constant rounds and guaranteed complexity. In Advances in Cryptology, CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings (PART 2 ed., pp. 337-350). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8617 LNCS, No. PART 2). Springer Verlag. https://doi.org/10.1007/978-3-662-44381-1_19

Canetti, Ran ; Jain, Abhishek ; Paneth, Omer. / Client-server concurrent zero knowledge with constant rounds and guaranteed complexity. Advances in Cryptology, CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings. PART 2. ed. Springer Verlag, 2014. pp. 337-350 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).

@inproceedings{58ae3623f66e4a3dbcb807260d12013a,

title = "Client-server concurrent zero knowledge with constant rounds and guaranteed complexity",

abstract = "The traditional setting for concurrent zero knowledge considers a server that proves a statement in zero-knowledge to multiple clients in multiple concurrent sessions, where the server's actions in a session are independent of all other sessions. Persiano and Visconti [ICALP 05] show how keeping a limited amount of global state across sessions allows the server to significantly reduce the overall complexity while retaining the ability to interact concurrently with an unbounded number of clients. Specifically, they show a protocol that has only slightly super-constant number of rounds; however the communication complexity in each session of their protocol depends on the number of other sessions and has no a-priori bound. This has the drawback that the client has no way to know in advance the amount of resources required for completing a session of the protocol up to the moment where the session is completed. We show a protocol that does not have this drawback. Specifically, in our protocol the client obtains a bound on the communication complexity of each session at the start of the session. Additionally the protocol is constant-rounds. Our protocols is fully concurrent, and assumes only collision-resistant hash functions. The proof requires considerably different techniques than those of Persiano and Visconti. Our main technical tool is an adaptation of the {"}committed-simulator{"} technique of Deng et. al [FOCS 09].",

author = "Ran Canetti and Abhishek Jain and Omer Paneth",

note = "Funding Information: This paper is supported by the NSF EAGER grant, and NSF Algorithmic Foundations grant no. 1218461.; 34rd Annual International Cryptology Conference, CRYPTO 2014 ; Conference date: 17-08-2014 Through 21-08-2014",

year = "2014",

doi = "10.1007/978-3-662-44381-1_19",

language = "الإنجليزيّة",

isbn = "9783662443804",

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

publisher = "Springer Verlag",

number = "PART 2",

pages = "337--350",

booktitle = "Advances in Cryptology, CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings",

address = "ألمانيا",

edition = "PART 2",

}

Canetti, R, Jain, A & Paneth, O 2014, Client-server concurrent zero knowledge with constant rounds and guaranteed complexity. in Advances in Cryptology, CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings. PART 2 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 8617 LNCS, Springer Verlag, pp. 337-350, 34rd Annual International Cryptology Conference, CRYPTO 2014, Santa Barbara, CA, United States, 17/08/14. https://doi.org/10.1007/978-3-662-44381-1_19

Client-server concurrent zero knowledge with constant rounds and guaranteed complexity. / Canetti, Ran; Jain, Abhishek; Paneth, Omer.
Advances in Cryptology, CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings. PART 2. ed. Springer Verlag, 2014. p. 337-350 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8617 LNCS, No. PART 2).

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

TY - GEN

T1 - Client-server concurrent zero knowledge with constant rounds and guaranteed complexity

AU - Canetti, Ran

AU - Jain, Abhishek

AU - Paneth, Omer

N1 - Funding Information: This paper is supported by the NSF EAGER grant, and NSF Algorithmic Foundations grant no. 1218461.

PY - 2014

Y1 - 2014

N2 - The traditional setting for concurrent zero knowledge considers a server that proves a statement in zero-knowledge to multiple clients in multiple concurrent sessions, where the server's actions in a session are independent of all other sessions. Persiano and Visconti [ICALP 05] show how keeping a limited amount of global state across sessions allows the server to significantly reduce the overall complexity while retaining the ability to interact concurrently with an unbounded number of clients. Specifically, they show a protocol that has only slightly super-constant number of rounds; however the communication complexity in each session of their protocol depends on the number of other sessions and has no a-priori bound. This has the drawback that the client has no way to know in advance the amount of resources required for completing a session of the protocol up to the moment where the session is completed. We show a protocol that does not have this drawback. Specifically, in our protocol the client obtains a bound on the communication complexity of each session at the start of the session. Additionally the protocol is constant-rounds. Our protocols is fully concurrent, and assumes only collision-resistant hash functions. The proof requires considerably different techniques than those of Persiano and Visconti. Our main technical tool is an adaptation of the "committed-simulator" technique of Deng et. al [FOCS 09].

AB - The traditional setting for concurrent zero knowledge considers a server that proves a statement in zero-knowledge to multiple clients in multiple concurrent sessions, where the server's actions in a session are independent of all other sessions. Persiano and Visconti [ICALP 05] show how keeping a limited amount of global state across sessions allows the server to significantly reduce the overall complexity while retaining the ability to interact concurrently with an unbounded number of clients. Specifically, they show a protocol that has only slightly super-constant number of rounds; however the communication complexity in each session of their protocol depends on the number of other sessions and has no a-priori bound. This has the drawback that the client has no way to know in advance the amount of resources required for completing a session of the protocol up to the moment where the session is completed. We show a protocol that does not have this drawback. Specifically, in our protocol the client obtains a bound on the communication complexity of each session at the start of the session. Additionally the protocol is constant-rounds. Our protocols is fully concurrent, and assumes only collision-resistant hash functions. The proof requires considerably different techniques than those of Persiano and Visconti. Our main technical tool is an adaptation of the "committed-simulator" technique of Deng et. al [FOCS 09].

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

U2 - 10.1007/978-3-662-44381-1_19

DO - 10.1007/978-3-662-44381-1_19

M3 - منشور من مؤتمر

SN - 9783662443804

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

SP - 337

EP - 350

BT - Advances in Cryptology, CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings

PB - Springer Verlag

T2 - 34rd Annual International Cryptology Conference, CRYPTO 2014

Y2 - 17 August 2014 through 21 August 2014

ER -

Canetti R, Jain A, Paneth O. Client-server concurrent zero knowledge with constant rounds and guaranteed complexity. In Advances in Cryptology, CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings. PART 2 ed. Springer Verlag. 2014. p. 337-350. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). doi: 10.1007/978-3-662-44381-1_19

Client-server concurrent zero knowledge with constant rounds and guaranteed complexity

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this