An Independence Relation for Sets of Secrets

Authors:
Sara Miner More;Pavel Naumov
Affiliations:
Department of Mathematics and Computer Science, McDaniel College, Westminster, USA 21157;Department of Mathematics and Computer Science, McDaniel College, Westminster, USA 21157
Venue:
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Year:
2009

Citing 6
Cited 4

Secrecy in Multiagent Systems

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
A logic for information flow analysis with an application to forward slicing of simple imperative programs

Science of Computer Programming
Secrecy in Multiagent Systems

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
The functional dependence relation on hypergraphs of secrets

CLIMA'11 Proceedings of the 12th international conference on Computational logic in multi-agent systems
Hypergraphs of multiparty secrets

Annals of Mathematics and Artificial Intelligence
Independence in Information Spaces

Studia Logica

Quantified Score

Hi-index	0.00

Visualization

Abstract

A relation between two secrets, known in the literature as nondeducibility , was originally introduced by Sutherland. We extend it to a relation between sets of secrets that we call independence . This paper proposes a formal logical system for the independence relation, proves the completeness of the system with respect to a semantics of secrets, and shows that all axioms of the system are logically independent.