Three different types of interdependence between pieces of information, or “secrets”, are discussed and compared. Two of them, functional dependence and nondeducibility, have been studied and axiomatized before. This article introduces a third type of interdependence and provides a complete and decidable axiomatization of this new relation.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Armstrong, W. W., Dependency structures of data base relationships. In Information processing 74 (Proc. IFIP Congress, Stockholm, 1974). North-Holland, Amsterdam, 1974, pp. 580–583.
Beeri, Catriel, Ronald Fagin, and John H. Howard, A complete axiomatization for functional and multivalued dependencies in database relations. In SIGMOD ’77: Proceedings of the 1977 ACM SIGMOD international conference on Management of data, New York, NY, USA, 1977, pp. 47–61. ACM.
Donders, Michael S., Sara Miner More, and Pavel Naumov, Information flow on directed acyclic graphs. In L. D. Beklemishev and R. de Queiroz (eds.), WoLLIC, volume 6642 of Lecture Notes in Computer Science, Springer, 2011, pp. 95–109.
Garcia-Molina, Hector, Jeffrey Ullman, and Jennifer Widom, Database Systems: The Complete Book. Prentice-Hall, second edition, 2009.
Geiger , Dan , Azaria Paz, Judea Pearl: Axioms and algorithms for inferences involving probabilistic independence. Inform. and Comput. 91(1), 128–141 (1991)
Halpern , Joseph Y., Kevin R. O’Neill: Secrecy in multiagent systems. ACM Trans. Inf. Syst. Secur. 12(1), 1–47 (2008)
Kelvey, Robert, Sara Miner More, Pavel Naumov, and Benjamin Sapp, Independence and functional dependence relations on secrets. In Proceedings of 12th International Conference on the Principles of Knowledge Representation and Reasoning (Toronto, 2010). AAAI, 2010, pp. 528–533.
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.
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.
Miner More, Sara , Pavel Naumov: An independence relation for sets of secrets. Studia Logica 94(1), 73–85 (2010)
Miner More, Sara , Pavel Naumov: Hypergraphs of multiparty secrets. Ann. Math. Artif. Intell. 62(1-2), 79–101 (2011)
Miner More, Sara , Pavel Naumov: Logic of secrets in collaboration networks. Ann. Pure Appl. Logic 162(12), 959–969 (2011)
Miner More, Sara, Pavel Naumov, and Benjamin Sapp, Concurrency semantics for the Geiger-Paz-Pearl axioms of independence. In M. Bezem (ed.), Computer Science Logic, 25th International Workshop / 20th Annual Conference of the EACSL, CSL 2011, September 12-15, 2011, Bergen, Norway, Proceedings, volume 12 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011, pp. 443–457.
Naumov, Pavel, and Brittany Nicholls, Game semantics for the Geiger-Paz- Pearl axioms of independence. In The Third International Workshop on Logic, Rationality and Interaction(LORI-III), LNAI 6953, Springer, 2011, pp. 220–232.
Sutherland, David, A model of information. In Proceedings of Ninth National Computer Security Conference, 1986, pp. 175–183.
About this article
Cite this article
Naumov, P. Independence in Information Spaces. Stud Logica 100, 953–973 (2012). https://doi.org/10.1007/s11225-012-9435-6
- Information flow