Anzeige
Erschienen in:
2008 | OriginalPaper | Buchkapitel
Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
verfasst von : Kaoru Kurosawa, Kazuhiro Suzuki
Erschienen in: Advances in Cryptology – EUROCRYPT 2008
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In the model of perfectly secure message transmission schemes (PSMTs), there are
n
channels between a sender and a receiver. An infinitely powerful adversary
may corrupt (observe and forge) the messages sent through
t
out of
n
channels. The sender wishes to send a secret
s
to the receiver perfectly privately and perfectly reliably without sharing any key with the receiver.
In this paper, we show the first 2-round PSMT for
n
= 2
t
+ 1 such that not only the transmission rate is
O
(
n
) but also the computational costs of the sender and the receiver are both polynomial in
n
. This means that we solve the open problem raised by Agarwal, Cramer and de Haan at CRYPTO 2006.