Logic of secrets in collaboration networks

The article proposes Logic of Secrets in Collaboration Networks, a formal logical system for reasoning about a set of secrets established over a fixed configuration of communication channels. The system's key feature, a multi-channel relation called independence, is a generalization of a two-channel relation known in the literature as nondeducibility. The main result is the completeness of the proposed system with respect to a semantics of secrets.

► We propose a formal logical system for reasoning about secrets sent over networks. ► We consider Sutherland's nondeducibility relation. ► We prove the soundness and completeness of our system.