An independence relation for sets of secrets

Studia Logica 94 (1):73 - 85 (2010)
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.
Keywords information flow  nondeducibility  formal system
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,826
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Citations of this work BETA
Jeffrey Kane & Pavel Naumov (2014). Symmetry in Information Flow. Annals of Pure and Applied Logic 165 (1):253-265.
Similar books and articles
Analytics

Monthly downloads

Added to index

2010-02-01

Total downloads

17 ( #101,887 of 1,100,145 )

Recent downloads (6 months)

4 ( #90,386 of 1,100,145 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.