Cryptology ePrint Archive: Report 2014/143

Statistical Concurrent Non-Malleable Zero Knowledge

Claudio Orlandi and Rafail Ostrovsky and Vanishree Rao and Amit Sahai and Ivan Visconti

Abstract: 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 will last 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 is 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 {\em statistical concurrent non-malleable} zero-knowledge argument system for $\NP$ with a {\em black-box} simulator-extractor.

Category / Keywords:

Original Publication (with minor differences): IACR-TCC-2014

Date: received 25 Feb 2014, last revised 3 Mar 2014

Contact author: vhvanshvansh at gmail com

Available format(s): PDF | BibTeX Citation

Note: This revision was made to clear a typo in the author list and in the list of acknowledgements.

Version: 20140303:220058 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]