2009 | OriginalPaper | Chapter
An Independence Relation for Sets of Secrets
Authors : Sara Miner More, Pavel Naumov
Published in: Logic, Language, Information and Computation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.