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. © 2008 Springer-Verlag.
CITATION STYLE
Ostrovsky, R., Persiano, G., & Visconti, I. (2008). Constant-round concurrent non-malleable zero knowledge in the bare public-key model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5126 LNCS, pp. 548–559). https://doi.org/10.1007/978-3-540-70583-3_45
Mendeley helps you to discover research relevant for your work.