2009 | OriginalPaper | Buchkapitel
An Independence Relation for Sets of Secrets
verfasst von : Sara Miner More, Pavel Naumov
Erschienen in: Logic, Language, Information and Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.