A Practical and Secure Communication Protocol in the Bounded Storage Model

Proposed by Maurer the bounded storage model has received much academic attention in the recent years. Perhaps the main reason for this attention is that the model facilitates a unique private key encryption scheme called hyper-encryption which provides everlasting unconditional security. So far the work on the bounded storage model has been largely on the theoretical basis. In this paper, we make a first attempt to outline a secure communication protocol based on this model. We describe a protocol which defines means for successfully establishing and carrying out an encryption session and address potential problems such as protocol failures and attacks. Furthermore, we outline a novel method for authenticating and ensuring the integrity of a channel against errors.

[1]  Noam Nisan,et al.  The computational complexity of universal hashing , 1990, STOC '90.

[2]  Moti Yung,et al.  Advances in Cryptology — CRYPTO 2002 , 2002, Lecture Notes in Computer Science.

[3]  Michael O. Rabin,et al.  Hyper-Encryption and Everlasting Security , 2002, STACS.

[4]  Gilles Brassard,et al.  The generation of random numbers that are probably prime , 1988, Journal of Cryptology.

[5]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[6]  Dan Boneh,et al.  Advances in Cryptology - CRYPTO 2003 , 2003, Lecture Notes in Computer Science.

[7]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..

[8]  Ronen Shaltiel,et al.  True Random Number Generators Secure in a Changing Environment , 2003, CHES.

[9]  Michael Wiener,et al.  Advances in Cryptology — CRYPTO’ 99 , 1999 .

[10]  Hugo Krawczyk,et al.  UMAC: Fast and Secure Message Authentication , 1999, CRYPTO.

[11]  Yvo Desmedt,et al.  Advances in Cryptology — CRYPTO ’94 , 2001, Lecture Notes in Computer Science.

[12]  Gerhard Goos,et al.  Fast Software Encryption , 2001, Lecture Notes in Computer Science.

[13]  Hugo Krawczyk,et al.  LFSR-based Hashing and Authentication , 1994, CRYPTO.

[14]  Hugo Krawczyk,et al.  MMH: Software Message Authentication in the Gbit/Second Rates , 1997, FSE.

[15]  Ueli Maurer.  Conditionally-perfect secrecy and a provably-secure randomized cipher , 2004, Journal of Cryptology.

[16]  Phillip Rogaway.  Bucket Hashing and its Application to Fast Message Authentication , 1995, CRYPTO.

[17]  Chi-Jen Lu,et al.  Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors , 2002, CRYPTO.

[18]  Yonatan Aumann,et al.  Everlasting security in the bounded storage model , 2002, IEEE Trans. Inf. Theory.

[19]  Salil P. Vadhan,et al.  On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model , 2003, CRYPTO.