Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity

Result by Ran Canetti, Abhishek Jain, Omer Paneth
Blog written by Samuel Ranellucci

Concurrent self-composition is the task of making a protocol
secure when many instances are run in parallel.

The goal of this paper is to generate Concurrent zero-knowledge
in the client-server model.
This work uses bounded concurrent ZK.
In contrast to earlier protocols where the amount of time that
a client has to await is undetermined and unbounded, the amount of time
that a client will have to wait is decided at the start of runtime of the zero-knowledge
protocol. This is based on the earlier wok of Persiano-Visconti potocol.

The main result is a 6 rounds Concurrent ZK which guarantees
communication complexity with O(n^c) where n is the number of concurrent proofs taking place.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s