CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Information transmission in computational systems
SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
Mechanizing Proof: Computing, Risk, and Trust
Mechanizing Proof: Computing, Risk, and Trust
Science of Computer Programming
ACM Transactions on Information and System Security (TISSEC)
Language-based information-flow security
IEEE Journal on Selected Areas in Communications
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
Information flow on directed acyclic graphs
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
The functional dependence relation on hypergraphs of secrets
CLIMA'11 Proceedings of the 12th international conference on Computational logic in multi-agent systems
Game semantics for the Geiger-Paz-pearl axioms of independence
LORI'11 Proceedings of the Third international conference on Logic, rationality, and interaction
Hypergraphs of multiparty secrets
Annals of Mathematics and Artificial Intelligence
Independence in Information Spaces
Studia Logica
| Hi-index | 0.00 |
The paper proposes Logic of Secrets in Collaboration Networks, a formal logical system for reasoning about a set of secrets established over a fixed configuration of communication channels. The system's key feature, a multi-channel relation called independence, is a generalization of a two-channel relation known in the literature as nondeducibility. The main result is the completeness of the proposed system with respect to a semantics of secrets.