Skip to main content
SpringerLink
Log in

A Practical and Secure Communication Protocol in the Bounded Storage Model

  • Conference paper
Book cover Networking - ICN 2005 (ICN 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3421))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Maurer, U.: Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology 1, 53–66 (1992)

    Google Scholar 

  2. Ding, Y.Z., Rabin, M.O.: Hyper-encryption and everlasting security. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 1–26. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Aumann, Y., Ding, Y.Z., Rabin, M.O.: Everlasting security in the bounded storage model. IEEE Transactions on Information Theory 6, 1668–1680 (2002)

    Article  MathSciNet  Google Scholar 

  4. Lu, C.-J.: Hyper-encryption against space-bounded adversaries from on-line strong extractors. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 257–271. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Vadhan, S.P.: On constructing locally computable extractors and cryptosystems in the bounded storage model. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 61–77. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Kolata, G.: The Key Vanishes: Scientist Outlines Unbreakable Code. New York Times (2001)

    Google Scholar 

  7. Cromie, W.J.: Code conquers computer snoops: Offers promise of ‘everlasting’ security for senders. Harvard University Gazette (2001)

    Google Scholar 

  8. Observatory, U.S.N.: GPS timing data & information (2004), http://tycho.usno.navy.mil/gps_datafiles.html

  9. Halevi, S., Krawczyk, H.: MMH: Software message authentication in the gbit/Second rates. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 172–189. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  10. Black, J., Halevi, S., Krawczyk, H., Krovetz, T., Rogaway, P.: UMAC: Fast and secure message authentication. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 216–233. Springer, Heidelberg (1999)

    Google Scholar 

  11. Gabber, O., Galil, Z.: Explicit constructions of linear-sized superconcentrators. Journal of Computer and System Sciences 3, 407–420 (1981)

    Article  MathSciNet  Google Scholar 

  12. Carter, J.L., Wegman, M.: Universal classes of hash functions. Journal of Computer and System Sciences 18, 143–154 (1978)

    Article  MathSciNet  Google Scholar 

  13. Krawczyk, H.: LFSR-based hashing and authentication. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 129–139. Springer, Heidelberg (1994)

    Google Scholar 

  14. Rogaway, P.: Bucket hashing and its application to fast message authentication. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 313–328. Springer, Heidelberg (1995)

    Google Scholar 

  15. Barak, B., Shaltiel, R., Tomer, E.: True Random Number Generators Secure in a Changing Environment. In: Çetin, K., Koç, P.C. (eds.) Workshop on Cryptographic Hardware and Embedded Systems — CHES 2003, Berlin, Germany, pp. 166–180. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  16. Mansour, Y., Nissan, N., Tiwari, P.: The computational complexity of universal hashing. In: 22nd Annual ACM Symposium on Theory of Computing, pp. 235–243. ACM Press, New York (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Engineering and Natural Sciences, Sabanci University, Istanbul, TR-34956, Turkey

    E. Savaş

  2. Electrical & Computer Engineering, Worcester Polytechnic Institute, Worcester, Massachusetts, 01609

    Berk Sunar

Authors
  1. E. Savaş
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Berk Sunar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IUT, University of Haute Alsace, 34, rue du Grillenbreit, 68008, Colmar, France

    Pascal Lorenz

  2. Cisco Systems, Inc., 10 West Tasman Drive, Bldg O/2, 95134, San Jose, CA, USA

    Petre Dini

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Savaş, E., Sunar, B. (2005). A Practical and Secure Communication Protocol in the Bounded Storage Model. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_80

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31957-3_80

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25338-9

  • Online ISBN: 978-3-540-31957-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation