Secrecy Logic: Protoalgebraic S-Secrecy Logics

• Authors: George Voultsadakis
• Languages of publication: EN

Abstracts

EN

In recent work the notion of a secrecy logic S 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 alge-braic 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.

• Publisher: Uniwersytet Jagielloński
• Journal: Reports on Mathematical Logic
• Year: 2012
• Issue: 47
• Pages: 3–28

Dates

online

2012-08-23

Contributors

author

George Voultsadakis

• Department of Computer Science, Iowa State University, Ames, IA 50011, U.S.A.
• School of Mathematics and Computer Science, Lake Superior State University, Sault Sainte Marie, MI 49783, U.S.A.

Identifiers

DOI

10.4467/20842589RM.12.001.0682