A Classification of Time and/or Probability Dependent Security Properties

Electronic Notes in Theoretical Computer Science

Volumn 153, Issue 2 SPEC. ISS., 2006, Pages 177-193

  Lanotte, Ruggero ^a   Maggiolo Schettini, Andrea ^b   Troina, Angelo ^b  

^a UNIVERSITY OF INSUBRIA   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

covert channels; Information flow; non interference; probabilistic timed automata

Indexed keywords

AUTOMATA THEORY; COMPUTER SCIENCE; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION TECHNOLOGY; PROBABILISTIC LOGICS; REAL TIME SYSTEMS;

COVERT CHANNELS; INFORMATION FLOW; NON-INTERFERENCE; PROBABILISTIC TIMED AUTOMATA;

SECURITY OF DATA;

EID: 33646418700     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.10.038     Document Type: Article

References (22)

1. Aldini A., Bravetti M., and Gorrieri R. A Process-algebraic Approach for the Analysis of Probabilistic Non-interference. Journal of Computer Security 12 (2004) 191-245
2. Alur R., Courcoubetis C., and Dill D.L. Verifying Automata Specifications of Probabilistic Real-Time Systems. Real-Time: Theory in Practice. Springer LNCS 600 (1992) 28-44
3. Alur R., and Dill D.L. A Theory of Timed Automata. Theoretical Computer Science 126 (1994) 183-235
4. Baier C., and Hermanns H. Weak Bisimulation for Fully Probabilistic Processes. Proc. of CAV'97. Springer LNCS 1254 (1997) 119-130
5. Barbuti R., and Tesei L. A Decidable Notion of Timed Non-interference. Fundamenta Informaticae 54 (2003) 137-150
6. Beauquier D. On Probabilistic Timed Automata. Theoretical Computer Science 292 (2003) 65-84
7. Cerans K. Decidability of Bisimulation Equivalences for Parallel Timer Processes. Proc. of CAV'92. Springer LNCS 663 (1992) 302-315
8. Di Pierro A., Hankin C., and Wiklicky H. Approximate Non-Interference. Journal of Computer Security 12 (2004) 37-82
9. Evans N., and Schneider S. Analysing Time Dependent Security Properties in CSP Using PVS. Proc. of Symp. on Research in Computer Security. Springer LNCS 1895 (2000) 222-237
10. Focardi R., and Gorrieri R. A Classification of Security Properties. Journal of Computer Security 3 (1995) 5-33
11. Focardi R., Gorrieri R., and Martinelli F. Information Flow Analysis in a Discrete-Time Process Algebra. Proc. of 13th CSFW (2000), IEEE CS Press 170-184
12. Goguen J.A., and Meseguer J. Security Policy and Security Models. Proc. of Symp. on Research in Security and Privacy (1982), IEEE CS Press 11-20
13. Gray III J.W. Toward a Mathematical Foundation for Information Flow Security. Journal of Computer Security 1 (1992) 255-294
14. Halmos P.R. Measure Theory (1950), Springer-Verlag
15. Kwiatkowska M., Norman G., Segala R., and Sproston J. Automatic Verification of Real-time Systems with Discrete Probability Distribution. Theoretical Computer Science 282 (2002) 101-150
16. M. Kwiatkowska, R. Norman, J. Sproston: Symbolic Model Checking of Probabilistic Timed Automata Using Backwards Reachability. Tech. rep. CSR-03-10, University of Birmingham, 2003
17. Lanotte R., Maggiolo-Schettini A., and Troina A. Information Flow Analysis for Probabilistic Timed Automata. Proc. of FAST'04. Toulouse, France. Springer IFIP 173 (August 2004)
18. Lanotte R., Maggiolo-Schettini A., and Troina A. Weak Bisimulation for Probabilistic Timed Automata. http://www.di.unipi.it/~lanotte/pub.html
19. Laroussinie F., Larsen K.G., and Weise C. From Timed Automata to Logic - and Back. Proc. of MFCS. Springer LNCS 969 (1995) 27-41
20. McCullough D. Noninterference and the Composability of Security Properties. Proc. of Symp. on Research in Security and Privacy (1988), IEEE CS Press 177-186
21. Millen J.K. Hookup Security for Synchronous Machines. Proc. of CSFW'90 (1990), IEEE CS Press 84-90
22. Milner R. Communication and Concurrency (1989), Prentice Hall