Name
Abstract | ||
|---|---|---|
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-knowledgeargument system for NPin 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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-70583-3_45 | ICALP (2) |
Keywords | Field | DocType |
non-malleable witness indistinguishability,constant-round concurrent non-malleable zero-knowledgeargument,non-constant round complexity,round-efficient protocol,concurrent man-in-the-middle attack,concurrent non-malleable zero knowledge,independent interest,central question,major open problem,bare public-key model,previous result,man in the middle attack,zero knowledge | Round complexity,Cryptography,Computer security,Concurrency,Computer science,Theoretical computer science,Witness,Zero-knowledge proof,Public-key cryptography,Distributed computing | Conference |
Volume | ISSN | Citations |
5126 | 0302-9743 | 21 |
PageRank | References | Authors |
0.64 | 21 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rafail Ostrovsky | 1 | 8743 | 588.15 |
| Giuseppe Persiano | 2 | 1773 | 152.14 |
| Ivan Visconti | 3 | 612 | 40.30 |