Skip to main content

On the Security and Composability of the One Time Pad

  • Conference paper
SOFSEM 2005: Theory and Practice of Computer Science (SOFSEM 2005)

Abstract

Motivated by a potentially flawed deployment of the one time pad in a recent quantum cryptographic application securing a bank transfer [1], we show how to implement a statistically secure system for message passing, that is, a channel with negligible failure rate secure against unbounded adversaries, using a one time pad based cryptosystem. We prove the security of our system in the framework put forward by Backes, Pfitzmann, and Waidner [2].

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Poppe, A., Fedrizzi, A., Loruenser, T., Maurhardt, O., Ursin, R., Boehm, H.R., Peev, M., Suda, M., Kurtsiefer, C., Weinfurter, H., Jennewein, T., Zeilinger, A.: Practical Quantum Key Distribution with Polarization-Entangled Photons. lanl.arXiv.org e-Print archive, quant-ph/0404115 (2004)

    Google Scholar 

  2. Backes, M., Pfitzmann, B., Waidner, M.: Secure Asynchronous Reactive Systems. Cryptology ePrint Archive, Report 2004/082 (2004), http://eprint.iacr.org/2004/082/

  3. Boyd, C., Mathuria, A.: Protocols for Authentication and Key Establishment. Information Security and Cryptography. Springer, Heidelberg (2003)

    Google Scholar 

  4. Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001. IEEE Computer Society, Los Alamitos (2001); Full version available at Cryptology ePrint Archive, Report 2000/067, http://eprint.iacr.org/2000/067/

    Google Scholar 

  5. Stinson, D.R.: Cryptography – Theory and Practice. CRC Press, Boca Raton (1995)

    MATH  Google Scholar 

  6. Canetti, R., Krawczyk, H.: Universally Composable Notions of Key Exchange and Secure Channels. Cryptology ePrint Archive, Report 2002/059 (2002), Extended version of [9], http://eprint.iacr.org/2002/059/

  7. Pfitzmann, B., Waidner, M.: A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission. Cryptology ePrint Archive, Report 2000/066 (2000), http://eprint.iacr.org/2000/066/

  8. Raub, D., Steinwandt, R., Müller-Quade, J.: On the Security and Composability of the One Time Pad. Cryptology ePrint Archive, Report 2004/113 (2004), http://eprint.iacr.org/2004/113/

  9. Canetti, R., Krawczyk, H.: Universally Composable Notions of Key Exchange and Secure Channels. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 337–351. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Raub, D., Steinwandt, R., Müller-Quade, J. (2005). On the Security and Composability of the One Time Pad. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds) SOFSEM 2005: Theory and Practice of Computer Science. SOFSEM 2005. Lecture Notes in Computer Science, vol 3381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30577-4_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30577-4_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24302-1

  • Online ISBN: 978-3-540-30577-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics