Opacity generalised to transition systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3866 LNCS, Issue , 2006, Pages 81-95

  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

Anonymity; Labelled transition systems; Non deducibility; Non inference; Observable behaviour; Opacity; Petri nets

Indexed keywords

DATA TRANSFER; INFORMATION DISSEMINATION; MATHEMATICAL MODELS; PETRI NETS; SECURITY OF DATA;

INFORMATION FLOW; SECURITY PROPERTIES; TRANSITION SYSTEMS; VOTING SYSTEM;

OPACITY;

EID: 33745658881     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11679219_7     Document Type: Conference Paper

References (26)

1. M.Abadi and V.Cortier: Deciding Knowledge in Security Protocols under Equational Theories. In: ICALP (2004)
2. M.Abadi and P.Rogaway: Reconciling two Views of Cryptography (The computational soundness of formal encryption). In: IFIP TCS2000 (2000)
3. P.Bieber: A Logic of Communication in a Hostile Environment. In: CSFW (1990)
4. J.W.Bryans, M.Koutny and P.Y.A.Ryan: Modelling Opacity using Petri Nets. ENTCS 121 (2005)
5. J.W.Bryans, M.Koutny and P.Y.A.Ryan: Modelling Dynamic Opacity using Petri Nets with Silent Actions. In: FAST (2004)
6. J.W.Bryans, M.Koutny, L.Mazaré and P.Y.A.Ryan: Opacity Generalised to Transition Systems. CS-TR 868, University of Newcastle (2004) http://www.cs.ncl.ac.uk/research/pubs/trs/abstract.php?number=868
7. D.Dolev and A.C.Yao: On the Security of Public Key Protocols. IEEE Transactions on Information Theory 29 (1983)
8. R.Fagin, J.Y.Halpern, Y.Moses and M.Y.Vardi: Reasoning about Knowledge. MIT press (1995)
9. A.Finkel: The Minimal Coverability Graph for Petri Nets. LNCS 674 (1993)
10. R.Focardi and R.Gorrieri: A Taxonomy of Trace-Based Security Properties for CCS. In: CSFW (1994)
11. R.Focardi and R.Gorrieri: Classification of Security Properties: Information flow. LNCS 2171 (2000)
12. J.Glasgow, G.Macewen and P.Panangaden: A Logic for Reasoning about Security. ACM Transactions on Computer Systems 10 (1992)
13. Y. Lakhnech and L. Mazaré: Probabilistic Opacity for a Passive Adversary and its Application to Chaum's Voting Scheme. Verimag Technical Report 2005-04, (2005).
14. J.Y.Halpern and K.O'Neill: Anonymity and Information Hiding in Multiagent Systems. In: CSFW (2003)
15. F.Jacquernard, M.Rusinowitch and L.Vigneron: Compiling and Verifying Security Protocols. In: LPAR (2000)
16. L.Mazaré: Using Unification For Opacity Properties. In: WITS (2004)
17. L.Moser: A Logic of Knowledge and Belief for Reasoning about Security. In: CSFW (1989)
18. W.Nabialek, A.Niewiadomski, W.Penczek, A.Polórla and M.Szreter. Verics 2004: A Model Checker of Real-Tirne and Multi-agent Systems. In: CS&P (2004)
19. C.O'Halloran: A Calculus of Information Flow. In: ESORICS (1990)
20. F.Raimondi and A.Lomuscio: Verification of Multiagent Systems via Ordered Binary Decision Diagrams: an Algorithm and its Implementation. TR-04-01, King's College (2004)
21. W.Reisig and G.Rozenberg (Eds.): Lectures on Petri Nets. LNCS 1491 & 1492 (1998)
22. P.Y.A.Ryan: Mathematical Models of Computer Security. LNCS 2171 (2000)
23. S.Schneider and A.Sidiropoulos: CSP and Anonymity. In: ESORICS (1996)
24. S.van Otterloo, W.van der Hoek and M.Woolridge: Model Checking a Knowledge Exchange Scenario. In: IJCAI (2003)
25. Time Petri Net Analyzer. http://www.laas.fr/tina/ (2004)
26. W.van der Hoek and A.Lomnscio: A Logic for Ignorance. ENTCS 85 (2004)