Verification of initial-state opacity in security applications of discrete event systems

Information Sciences

Volumn 246, Issue , 2013, Pages 115-132

  Saboori, Anooshiravan ^a   Hadjicostis, Christoforos N ^b,c  

^a MICROSOFT   (United States)

^b University of Illinois at Urbana Champaign   (United States)

^c UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

Discrete event system; Formal methods in security analysis; Initial state estimation; Initial state estimator; Tracking in sensor network

Indexed keywords

FORMAL METHODS IN SECURITY; INITIAL STATE; NONDETERMINISTIC FINITE AUTOMATON; PARTIAL OBSERVATION; PSPACE-COMPLETE PROBLEMS; SECURITY APPLICATION; SECURITY REQUIREMENTS; VERIFICATION METHOD;

AUTOMATA THEORY; DISCRETE EVENT SIMULATION; SENSOR NETWORKS; STATE ESTIMATION;

OPACITY;

EID: 84879786049     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2013.05.033     Document Type: Article

References (34)

1. E. Badouel, M. Bednarczyk, A. Borzyszkowski, B. Caillaud, and P. Darondeau Concurrent secrets Discrete Event Dynamic Systems 17 4 2007 425 446
2. D. Bell, L. LaPadula, Secure Computer Systems: Mathematical Foundations, Tech. Rep. MTR-2547, MITRE Corporation, Bedford, MA, March 1973.
3. J. Bryans, M. Koutny, L. Mazare, and P. Ryan Opacity generalised to transition systems International Journal of Information Security 7 6 2008 421 435
4. J. Bryans, M. Koutny, and P. Ryan Modelling dynamic opacity using Petri nets with silent actions Formal Aspects in Security and Trust vol. 173 2005 Springer 159 172
5. J.W. Bryans, M. Koutny, and P.Y.A. Ryan Modelling opacity using Petri nets Electronic Notes in Theoretical Computer Science 121 2005 101 115
6. D. Bustan, and O. Grumberg Applicability of fair simulation Information and Computation 194 2004 1 18
7. P.E. Caines, R. Greiner, and S. Wang Classical and logic-based dynamic observers for finite automata IMA Journal of Mathematical Control and Information 8 1 1991 45 80
8. C. Cassandras, and S. Lafortune Introduction to Discrete Event Systems 2008 Kluwer Academic Publishers
9. F. Cassez, J. Mullins, and O. Roux Synthesis of non-interferent distributed systems Computer Network Security 1 2007 159 170
10. D. Chaum The dining cryptographers problem: unconditional sender and recipient untraceability Journal of Cryptology 1 1 1988 65 75
11. D.L. Chaum Untraceable electronic mail, return addresses, and digital pseudonyms Communications of the ACM 24 2 1981 84 90
12. A.J.H. David, L. Dill, H. Wong-Toi, Checking for language inclusion using simulation preorders, in: Proceedings of the 3rd International Workshop on Computer Aided Verification, vol. 575, 1992, pp. 255-265.
13. J. Dubreil, P. Darondeau, H. Marchand, Opacity enforcing control synthesis, in: Proc. of the 9th International Workshop on Discrete Event Systems, 2008, pp. 28-35.
14. R. Focardi, R. Gorrieri, A taxonomy of trace-based security properties for CCS, in: Proc. of the 7th Workshop on Computer Security Foundations, 1994, pp. 126-136.
15. M.R. Garey, and D.S. Johnson Computers and Intractability - A Guide to the Theory of NP-Completeness 1979 Freeman
16. N. Hadj-Alouane, S. Lafrance, L. Feng, J. Mullins, and M. Yeddes On the verification of intransitive noninterference in multilevel security IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) 35 5 2005 948 958
17. J.Y. Kao, A.J. Malton, N. Rampersad, J. Shallit, On NFAs Where All States are Final, Initial, or Both, CoRR abs/0808.2417. < http://arxiv.org/abs/ 0808.2417 >.
18. S.C. Kleene Representation of events in nerve nets and finite automata C.E. Shannon, M. McCarthy, Automata Studies vol. 34 1956 Princeton University Press 3 41
19. D. Lee, and M. Yannakakis Testing finite state machines: state identification and verification IEEE Transactions on Computers 43 3 1994 306 320
20. D. Lee, and M. Yannakakis Principles and methods of testing finite state machines - a survey Proceedings of the IEEE 84 8 1996 1090 1123
21. F. Lin, and W. Wonham On observability of discrete event systems Information Sciences 44 3 1988 173 198
22. F. Lin, and W.M. Wonham Decentralized supervisory control of discrete-event systems Information Sciences 44 3 1988 199 224
23. K. Naik Efficient computation of unique input/output sequences in finite-state machines IEEE/ACM Transactions on Networking 5 4 1997 585 599
24. P.J. Ramadge, and W.M. Wonham Supervisory control of a class of discrete event processes SIAM Journal on Control and Optimization 25 1987 206 230
25. M.K. Reiter, and A.D. Rubin Crowds: anonymity for web transactions ACM Transactions on Information and System Security 1 1 1998 66 92
26. A. Saboori, and C.N. Hadjicostis Verification of K-step opacity, analysis of its complexity IEEE Transactions on Automation Science and Engineering 8 3 2011 549 559
27. A. Saboori, C.N. Hadjicostis, Notions of security and opacity in discrete event systems, in: Proc. of the 46th IEEE Conference on Decision and Control, 2007, pp. 5056-5061.
28. A. Saboori, C.N. Hadjicostis, Verification of initial-state opacity in security applications of DES, in: Proc. of the 9th International Workshop on Discrete Event Systems, 2008, pp. 328-333.
29. A. Saboori, C.N. Hadjicostis, Opacity verification in stochastic discrete event systems, in: Proc. of the 49th IEEE Conference on Decision and Control, 2010.
30. A. Saboori, C.N. Hadjicostis, Probabilistic opacity for stochastic discrete event systems, in: Proc. of the 19th International Symposium on Mathematical Theory of Networks and Systems, 2010.
31. A. Saboori, C.N. Hadjicostis, Reduced-complexity verification for initial-state opacity in modular discrete event systems, in: Proc. of the 10th International Workshop on Discrete Event Systems, 2010.
32. S. Schneider, A. Sidiropoulos, CSP and anonymity, in: Proc. of the 4th European Symposium on Research in Computer Security, 1996, pp. 198-218.
33. W.M. Wonham, "Supervisory Control of Discrete Event Systems," Systems and Control Group, Department of Electrical and Computer Engineering, University of Toronto, 2009. < www.utoronto.ca/DES >.
34. S. Zhong, Z. Yang, and T. Chen k-Anonymous data collection Information Sciences 179 17 2009 2948 2963