Security protocols verification in abductive logic programming: A case study

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

Volumn 3963 LNAI, Issue , 2006, Pages 106-124

  Alberti, Marco ^a   Chesani, Federico ^b   Gavanelli, Marco ^a   Lamma, Evelina ^a   Mello, Paola ^b   Torroni, Paolo ^b  

^a UNIVERSITY OF FERRARA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; ELECTRONIC COMMERCE; LOGIC PROGRAMMING; MULTI AGENT SYSTEMS; SECURITY OF DATA; TECHNICAL PRESENTATIONS;

ABDUCTIVE LOGIC PROGRAMMING; NEEDHAM-SCHROEDER PROTOCOL; NETBILL E-COMMERCE PROTOCOL; SOCS-SI FRAMEWORK;

NETWORK PROTOCOLS;

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

References (30)

1. Davidsson, P.: Categories of artificial societies. In Omicini, A., Petta, P., Tolksdorf, R., eds.: Engineering Societies in the Agents World II. Volume 2203 of Lecture Notes in Artificial Intelligence, Springer-Verlag (2001) 1-9 2nd International Workshop (ESAW'01), Prague, Czech Republic, July 7, 2001, Revised Papers
2. Guerin, F., Pitt, J.: Proving properties of open agent systems. In Castelfranchi, C., Lewis Johnson, W., eds.: Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-2002), Part II, Bologna, Italy, ACM Press (2002) 557-558
3. Societies Of ComputeeS (SOCS): a computational logic model for the description, analysis and verification of global and open societies of heterogeneous computees, IST-2001-32530 (2001) Home Page: http://lia.deis.unibo.it/Research/SOCS/
4. Alberti, M., Ciampolini, A., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: A social ACL semantics by deontic constraints. In Mařík, V., Müller, J., Pěchouček, M., eds.: Multi-Agent Systems and Applications III. Proceedings of the 3rd International Central and Eastern European Conference on Multi-Agent Systems, CEEMAS 2003. Volume 2691 of Lecture Notes in Artificial Intelligence, Prague, Czech Republic, Springer-Verlag (2003) 204-213
5. Alberti, M., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Specification and verification of agent interactions using social integrity constraints. Electronic Notes in Theoretical Computer Science 85 (2003)
6. The socs protocol repository (2005) Available at http://lia.deis.unibo.it/research/socs/partners/societies/protocols.html
7. Needham, R., Schroeder, M.: Using encryption for authentication in large networks of computers. Communications of the ACM 21 (1978) 993-999
8. Lowe, G.: Breaking and fixing the Needham-Shroeder public-key protocol using CSP and FDR. In Margaria, T., Steffen, B., eds.: Tools and Algorithms for the Construction and Analysis of Systems: Second International Workshop, TACAS'96. Volume 1055 of Lecture Notes in Artificial Intelligence, Springer-Verlag (1996) 147-166
9. Denning, D.E., Sacco, G.M.: Timestamps in key distribution protocols. Communications of the ACM 24 (1981) 533-536
10. Alberti, M., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: An Abductive Interpretation for Open Societies. In Cappelli, A., Turini, F., eds.: AI*IA 2003: Advances in Artificial Intelligence, Proceedings of the 8th Congress of the Italian Association for Artificial Intelligence, Pisa. Volume 2829 of Lecture Notes in Artificial Intelligence, Springer-Verlag (2003) 287-299
11. Jaffar, J., Maher, M.: Constraint logic programming: a survey. Journal of Logic Programming 19-20 (1994) 503-582
12. Kakas, A.C., Kowalski, R.A., Toni, F.: Abductive Logic Programming. Journal of Logic and Computation 2 (1993) 719-770
13. Dolev, D., Yao, A.C.C.: On the security of public key protocols. IEEE Transactions on Information Theory 29 (1983) 198-207
14. Alberti, M., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: The sciff abductive proof-procedure. In: Proceedings of the 9th National Congress on Artificial Intelligence, AI*IA 2005. Volume 3673 of Lecture Notes in Artificial Intelligence, Springer-Verlag (2005) 135-147
15. Fung, T.H., Kowalski, R.A.: The IFF proof procedure for abductive logic programming. Journal of Logic Programming 33 (1997) 151-165
16. Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: On the automatic verification of interaction protocols using g-SCIFF. Technical Report DEIS-LIA-04-004, University of Bologna (Italy) (2005) LIA Series no. 72.
17. Cox, B., Tygar, J., Sirbu, M.: Netbill security and transaction protocol. In: Proceedings of the First USENIX Workshop on Electronic Commerce, New York (1995)
18. Russo, A., Miller, R., Nuseibeh, B., Kramer, J.: An abductive approach for analysing event-based requirements specifications. In Stuckey, P., ed.: Logic Programming, 18th International Conference, ICLP 2002. Volume 2401 of Lecture Notes in Computer Science, Berlin Heidelberg, Springer-Verlag (2002) 22-37
19. Basin, D.A., Mödersheim, S., Viganò, L.: An on-the-fly model-checker for security protocol analysis. In Snekkenes, E., Gollmann, D., eds.: ESORICS. Volume 2808 of Lecture Notes in Computer Science, Springer (2003) 253-270
20. Blanchet, B.: Automatic verification of cryptographic protocols: a logic programming approach. In: PPDP '03: Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming, New York, NY, USA, ACM Press (2003) 1-3
21. Abadi, M., Blanchet, B.: Analyzing security protocols with secrecy types and logic programs. J. ACM 52 (2005) 102-146
22. Blanchet, B.: From secrecy to authenticity in security protocols. In: SAS '02: Proceedings of the 9th International Symposium on Static Analysis, London, UK, Springer-Verlag (2002) 342-359
23. Armando, A., Compagna, L., Lierler, Y.: Automatic compilation of protocol insecurity problems into logic programming. In Alferes, J.J., Leite, J.A., eds.: Logics in Artificial Intelligence, 9th European Conference, JELIA 2004, Lisbon, Portugal, September 27-30, 2004, Proceedings. Volume 3229 of Lecture Notes in Artificial Intelligence, Springer-Verlag (2004) 617-627
24. Paulson, L.C.: The inductive approach to verifying cryptographic protocols. Journal of Computer Security 6 (1998) 85-128
25. Millen, J.K., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: CCS 2001, Proceedings of the 8th ACM Conference on Computer and Communications Security, ACM press (2001) 166-175
26. Corin, R., Etalle, S.: An improved constraint-based system for the verification of security protocols. In Hermenegildo, M.V., Puebla, G., eds.: Static Analysis, 9th International Symposium, SAS 2002, Madrid, Spain, September 17-20, 2002, Proceedings. Volume 2477 of Lecture Notes in Computer Science, Berlin, Germany, Springer (2002) 326-341
27. Song, D.X.: Athena: a new efficient automatic checker for security protocol analysis. In: CSFW '99: Proceedings of the 1999 IEEE Computer Security Foundations Workshop, Washington, DC, USA, IEEE Computer Society (1999) 192
28. Özkohen, A., Yolum, P.: Predicting exceptions in agent-based supply chains. In this volume. (2006)
29. Yolum, P., Singh, M.: Flexible protocol specification and execution: applying event calculus planning using commitments. In Castelfranchi, C., Lewis Johnson, W., eds.: Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-2002), Part II, Bologna, Italy, ACM Press (2002) 527-534
30. Yamaguchi, S., Okayama, K., Miyahara, H.: The design and implementation of an authentication system for the wide area distributed environment. IEICE Transactions on Information and Systems E74 (1991) 3902-3909