The Functional Dependence Relation on Hypergraphs of Secrets
The paper considers interdependencies between secrets in a multiparty system. Each secret is assumed to be known only to a certain fixed set of parties. These sets can be viewed as edges of a hypergraph whose vertices are the parties of the system. In previous work, the authors investigated properties of interdependencies that are expressible through a multi-argument relation called independence, which is a generalization of a binary relation also known as nondeducibility. This work studies properties expressible through functional dependence. The main result is a complete and decidable logical system that describes interdependencies on a fixed hypergraph.
KeywordsFunctional Dependence Collaboration Network Independence Relation Complete Axiomatization Multivalued Dependency
Unable to display preview. Download preview PDF.
- 1.Sutherland, D.: A model of information. In: Proceedings of Ninth National Computer Security Conference, pp. 175–183 (1986)Google Scholar
- 5.Armstrong, W.W.: Dependency structures of data base relationships. In: Information Processing, Proc. IFIP Congress, Stockholm, pp. 580–583. North-Holland, Amsterdam (1974)Google Scholar
- 6.Garcia-Molina, H., Ullman, J., Widom, J.: Database Systems: The Complete Book, 2nd edn. Prentice-Hall, Englewood Cliffs (2009)Google Scholar
- 8.Kelvey, R., Miner More, S., Naumov, P., Sapp, B.: Independence and functional dependence relations on secrets. In: Proceedings of 12th International Conference on the Principles of Knowledge Representation and Reasoning, Toronto, pp. 528–533. AAAI, Menlo Park (2010)Google Scholar