Advertisement

The Functional Dependence Relation on Hypergraphs of Secrets

  • Sara Miner More
  • Pavel Naumov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6814)

Abstract

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.

Keywords

Functional Dependence Collaboration Network Independence Relation Complete Axiomatization Multivalued Dependency 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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, 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.
    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
  9. 9.
    Shamir, A.: How to share a secret. Communications of the Association for Computing Machinery 22(11), 612–613 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    More, S.M., Naumov, P.: An independence relation for sets of secrets. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds.) WoLLIC 2009. LNCS(LNAI), vol. 5514, pp. 296–304. Springer, Heidelberg (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

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

Personalised recommendations