Skip to main content
SpringerLink
Log in

An Independence Relation for Sets of Secrets

  • Published:
Studia Logica Aims and scope Submit manuscript

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 to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Amtoft Torben, Banerjee Anindya: ‘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  Google Scholar 

  2. Cohen, Ellis, ‘Information transmission in computational systems’, in Proceedings of Sixth ACM Symposium on Operating Systems Principles, Association for Computing Machinery, 1977, pp. 113–139.

  3. Geiger Dan, Paz Azaria, Pearl Judea: ‘Axioms and algorithms for inferences involving probabilistic independence’. Inform. and Comput. 91((1), 128–141 (1991)

    Article  Google Scholar 

  4. Goguen, Joseph A., and José Meseguer , ‘Security policies and security models’, in Proceedings of IEEE Symposium on Security and Privacy, 1982, pp. 11–20.

  5. Halpern, Joseph Y., and Kevin R. O’Neill, ‘Secrecy in multiagent systems’, in Proceedings of the Fifteenth IEEE Computer Security Foundations Workshop, 2002, pp. 32–46.

  6. Halpern Joseph Y., O’Neill Kevin R.: ‘Secrecy in multiagent systems’, ACM Trans. Inf. Syst. Secur., 12(1), 1–47 (2008) (originally appeared as [5])

    Article  Google Scholar 

  7. MacKenzie Donald: Mechanizing Proof: Computing, Risk, and Trust. MIT Press, (2004)

  8. Miner More, Sara, and Pavel Naumov, ‘An independence relation for sets of secrets’, in H. Ono, M. Kanazawa, and R. de Queiroz, (eds.), Proceedings of 16th Workshop on Logic, Language, Information and Computation (Tokyo, 2009), LNAI 5514, Springer, 2009, pp. 296–304.

  9. Miner More, Sara, and Pavel Naumov, ‘On interdependence of secrets in collaboration networks’, in Proceedings of 12th Conference on Theoretical Aspects of Rationality and Knowledge (Stanford University, 2009), 2009, pp. 208–217.

  10. Sabelfeld Andrei, Myers Andrew C.: ‘Language-based information-flow security’. IEEE Journal on Selected Areas in Communications 211, 5–19 (2003)

    Article  Google Scholar 

  11. Sutherland, David, ‘A model of information’, in Proceedings of Ninth National Computer Security Conference, 1986, pp. 175--183.

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

Corresponding author

Correspondence to Sara Miner More.

Rights and permissions

Reprints and permissions

About this article

Cite this article

More, S.M., Naumov, P. An Independence Relation for Sets of Secrets. Stud Logica 94, 73–85 (2010). https://doi.org/10.1007/s11225-010-9223-0

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11225-010-9223-0

Keywords

Search

Navigation