Date of this Version
Rajeev Alur, Pavol Cerný, and Stephan A. Zdancewic, "Preserving Secrecy Under Refinement", Lecture Notes in Computer Science: Automata, Languages and Programming 4052, 107-118. June 2006. http://dx.doi.org/10.1007/11787006_10
We propose a general framework of secrecy and preservation of secrecy for labeled transition systems. Our definition of secrecy is parameterized by the distinguishing power of the observer, the properties to be kept secret, and the executions of interest, and captures a multitude of definitions in the literature. We define a notion of secrecy preserving refinement between systems by strengthening the classical trace-based refinement so that the implementation leaks a secret only when the specification also leaks it. We show that secrecy is in general not definable in µ-calculus, and thus not expressible in specification logics supported by standard model-checkers. However, we develop a simulation-based proof technique for establishing secrecy preserving refinement. This result shows how existing refinement checkers can be used to show correctness of an implementation with respect to a specification.
CPS Formal Methods
Lecture Notes in Computer Science: Automata, Languages and Programming
The original publication is available at www.springerlink.com
Date Posted: 04 December 2006
This document has been peer reviewed.