Skip to main content
SpringerLink
Log in

Probability and Timing: Challenges for Secure Programming

Invited Talk

  • Conference paper
  • First Online:
Process Algebra and Probabilistic Methods: Performance Modeling and Verification (PAPM-PROBMIV 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2399))

  • 364 Accesses

Abstract

When can a program be trusted with your secret data? The setting which motivates this work is that of confidentiality and privacy in mobile code. Assume that some user wants to run a program that originates from an untrusted source. For example, the program can have been downloaded from an untrusted site on the Internet. When the program is run, it has to be given access to some data that the user regards as confidential in order to compute the desired results. While running, the program also needs to have access to the Internet in order to fetch various kinds of information from databases etc. This setting has been the motivation behind a recent resurgence of interest in the analysis and certification of confidentiality properties of programs.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

References

  1. J. Agat and D. Sands. On confidentiality and algorithms. In Francis M. Titsworth, editor, Proceedings of the 2001 IEEE Symposium on Security and Privacy (S&P-01), pages 64–77. IEEE Computer Society, May 2001.

    Google Scholar 

  2. A. Sabelfeld and D. Sands. Probabilistic noninterference for multi-threaded programs. In Proceedings of the 13th IEEE Computer Security Foundations Workshop, pages 200–214, Cambridge, England, July 2000. IEEE Computer Society Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chalmers University of Technology, Sweden

    David Sands

  2. Göteborg University, Sweden

    David Sands

Authors
  1. David Sands
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science Formal Methods and Tools Group, University of Twente, P.O. Box 217, 7500 AE, Enschede, The Netherlands

    Holger Hermanns

  2. Department of Computer Science, University of Verona, Strada Le Grazie 15, 37134, Verona, Italy

    Roberto Segala

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sands, D. (2002). Probability and Timing: Challenges for Secure Programming. In: Hermanns, H., Segala, R. (eds) Process Algebra and Probabilistic Methods: Performance Modeling and Verification. PAPM-PROBMIV 2002. Lecture Notes in Computer Science, vol 2399. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45605-8_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45605-8_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43913-4

  • Online ISBN: 978-3-540-45605-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation