Opacity generalised to transition systems

International Journal of Information Security

Volumn 7, Issue 6, 2008, Pages 421-435

  Bryans, Jeremy W ^a   Koutny, Maciej ^a   Mazaré, Laurent ^b   Ryan, Peter Y A ^a  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

^b VERIMAG   (France)

Author keywords

Abstract interpretation; Anonymity; Labelled transition systems; Non deducibility; Observable behaviour; Opacity; Petrinets

Indexed keywords

DATA STRUCTURES; GRAPH THEORY; MARINE BIOLOGY; OPACITY; PETRI NETS; VOTING MACHINES;

ABSTRACT INTERPRETATION; ANONYMITY; LABELLED TRANSITION SYSTEMS; NON-DEDUCIBILITY; OBSERVABLE BEHAVIOUR;

OPTICAL PROPERTIES;

EID: 54549090072     PISSN: 16155262     EISSN: 16155270     Source Type: Journal    
DOI: 10.1007/s10207-008-0058-x     Document Type: Article

References (34)

1. Abadi, M., Cortier, V.: Deciding knowledge in security protocols under equational theories. In: 31th International Colloquium on Automata, Languages and Programming (ICALP'04) (2004)
2. Abadi, M., Rogaway, P.: Reconciling two views of cryptography (the computational soundness of formal encryption). In: IFIP International Conference on Theoretical Computer Science (IFIP TCS2000) (2000)
3. Badouel, E., Bednarczyk, M., Borzyszkowski, A., Caillaud, B., Darondeau, P.: Concurrent secrets. In: Lafortune, S., Lin, F., Tilbury, D. (eds.) 8th Workshop on Discrete Event Systems, WODES'06. Ann Arbor, July 2006 (2006)
4. Bieber, P.: A Logic of Communication in a Hostile Environment. In: Computer Security Foundations Workshop, June 1990, vol. 3, pp. 14-22. IEEE Computer Society Press, New York (1990)
5. Bryans, J.W., Koutny, M., Ryan, P.Y.A.: Modelling dynamic opacity using Petri nets with silent actions. In: Proceedings of IFIP TC1 WG1.7 Workshop on Formal Aspects of Security and Trust, pp. 159-172. Kluwer, Dordrecht (2004)
6. Bryans, J.W., Koutny, M., Ryan, P.Y.A.: Modelling opacity using Petri nets. Electron. Notes Theor. Comput. Sci. 121, 101-115 (2005)
7. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: 4th ACM Symposium on Principles of Programming Languages, pp. 238-252. ACM Press, New York (1977)
8. Cousot P., Cousot R.: Abstract interpretation frameworks. J. Log. Comput. 2(4), 511-547 (1992)
9. Dolev D., Yao A.C.: On the security of public key protocols. IEEE Trans. Inf. Theory 29(2), 198-208 (1983)
10. Gruska, D.P.: Opacity based security. In: 17th International Conference Computer Theory and Applications, pp. 122-128, Alexandria, Egypt (2007)
11. Gruska, D.P.: Andrea Maggiolo-Schettini, and Paolo Milazzo. Security in communicating hierarchical transaction-based timed automata. In: Concurrency, Specification and Programming, CS&P'07, pp. 267-278, Warsaw University. ISBN 978-83-88374-28-9 (2007)
12. Fagin R., Halpern J.Y., Moses Y., Vardi M.Y.: Reasoning about Knowledge. MIT press, Cambridge (1995)
13. Finkel A.: The minimal coverability graph for Petri nets. Lect. Notes Comput. Sci. 674, 210-243 (1993)
14. Focardi, R., Gorrieri, R.: A taxonomy of trace-based security properties for CCS. In: Proceedings of the Computer Security Foundations Workshop VII (CSFW '94), pp. 126-137. IEEE, New York (1994)
15. Focardi, R., Gorrieri, R.: Classification of Security Properties: Information flow. In: Foundations of Security Analysis and Design. LNCS, vol. 2171, pp. 331-396 (2000)
16. Furukawa, J.: Efficient, verifiable shuffle decryption and its requirement of unlinkability. In: Bao, F., Deng, R.H., Zhou, J. (eds.) Public Key Cryptography. Lecture Notes in Computer Science, vol. 2947, pp. 319-332. Springer, Heidelberg (2004)
17. Glasgow J., Macewen G., Panangaden P.: A Logic for Reasoning about Security. ACM Trans. Comput. Syst. 10(3), 226-264 (1992)
18. Gruska D.P.: Observation based system security. Fundam. Inform. 79 (3-4), 335-346 (2007)
19. Halpern, J., O'Neill, K.: Secrecy in multiagent systems. In: 15th IEEE Computer Security Foundations Workshop, New York, pp. 32-46 (2003)
20. Jacquemard, F., Rusinowitch, M., Vigneron, L.: Compiling and verifying security protocols. In: Logic Programming and Automated Reasoning, pp. 131-160 (2000)
21. Jancar, P., Esparza, J.: Deciding finiteness of Petri nets up to bisimulation. In: Automata, Languages and Programming, pp. 478-489 (1996)
22. Mazaré, L.: Using unification for opacity properties. In: Proceedings of the Workshop on Issues in the Theory of Security (WITS'04) (2004)
23. Moser, L.: A Logic of Knowledge and Belief for Reasoning about Security. In: Computer Security Foundations Workshop, June 1989, vol. 2, pp. 57-63. IEEE Computer Society Press, New York (1989)
24. Nabialek, W., Niewiadomski, A., Penczek, W., Polórla, A., Szreter, M.: Verics 2004: A Model Checker of Real-Time and Multi-agent Systems. In: Concurrency, Specification and Programming, pp. 88-99 (2004)
25. O'Halloran, C.: A Calculus of Information Flow. In: ESORICS, pp. 147-159 (1990)
26. Periorellis, P., Townson, C., English, P.: Structural concepts for trust, contract and security management for a virtual chemical engineering organisation. In: PST 2004, 2004. http://dev.hil.unb.ca/ Texts/PST/
27. Peterson, J.L.: Petri Net Theory and The Modeling of Systems. Prentice Hall, Inc., Englewood Cliffs (1981)
28. Raimondi, F., Lomuscio, A.: Verification of Multiagent Systems via ordered binary decision diagrams: An algorithm and its implementation. Technical Report TR-04-01, King's College, London, January 2004
29. Reisig, W., Rozenberg, G. (eds.): Lectures on Petri nets. LNCS 1491 & 1492 (1998)
30. Schneider, S., Sidiropoulos, A.: CSP and anonymity. In: ESORICS, pp. 198-218 (1996)
31. Time Petri Net Analyzer. http://www.laas.fr/tina/, (2004)
32. van der Hoek, W., Lomuscio, A.: A logic for ignorance. Electron. Notes Theor. Comput. Sci. (2004)
33. van Otterloo, S., van der Hoek, W., Woolridge, M.: Model Checking a Knowledge Exchange Scenario. In: IJCAI (2003)
34. Ryan, P.Y.A.: Mathematical models of computer security. In: Foundations of Security Analysis and Design. LNCS, vol. 2171 (2000)