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. The main result is a complete and decidable logical system that describes interdependencies that may exist on a fixed hypergraph. The properties of interdependencies are defined through a multi-argument relation called independence, which is a generalization of a binary relation also known as nondeducibility.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Armstrong, W.W.: Dependency structures of data base relationships. In: Information Processing, Proc. IFIP Congress, Stockholm, vol. 74, pp. 580–583. North-Holland, Amsterdam (1974)
Garcia-Molina, H., Ullman, J., Widom, J.: Database Systems: The Complete Book, 2nd edn. Prentice-Hall, Englewood Cliffs (2009)
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)
Sutherland, D.: A model of information. In: Proceedings of Ninth National Computer Security Conference, pp. 175–183 (1986)
Halpern, J.Y., O’Neill, K.R.: Secrecy in multiagent systems. ACM Trans. Inf. Syst. Secur. 12(1), 1–47 (2008) (originally appeared as [12])
Miner More, S., Naumov, P.: An independence relation for sets of secrets. Studia Logica 94(1), 73–85 (2010) (originally appeared as [11])
Geiger, D., Paz, A., Pearl, J.: Axioms and algorithms for inferences involving probabilistic independence. Inform. and Comput. 91(1), 128–141 (1991)
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)
Miner More, S., Naumov, P.: On interdependence of secrets in collaboration networks. In: Proceedings of 12th Conference on Theoretical Aspects of Rationality and Knowledge, Stanford University, pp. 208–217 (2009)
Berge, C.: Hypergraphs. North-Holland Mathematical Library, vol. 45. North-Holland Publishing Co., Amsterdam (1989); Combinatorics of finite sets, Translated from the French Version
Miner More, S., 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)
Halpern, J.Y., O’Neill, K.R.: Secrecy in multiagent systems. In: Proceedings of the Fifteenth IEEE Computer Security Foundations Workshop, pp. 32–46 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miner More, S., Naumov, P. (2010). Hypergraphs of Multiparty Secrets. In: Dix, J., Leite, J., Governatori, G., Jamroga, W. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2010. Lecture Notes in Computer Science(), vol 6245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14977-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-14977-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14976-4
Online ISBN: 978-3-642-14977-1
eBook Packages: Computer ScienceComputer Science (R0)