Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme

  • Kaoru Kurosawa
  • Kazuhiro Suzuki
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4965)

Abstract

In the model of perfectly secure message transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary Open image in new window 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.

Keywords

Perfectly secure message transmission information theoretic security efficiency 

References

  1. 1.
    Agarwal, S., Cramer, R., de Haan, R.: Asymptotically Optimal Two-Round Perfectly Secure Message Transmission. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 394–408. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  2. 2.
    Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly Secure Message Transmission. J. ACM 40(1), 17–47 (1993)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Desmedt, Y., Wang, Y., Burmester, M.: A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without Feedback. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 277–287. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Fitzi, M., Franklin, M., Garay, J., Vardhan, S.: Towards Optimal and Efficient Perfectly Secure Message Transmission. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 311–322. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  5. 5.
    Hirt, M., Maurer, U.: Player Simulation and General Adversary Structures in Perfect Multiparty Computation. J. Cryptology 13(1), 31–60 (2000)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Kumar, M.V.N.A., Goundan, P.R., Srinathan, K., Rangan, C.P.: On perfectly secure communication over arbitrary networks. In: PODC 2002, pp. 193–202 (2002)Google Scholar
  7. 7.
    Md Sayeed, H., Abu-Amara, H.: Efficient Perfectly Secure Message Transmission in Synchronous Networks. Inf. Comput. 126(1), 53–61 (1996)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Srinathan, K., Narayanan, A., Rangan, C.P.: Optimal Perfectly Secure Message Transmission. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 545–561. Springer, Heidelberg (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Kaoru Kurosawa
    • 1
  • Kazuhiro Suzuki
    • 2
  1. 1.Department of Computer and Information SciencesIbaraki University 
  2. 2.Venture Business LaboratoryIbaraki University, HitachiIbarakiJapan

Personalised recommendations