An Independence Relation for Sets of Secrets

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.

• Type: Conference
• Year: 2009
• Where: WOLLIC
• Authors: Sara Miner More, Pavel Naumov
• Keywords: Applied Computing, Formal Logical System, Independence Relation, Logically Independent, WOLLIC 2009