Paper Info
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].
Year
DOI
Venue
2014
10.1007/978-3-662-44381-1_19
ADVANCES IN CRYPTOLOGY - CRYPTO 2014, PT II
DocType
Volume
ISSN
Journal
8617
0302-9743
Citations 
PageRank 
References 
0
0.34
17
Authors
3
Name
Order
Citations
PageRank
Ran Canetti111355764.53
Abhishek Jain287948.25
Omer Paneth353522.42