CryptoDB
Almost Secure (1-Round, n-Channel) Message Transmission Scheme
| Authors: | |
|---|---|
| Download: | |
| Abstract: | It is known that perfectly secure ($1$-round, $n$-channel) message transmission (MT) schemes exist if and only if $n \geq 3t+1$, where $t$ is the number of channels that the adversary can corrupt. Then does there exist an {\it almost} secure MT scheme for $n=2t+1$ ? In this paper, we first sum up a number flaws of the previous {\it almost} secure MT scheme presented at Crypto 2004. (The authors already noted in thier presentation at Crypto'2004 that their scheme was flawed.) We next show an equivalence between almost secure MT schemes and secret sharing schemes with cheaters. By using our equivalence, we derive a lower bound on the communication complexity of almost secure MT schemes. Finally, we present a near optimum scheme which meets our bound approximately. This is the first construction of provably secure almost secure ($1$-round, $n$-channel) MT schemes for $n=2t+1$. |
BibTeX
@misc{eprint-2007-13358,
title={Almost Secure (1-Round, n-Channel) Message Transmission Scheme},
booktitle={IACR Eprint archive},
keywords={cryptographic protocols / Private and reliable transmission, information theoretic security, communication efficiency},
url={http://eprint.iacr.org/2007/076},
note={ kurosawa@mx.ibaraki.ac.jp 13640 received 26 Feb 2007, last revised 6 May 2007},
author={Kaoru Kurosawa and Kazuhiro Suzuki},
year=2007
}