Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Logic, Language, Information, and Computation

WoLLIC 2009: Logic, Language, Information and Computation pp 296–304Cite as

An Independence Relation for Sets of Secrets

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5514))

Abstract

A relation between two secrets, known in the literature as nondeducibility, was originally introduced by Sutherland. We extend it to a relation between sets of secrets that we call independence. This paper proposes a formal logical system for the independence relation, proves the completeness of the system with respect to a semantics of secrets, and shows that all axioms of the system are logically independent.

This is a preview of subscription content, 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   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. Sutherland, D.: A model of information. In: Proceedings of Ninth National Computer Security Conference, pp. 175–183 (1986)

    Google Scholar 

  2. Sabelfeld, A., Myers, A.C.: Language-based information-flow security. IEEE Journal on Selected Areas in Communications 21(1), 5–19 (2003)

    Article  Google Scholar 

  3. Amtoft, T., Banerjee, A.: A logic for information flow analysis with an application to forward slicing of simple imperative programs. Sci. Comput. Program. 64(1), 3–28 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Halpern, J., O’Neill, K.: Secrecy in multiagent systems. In: Proceedings of the Fifteenth IEEE Computer Security Foundations Workshop, pp. 32–46 (2002)

    Google Scholar 

  5. Halpern, J.Y., O’Neill, K.R.: Secrecy in multiagent systems. ACM Trans. Inf. Syst. Secur. 12(1), 1–47 (2008)

    Article  Google Scholar 

  6. MacKenzie, D.: Mechanizing Proof: Computing, Risk, and Trust. MIT Press, Cambridge (2004)

    MATH  Google Scholar 

  7. Goguen, J.A., Meseguer, J.: Security policies and security models. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 11–20 (1982)

    Google Scholar 

  8. Cohen, E.: Information transmission in computational systems. In: Proceedings of Sixth ACM Symposium on Operating Systems Principles, Association for Computing Machinery, pp. 113–139 (1977)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, McDaniel College, Westminster, Maryland, 21157, USA

    Sara Miner More & Pavel Naumov

Authors
  1. Sara Miner More
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pavel Naumov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Japan Advanced Institute of Science and Technology, 1-1 Asahidai, Nomi, 923-1292, Ishikawa, Japan

    Hiroakira Ono

  2. National Institute of Informatics, 2–1–2 Hitotsubashi, Chiyoda-ku, 101–8430, Tokyo, Japan

    Makoto Kanazawa

  3. Centro de Informática, Universidade Federal de Pernambuco, Recife, PE, Brazil

    Ruy de Queiroz

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

More, S.M., Naumov, P. (2009). An Independence Relation for Sets of Secrets. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2009. Lecture Notes in Computer Science(), vol 5514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02261-6_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02261-6_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02260-9

  • Online ISBN: 978-3-642-02261-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation