Soft constraints for security protocol analysis: Confidentiality

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

Volumn 1990, Issue , 2001, Pages 108-122

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

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF CATANIA   (Italy)

^c UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; INTERNET PROTOCOLS; COMPUTATIONAL LINGUISTICS; CONSTRAINT THEORY; NETWORK PROTOCOLS; PETROLEUM REFINING;

NEEDHAM SCHROEDER PROTOCOL; NETWORK CONFIGURATION; PROTOCOL GOAL; SECURITY LEVEL; SECURITY PROTOCOL ANALYSIS; SECURITY PROTOCOLS; SOFT CONSTRAINT; SOFT CONSTRAINT SATISFACTION;

NETWORK SECURITY;

EID: 84948414101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45241-9_8     Document Type: Article

References (27)

1. M. Abadi and R. M. Needham. Prudent Engineering Practice for Cryptographic Protocols. IEEE Transactions on Software Engineering, 22(1):6–15, 1996.
2. G. Bella. Modelling Security Protocols Based on Smart Cards. In Proc. of the International Workshop on Cryptographic Techniques & E-Commerce (CrypTEC’99), pages 139–146. City University of Hong Kong, 1999.
3. S. Bistarelli, H. Fargier, U. Montanari, F. Rossi, T. Schiex, and G. Verfaillie. Semiring-based CSPs and Valued CSPs: Basic Properties and Comparison. In Over-Constrained Systems. Springer-Verlag, 1996.
4. S. Bistarelli, H. Fargier, U. Montanari, F. Rossi, T. Schiex, and G. Verfaillie. Semiring-based csps and valued csps: Frameworks, properties, and comparison. CONSTRAINTS: An international journal. Kluwer, 4(3), 1999.
5. S. Bistarelli. Soft Constraint Solving and programming: a general framework. PhD thesis, Dipartimento di Informatica, 2001.
6. G. Bella, F. Massacci, L. C. Paulson, and P. Tramontano. Formal Verification of Cardholder Registration in SET. In Proc. of European Symposium on Research in Computer Security (ESORICS 2000), LNCS. Springer- Verlag, 2000. In press.
7. S. Bistarelli, U. Montanari, and F. Rossi. Constraint Solving over Semirings. In Proc. of the 14th International Joint Conference on Artificial Intelligence (IJCAI’95). Morgan Kaufman, 1995.
8. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Solving and Optimization. Journal of the ACM, pages 201–236, 1997.
9. G. Bella and L. C. Paulson. Kerberos Version IV: Inductive Analysis of the Secrecy Goals. In Proc. of European Symposium on Research in Computer Security (ESORICS’98), volume 1485 of LNCS, pages 361–375. Springer- Verlag, 1998.
10. G. Bella and E. Riccobene. Formal Analysis of the Kerberos Authentication System. Journal of Universal Computer Science, 3(12):1337–1381, 1997.
11. 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.
12. H. Fargier and J. Lang. Uncertainty in Constraint Satisfaction Problems: a Probabilistic Approach. In Proc. of European Conference on Symbolic and Qualitative Approaches to Reasoning and Uncertainty (ECSQARU), pages 97–104. Springer-Verlag, 1993.
13. E. C. Freuder and R. J. Wallace. Partial constraint satisfaction. AI Journal, 1992.
14. G. Lowe. An Attack on the Needham-Schroeder Public-Key Authentication Protocol. Information Processing Letters, 56(3):131–133, 1995.
15. G. Lowe. Some New Attacks upon Security Protocols. In In Proc. of Computer Security Foundations Workshop (CSFW96), pages 139–146. IEEE Press, 1996.
16. G. Lowe and B. Roscoe. Using CSP to Detect Errors in the TMN Protocol. IEEE Transactions on Software Engineering, 3(10), 1997.
17. A. K. Mackworth. Constraint Satisfaction. In Encyclopedia of AI (second edition), pages 285–293. John Wiley & Sons, 1992.
18. R. M. Needham and M. D. Schroeder. Using Encryption for Authentication in Large Networks of Computers. Communications of the ACM, 21(12):993–999, 1978.
19. L. C. Paulson. The Inductive Approach to Verifying Cryptographic Protocols. Journal of Computer Security, 6:85–128, 1998.
20. CHE AUTORE METTIAMO QUI? Data Encryption Standard. National Bureau of Standards, Jan 1977. Federal Information Processing Standards Publications, FIPS Pub. 46.
21. R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM, 21(2):120–126, 1976.
22. Zs. Ruttkay. Fuzzy Constraint Satisfaction. In Proc. of 3rd IEEE International Conference on Fuzzy Systems, pages 1263–1268, 1994.
23. V.A. Saraswat. Concurrent constraint programming language. PhDthesis, Carnegie-Mellon University, 1989.
24. 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.
25. D. S. Scott. Domains for denotational semantics. In Proc. ICALP. Springer-Verlag, 1982.
26. 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.
27. M. Wallace. Practical Applications of Constraint Programming. Constraints: An International Journal, 1996.