Communicating sequential processes
Communicating sequential processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Trust in Cyberspace
Protection in Programming-Language Translations
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A Compositional Rule for Hardware Design Refinement
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
MOCHA: Modularity in Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
A General Theory of Composition for Trace Sets Closed under Selective Interleaving Functions
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
A general theory of security properties
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Preserving Information Flow Properties under Refinement
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
Secure Information Flow by Self-Composition
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
A theorem proving approach to analysis of secure information flow
SPC'05 Proceedings of the Second international conference on Security in Pervasive Computing
Secure information flow as a safety problem
SAS'05 Proceedings of the 12th international conference on Static Analysis
Language-based information-flow security
IEEE Journal on Selected Areas in Communications
What You Lose is What You Leak: Information Leakage in Declassification Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated Analysis of Java Methods for Confidentiality
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
On Refinement-Closed Security Properties and Nondeterministic Compositions
Electronic Notes in Theoretical Computer Science (ENTCS)
Dynamic Observers for the Synthesis of Opaque Systems
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Automatic Testing of Access Control for Security Properties
TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Sums and Lovers: Case Studies in Security, Compositionality and Refinement
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Verification and synthesis for secrecy in discrete-event systems
ACC'09 Proceedings of the 2009 conference on American Control Conference
Model checking on trees with path equivalences
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Developing security protocols by refinement
Proceedings of the 17th ACM conference on Computer and communications security
Process Algebra Contexts and Security Properties
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Unifying theories of confidentiality
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
Opacity of discrete event systems and its applications
Automatica (Journal of IFAC)
Collaborative Planning with Confidentiality
Journal of Automated Reasoning
Conformance verification of privacy policies
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Refinement-based design of a group-centric secure information sharing model
Proceedings of the second ACM conference on Data and Application Security and Privacy
Secure information flow by self-composition
Mathematical Structures in Computer Science - Programming Language Interference and Dependence
Modelling declassification policies using abstract domain completeness
Mathematical Structures in Computer Science - Programming Language Interference and Dependence
Synthesis of opaque systems with static and dynamic masks
Formal Methods in System Design
A semantic hierarchy for erasure policies
ICISS'11 Proceedings of the 7th international conference on Information Systems Security
Model checking information flow in reactive systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Information flow in systems with schedulers, Part II: Refinement
Theoretical Computer Science
Comparative analysis of related notions of opacity in centralized and coordinated architectures
Discrete Event Dynamic Systems
| Hi-index | 0.00 |
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