Information Flow on Directed Acyclic Graphs

  • Michael Donders
  • Sara Miner More
  • Pavel Naumov
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6642)


The paper considers a multi-argument independence relation between messages sent over the edges of a directed acyclic graph. This relation is a generalization of a relation known in information flow as nondeducibility. A logical system that describes the properties of this relation for an arbitrary fixed directed acyclic graph is introduced and proven to be complete and decidable.


Action Relation Information Flow Continuity Condition Direct Acyclic Graph Logical System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Sutherland, D.: A model of information. In: Proceedings of Ninth National Computer Security Conference, pp. 175–183 (1986)Google Scholar
  2. 2.
    Halpern, J.Y., O’Neill, K.R.: Secrecy in multiagent systems. ACM Trans. Inf. Syst. Secur. 12(1), 1–47 (2008)CrossRefGoogle Scholar
  3. 3.
    Miner More, S., Naumov, P.: On interdependence of secrets in collaboration networks. In: Proceedings of 12th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 208–217. Stanford University, Stanford (2009)CrossRefGoogle Scholar
  4. 4.
    Miner More, S., Naumov, P.: Hypergraphs of multiparty secrets. In: Dix, J., Leite, J., Governatori, G., Jamroga, W. (eds.) CLIMA XI. LNCS (LNAI), vol. 6245, pp. 15–32. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  5. 5.
    Armstrong, W.W.: Dependency structures of data base relationships. In: Information Processing 1974, Proc. IFIP Congress, Stockholm, pp. 580–583. North-Holland, Amsterdam (1974)Google Scholar
  6. 6.
    Garcia-Molina, H., Ullman, J., Widom, J.: Database Systems: The Complete Book, 2nd edn. Prentice-Hall, Englewood Cliffs (2009)Google Scholar
  7. 7.
    Beeri, C., Fagin, R., Howard, J.H.: A complete axiomatization for functional and multivalued dependencies in database relations. In: SIGMOD 1977: Proceedings of the 1977 ACM SIGMOD International Conference on Management of Data, pp. 47–61. ACM, New York (1977)CrossRefGoogle Scholar
  8. 8.
    Miner More, S., Naumov, P.: Functional dependence of secrets in a collaboration network. CoRR arXiv:1011.0399v1 [cs.LO] (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Michael Donders
    • 1
  • Sara Miner More
    • 1
  • Pavel Naumov
    • 1
  1. 1.Department of Mathematics and Computer ScienceMcDaniel CollegeWestminsterUSA

Personalised recommendations