Truly efficient 2-round perfectly secure message transmission scheme

In the model of perfectly secure message transmission (PSMT) schemes, there are n channels between a sender and a receiver. An infinitely powerful adversary A 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 = 2t + 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. The main novelty of our approach is to introduce a notion of pseudobasis to the coding theory. It will be an independent interest for coding theory, too.

[1]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[2]  Hosame Abu-Amara,et al.  Efficient Perfectly Secure Message Transmission in Synchronous Networks , 1996, Inf. Comput..

[3]  Ronald Cramer,et al.  Asymptotically Optimal Two-Round Perfectly Secure Message Transmission , 2006, CRYPTO.

[4]  R. J. McEliece,et al.  On sharing secrets and Reed-Solomon codes , 1981, CACM.

[5]  K. Srinathan,et al.  On perfectly secure communication over arbitrary networks , 2002, PODC '02.

[6]  Matthias Fitzi,et al.  Towards Optimal and Efficient Perfectly Secure Message Transmission , 2007, TCC.

[7]  Moti Yung,et al.  Perfectly secure message transmission , 1993, JACM.

[8]  K. Srinathan,et al.  Efficient single phase unconditionally secure message transmission with optimum communication complexity , 2008, PODC '08.

[9]  Kaoru Kurosawa,et al.  Truly Efficient $2$-Round Perfectly Secure Message Transmission Scheme , 2009, IEEE Transactions on Information Theory.

[10]  K. Srinathan,et al.  Optimal Perfectly Secure Message Transmission , 2004, CRYPTO.

[11]  Rafail Ostrovsky,et al.  Almost-Everywhere Secure Computation , 2008, EUROCRYPT.

[12]  Kaoru Kurosawa,et al.  Almost Secure (1-Round, n-Channel) Message Transmission Scheme , 2009, ICITS.

[13]  Yongge Wang,et al.  A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without Feedback , 2005, ISAAC.

[14]  Ueli Maurer,et al.  Player Simulation and General Adversary Structures in Perfect Multiparty Computation , 2000, Journal of Cryptology.