George VOUTSADAKIS SECRECY LOGIC : PROTOALGEBRAIC S - SECRECY LOGICS
نویسندگان
چکیده
A b s t r a c t. In recent work the notion of a secrecy logicS over a given deductive system S was introduced. Secrecy logics capture the essential features of structures that are used in performing secrecy-preserving reasoning in practical applications. More precisely, they model knowledge bases that consist of information, part of which is considered known to the user and part of which is to remain secret from the user. S-secrecy structures serve as the models of secrecy logics. Several of the universal algebraic and model theoretic properties of the class of S-secrecy structures of a given S-secrecy logic have already been studied. In this paper, our goal is to show how techniques from the theory of abstract algebraic logic may be used to analyze the structure of a secrecy logic and draw conclusions about its algebraic character. In particular, the notion of a protoalgebraic S-secrecy logic is introduced and several characterizing properties are provided. The relationship between protoalgebraic S-secrecy logics and the protoalgebraicity of their underlying deductive systems is also investigated.
منابع مشابه
Categorical Abstract Algebraic Logic: More on Protoalgebraicity
Protoalgebraic logics are characterized by the monotonicity of the Leibniz operator on their theory lattices and are at the lower end of the Leibniz hierarchy of abstract algebraic logic. They have been shown to be the most primitive among those logics with a strong enough algebraic character to be amenable to algebraic study techniques. Protoalgebraic π -institutions were introduced recently a...
متن کاملSecrecy logic: S -secrecy structures
Let S = 〈L, S〉 be a deductive system. An S -secrecy logic is a quadruple K = 〈FmL(V ),K,B, S〉 , where FmL(V ) is the algebra of L-formulas, K,B are S -theories, with B ⊆ K and S ⊆ K such that S ∩ B = ∅ . K corresponds to information deducible from a knowledge base, B to information deducible from the publicly accessible (or browsable) part of the knowledge base and S is a secret set, a set of s...
متن کاملSecrecy-Preserving Reasoning Over Entailment Systems: Theory and Applications
Privacy, copyright, security and other concerns make it essential for many distributed web applications to support selective sharing of information while, at the same time, protecting sensitive knowledge. Secrecypreserving reasoning refers to the answering of queries against a knowledge base involving inference that uses sensitive knowledge without revealing it. We present a general framework f...
متن کاملWeakly Algebraizable π-Institutions
Weakly algebraizable sentential logics were introduced by Czelakowski and Jansana and constitute a class in the abstract algebraic hierarchy of logics lying between the protoalgebraic logics of Blok and Pigozzi and the algebraizable logics, in the sense of Czelakowski’s and Hermann’s generalization of the original notion introduced by Blok and Pigozzi. Very recently protoalgebraic π-institution...
متن کاملSecrecy-Preserving Reasoning using Secrecy Envelopes
Inmany applications of networked information systems, the need to share information often has to be balanced against the need to protect secret information from unintended disclosure, e.g., due to copyright, privacy, security, or commercial considerations. We study the problem of secrecy-preserving reasoning, that is, answering queries using secret information, whenever it is possible to do so,...
متن کامل