Journal of Computer Security · 2006 · 45 citations · 45 references
ComputingComputer ScienceComputer SystemsComputer SecurityFormal MethodsSecurity ArchitectureData-flow AnalysisDeductive VerificationSecure System DesignSystem SecurityBisimulationBisimulation AnalysisEquivalence Relation RepresentationInterferenceSecure ContextsSecure Information FlowSecurity Property Verification
We study information flow security in the setting of mobile agents. We propose a sufficient condition to security named Persistent_BNDC. A process is Persistent_BNDC when every of its reachable states satisfies a basic Non-Interference property called BNDC. By imposing that security persists during process execution, one is guaranteed that every potential migration is performed in a stable, secure state. We define a suitable bisimulation-based equivalence relation among processes, that allows us to express the new property as a single equivalence check, thus avoiding the universal quantifications over all the reachable states (required by Persistent_BNDC) and over all the possible hostile environments (implicit in the basic Non-Interference property BNDC). We prove that Persistent_BNDC is a sufficient condition to the security of mobile agents by (i) giving a sound and complete characterization of Persistent_BNDC in terms of dynamic contexts, i.e., execution contexts that can non-deterministically change at run-time, abstractly modelling arbitrary migrations; (ii) showing that Persistent_BNDC implies information flow security when agent mobility is explicitly expressed in the calculus.
45
Security Policies and Security Models
Joseph A. Goguen, José Meseguer · 1982 · 2.1K citations
A calculus of mobile processes, II
Robin Milner, Joachim Parrow, David Walker · Information and Computation · 1992 · 1.7K citations · Full text
Three Partition Refinement Algorithms
Robert Paige, Robert E. Tarjan · SIAM Journal on Computing · 1987 · 1.2K citations
Luca Cardelli, Andrew D. Gordon · Theoretical Computer Science · 2000 · 1.1K citations