Opacity Generalised to Transition Systems

Recently, opacity has proved a promising technique for describing security properties. Much of the work has been couched in terms of Petri nets. Here, we extend the notion of opacity to the model of labelled transition systems and generalise opacity in order to better represent concepts from the literature on information flow. In particular, we establish links between opacity and the information flow concepts of anonymity and non-inference. We also investigate ways of verifying opacity when working with Petri nets. Our work is illustrated by an example modelling requirements upon a simple voting system.

[1]  Philip English,et al.  Structural Concepts for Trust, Contract and Security Management for a Virtual Chemical Engineering Organisation , 2004, PST.

[2]  Maciej Koutny,et al.  Modelling Opacity Using Petri Nets , 2005, WISP@ICATPN.

[3]  Alessio Lomuscio,et al.  Verification of multiagent systems via ordered binary decision diagrams: an algorithm and its implementation , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[4]  Martín Abadi,et al.  Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)* , 2000, Journal of Cryptology.

[5]  Martín Abadi,et al.  Deciding knowledge in security protocols under equational theories , 2006, Theor. Comput. Sci..

[6]  Michael Wooldridge,et al.  Model Checking Knowledge and Time , 2002, SPIN.

[7]  Laurent Mazare,et al.  Using Unification For Opacity Properties , 2004 .

[8]  Pierre Bieber,et al.  A logic of communication in hostile environment , 1990, [1990] Proceedings. The Computer Security Foundations Workshop III.

[9]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[10]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[11]  Martín Abadi,et al.  Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption) , 2007, Journal of Cryptology.

[12]  Patrick Cousot,et al.  Abstract Interpretation Frameworks , 1992, J. Log. Comput..

[13]  Steve A. Schneider,et al.  CSP and Anonymity , 1996, ESORICS.

[14]  Roberto Gorrieri,et al.  A taxonomy of trace-based security properties for CCS , 1994, Proceedings The Computer Security Foundations Workshop VII.

[15]  Colin O'Halloran,et al.  A Calculus of Information Flow , 1990, ESORICS.

[16]  Wojciech Penczek,et al.  VerICS 2004: A Model Checker for Real Time and Multi-agent Systems ? , 2004 .

[17]  Louise E. Moser,et al.  A logic of knowledge and belief for reasoning about computer security , 1989, Proceedings of the Computer Security Foundations Workshop II,.

[18]  Glenn H. MacEwen,et al.  A logic for reasoning about security , 1992, TOCS.

[19]  Peter Y. A. Ryan,et al.  Mathematical Models of Computer Security , 2000, FOSAD.

[20]  Michaël Rusinowitch,et al.  Compiling and Verifying Security Protocols , 2000, LPAR.

[21]  Maciej Koutny,et al.  Modelling Dynamic Opacity Using Petri Nets with Silent Actions , 2004, Formal Aspects in Security and Trust.

[22]  Yassine Lakhnech,et al.  Probabilistic Opacity for a Passive Adversary and its Application to Chaum's Voting Scheme , 2005, IACR Cryptol. ePrint Arch..

[23]  Alain Finkel,et al.  The Minimal Coverability Graph for Petri Nets , 1991, Applications and Theory of Petri Nets.

[24]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[25]  Michael Wooldridge,et al.  MODEL CHECKING A KNOWLEDGE EXCHANGE SCENARIO , 2004, Appl. Artif. Intell..

[26]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[27]  Wolfgang Reisig,et al.  Lectures on Petri Nets II: Applications , 1996, Lecture Notes in Computer Science.

[28]  Joseph Y. Halpern,et al.  Anonymity and information hiding in multiagent systems , 2003, 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings..