Skip to main content

Public-Key Cryptography and Availability

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3688))

Abstract

When the safety community designs their systems to also maintain security properties, it is likely that public-key encryption will be among the tools that are applied.

The security guarantees of this technology are based on a particular model of computation. We present the properties of this model that are relevant in the setting of distributed systems. Of particular importance is that the model has no notion of time.

From this it follows that systems that need to be available must exercise the utmost care before applying public-key encryption in any form. We discuss the relation between public-key encryption and timeliness, the tradeoffs that must be made at design time, and how the property of (lack of) availability might very well contaminate other system components.

This work has been generously supported by the Research Council of Norway by means of the Arctic Bean project (IKT 2010, project number 146986/431) and the Penne project (IKTSoS project number 158569/431).

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pfitzmann, A.: Why safety and security should and will merge. In: Heisel, M., Liggesmeyer, P., Wittmann, S. (eds.) SAFECOMP 2004. LNCS, vol. 3219, pp. 1–2. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Anderson, R.J.: Security Engineering. John Wiley & Sons, Inc., Chichester (2001)

    Google Scholar 

  3. Lampson, B.: Security in the real world. IEEE Computer 37, 37–46 (2004)

    Google Scholar 

  4. Rushby, J.: Critical system properties: Survey and taxonomy. Reliability Engineering and System Safety 43, 189–219 (1994)

    Article  Google Scholar 

  5. Nechvatal, J.: Public key cryptography. In: In Simmons, G.J. (ed.) Contemporary cryptology, the science of information integrity, pp. 177–288. IEEE Press, Los Alamitos (1992)

    Google Scholar 

  6. Roe, M.: Cryptography and evidence. PhD thesis, Clare College, University of Cambridge, UK (1998)

    Google Scholar 

  7. Avizienis, A., Laprie, J.C., Randell, B., Landwehr, C.: Basic concepts and taxonomy of dependable and secure computing. IEEE Transactions on Dependable and Secure Computing 1, 11–33 (2004)

    Article  Google Scholar 

  8. Needham, R.M.: Denial of service: an example. Communications of the ACM 37, 42–46 (1994)

    Article  Google Scholar 

  9. Mirkovic, J., Reiher, P.: A taxonomy of DDoS attack and DDoS defense mechanisms. SIGCOMM Computer Communication Review 34, 39–53 (2004)

    Article  Google Scholar 

  10. Barborak, M., Dahbura, A., Malek, M.: The consensus problem in fault-tolerant computing. ACM Comput. Surv. 25, 171–220 (1993)

    Article  Google Scholar 

  11. Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Transactions on Programming Languages and Systems 4, 382–401 (1982)

    Article  MATH  Google Scholar 

  12. Stabell-Kulø, T., Dillema, F., Fallmyr, T.: The open-end argument for private computing. In: Gellersen, H.-W. (ed.) HUC 1999. LNCS, vol. 1707, pp. 124–136. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  13. Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32, 374–382 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  14. Blum, M., Goldwasser, S.: An efficient probabilistic public-key encryption scheme which hides all partial information. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  15. Lampson, B., Abadi, M., Burrows, M., Wobber, E.: Authentication in distribued systems: theory and practice. ACM Transactions on Computer Systems 10, 265–310 (1992)

    Article  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

Stabell-Kulø, T., Lupetti, S. (2005). Public-Key Cryptography and Availability. In: Winther, R., Gran, B.A., Dahll, G. (eds) Computer Safety, Reliability, and Security. SAFECOMP 2005. Lecture Notes in Computer Science, vol 3688. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11563228_17

Download citation

  • DOI: https://doi.org/10.1007/11563228_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29200-5

  • Online ISBN: 978-3-540-32000-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics