**
Statistical Concurrent Non-malleable Zero Knowledge
**

*
Claudio Orlandi,
Rafail Ostrovsky,
Vanishree Rao,
Amit Sahai,
Ivan Visconti
*

The notion of Zero Knowledge introduced by Goldwasser, Micali and Rackoff in STOC 1985 is fundamental in cryptography. Motivated by conceptual and practical reasons, this notion has been explored under stronger definitions. We will consider the following two main strengthened notions.

** Statistical Zero Knowledge:** here the zero-knowledge property willlast forever, even in case in future the adversary will have unlimited power.

** Concurrent Non-Malleable Zero Knowledge: ** here the zero knowledge property is combined with non-transferability and the adversary fails in mounting a concurrent
man-in-the-middle attack aiming at transferring* zero-knowledge proofs*/arguments.

Besides the well-known importance of both notions, it still unknown whether one can design a * zero-knowledge protocol* that satisfies both notions simultaneously.

In this work we shed light on this question in a very strong sense. We show a * statistical concurrent non-malleable zero-knowledge argument system for NP* with a black-box simulator-extractor.

**comment:**
TCC 2014: 167-191

Fetch PDF file of the paper

Back to Publications List |