Communications of the ACM
A complete axiomatization for functional and multivalued dependencies in database relations
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
ACM Transactions on Information and System Security (TISSEC)
Database Systems: The Complete Book
Database Systems: The Complete Book
On interdependence of secrets in collaboration networks
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge
An Independence Relation for Sets of Secrets
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Hypergraphs of multiparty secrets
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
A ternary knowledge relation on secrets
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Hypergraphs of multiparty secrets
Annals of Mathematics and Artificial Intelligence
Fault tolerance in belief formation networks
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
| Hi-index | 0.00 |
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.