Advertisement
Published in:
2008 | OriginalPaper | Chapter
Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
Authors : Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti
Published in: Automata, Languages and Programming
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
One of the central questions in Cryptography is the design of round-efficient protocols that are secure under concurrent man-in-the-middle attacks. In this paper we present the first
constant-round concurrent non-malleable zero-knowledge
argument system for
NP
in the Bare Public-Key model [Canetti et al., STOC 2000], resolving one of the major open problems in this area. To achieve our result, we introduce and study the notion of non-malleable witness indistinguishability, which is of independent interest. Previous results either achieved relaxed forms of concurrency/security or needed stronger setup assumptions or required a non-constant round complexity.