Confidentiality levels and deliberate/indeliberate protocol attacks

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

Volumn 2845, Issue , 2003, Pages 104-119

  Bella, Giampaolo ^a,b   Bistarelli, Stefano ^c  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF CATANIA   (Italy)

^c Istituto di informatica e telematica del Consiglio nazionale delle ricerche   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FORMAL DEFINITION; NEEDHAM SCHROEDER PROTOCOL; PROTOCOL ATTACKS; SECURITY LEVEL;

NETWORK SECURITY; ARTIFICIAL INTELLIGENCE;

EID: 35048872309     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (19)

1. G. Bella and S. Bistarelli. Protocol Analysis using Soft Constraints. Invited talk at S.R.I. Security group, Menlo Park, USA, February 2001.
2. G. Bella and S. Bistarelli. Soft Constraints for Security Protocol Analysis: Confidentiality. In I. V. Ramakrishnan, editor, Proc. of the 3rd International Symposium on Practical Aspects of Declarative Languages (PADL'01), volume 1990 of LNCS, pages 108-122. Springer-Verlag, 2001.
3. S. Bistarelli, T. Fruewirth, M. Marte, and F. Rossi. Soft Constraint Propagation and Solving in CHR. In Proc. ACM Symposium on Applied Computing (SAC), Madrid, Spain. ACM, mar 2002.
4. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Solving and Optimization. Journal of the ACM, 44(2):201-236, Mar 1997.
5. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Logic Programming: Syntax and Semantics. ACM Transactions on Programming Languages and System (TOPLAS), 23:1-29, jan 2001.
6. Iliano Cervesato, N. A. Durgin, Patrick Lincoln, John C. Mitchell, and Andre Scedrov. A Meta-Notation for Protocol Analysis. In Proc. CSFW, pages 55-69, 1999.
7. D.E. Denning. A Lattice Model of Secure Information Flow. Comm. of ACM, 19(5):236-242, 1976.
8. D. Dubois, H. Fargier, and H. Prade. The Calculus of Fuzzy Restrictions as a Basis for Flexible Constraint Satisfaction. In Proc. of IEEE International Conference on Fuzzy Systems, pages 1131-1136. IEEE Press, 1993.
9. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Undecidability of Bounded Security Protocols. In N. Heintze and E. Clarke, editors, Proc. FMSP'99, 1999.
10. E. C. Freuder and R. J. Wallace. Partial Constraint Satisfaction. AI Journal, 1992.
11. Evelyn Gray. American national standard t1.523-2001, telecom glossary 2000. published on the Web at http://www.its.bldrdoc.gov/projects/ telecomglossary2000, 2001.
12. G. Lowe. An Attack on the Needham-Schroeder Public-Key Authentication Protocol. Information Processing Letters, 56(3):131-133, 1995.
13. A.K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8(1):99-118, 1977.
14. U. Montanari. Networks of Constraints: Fundamental Properties and Applications to Picture Processing. Information Science, 7:95-132, 1974. Also Technical Report, Carnegie Mellon University, 1971.
15. B. C. Neuman and T. Ts'o. Kerberos: An Authentication Service for Computer Networks, from IEEE Communications Magazine, September, 1994.
16. In William Stallings, Practical Cryptography for Data Internetworks. IEEE Press, 1996.
17. Zs. Ruttkay. Fuzzy Constraint Satisfaction. In Proc. of 3rd IEEE International Conference on Fuzzy Systems, pages 1263-1268, 1994.
18. T. Schiex. Possibilistic Constraint Satisfaction Problems, or "How to Handle Soft Constraints?". In Proc. of 8th Conference on Uncertainty in AI, pages 269-275, 1992.
19. T. Schiex, H. Fargier, and G. Verfaille. Valued Constraint Satisfaction Problems: Hard and Easy Problems. In Proc. of the 14th International Joint Conference on Artificial Intelligence (IJCAI'95), pages 631-637. Morgan Kaufmann, 1995.