On constant-round concurrent non-malleable proof systems

Security under man-in-the-middle attacks is extremely important when protocols are executed on asynchronous networks, as the Internet. Focusing on interactive proof systems, one would like also to achieve unconditional soundness, so that proving a false statement is not possible even for a computati...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters 2011-09, Vol.111 (18), p.883-890
Main Authors: Cao, Zhenfu, Visconti, Ivan, Zhang, Zongyang
Format: Article
Language:English
Subjects:
Algebra
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science
control theory
systems
Concurrent non-malleability
Cryptography
Exact sciences and technology
Mathematical models
Mathematics
Miscellaneous
Network security
Number theory
Proof theory
Protocol
Sciences and techniques of general use
Studies
Theoretical computing
Witness-indistinguishable proofs
Zero-knowledge proofs
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Security under man-in-the-middle attacks is extremely important when protocols are executed on asynchronous networks, as the Internet. Focusing on interactive proof systems, one would like also to achieve unconditional soundness, so that proving a false statement is not possible even for a computationally unbounded adversarial prover. Motivated by such requirements, in this paper we address the problem of designing constant-round protocols in the plain model that enjoy simultaneously non-malleability (i.e., security against man-in-the-middle attacks) and unconditional soundness (i.e., they are proof systems). We first give a construction of a constant-round one–many (i.e., one honest prover, many honest verifiers) concurrent non-malleable zero-knowledge proof (in contrast to argument) system for every NP language in the plain model. We then give a construction of a constant-round concurrent non-malleable witness-indistinguishable proof system for every NP language. Compared with previous results, our constructions are the first constant-round proof systems that in the plain model guarantee simultaneously security against some non-trivial concurrent man-in-the-middle attacks and against unbounded malicious provers. ► Construction of constant-round one–many CNMZK proofs for NP in the plain model. ► Construction of constant-round CNMWI proofs for NP in the plain model. ► Constant-round proofs in the plain model secure against concurrent MiM attacks.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2011.06.004