메뉴 건너뛰기




Volumn 3229, Issue , 2004, Pages 617-627

Automatic compilation of protocol insecurity problems into logic programming

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC COMPILATION; LOGIC PROGRAMS; PROTOL INSECURITY PROBLEM; SECURITY PROTOCOLS; CONSTRUCTION OF MODELS; INSECURITY PROBLEMS; MULTI-SET; PROTOCOL INSECURITY; STATE OF THE ART;

EID: 22944484456     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30227-8_51     Document Type: Conference Paper
Times cited : (9)

References (21)
  • 1
    • 85006614284 scopus 로고    scopus 로고
    • Verifying security protocols as planning in logic programming
    • October
    • L. Carlucci Aiello and F. Massacci. Verifying security protocols as planning in logic programming. ACM Trans. on Computational Logic, 2(4):542-580, October 2001.
    • (2001) ACM Trans. on Computational Logic , vol.2 , Issue.4 , pp. 542-580
    • Carlucci Aiello, L.1    Massacci, F.2
  • 3
    • 84954313527 scopus 로고    scopus 로고
    • Automatic SAT-compilation of protocol insecurity problems via reduction to planning
    • Springer-Verlag
    • A. Armando and L. Compagna. Automatic SAT-Compilation of Protocol Insecurity Problems via Reduction to Planning. In Proc. of FORTE 2002, LNCS 2529. Springer-Verlag, 2002.
    • (2002) Proc. of FORTE 2002 , vol.2529 LNCS
    • Armando, A.1    Compagna, L.2
  • 4
    • 35048841165 scopus 로고    scopus 로고
    • Abstraction-driven SAT-based analysis of security protocols
    • Springer-Verlag
    • A. Armando and L. Compagna. Abstraction-driven SAT-based Analysis of Security Protocols. In Proc. of SAT 2003, LNCS 2919. Springer-Verlag, 2003.
    • (2003) Proc. of SAT 2003 , vol.2919 LNCS
    • Armando, A.1    Compagna, L.2
  • 5
    • 22944474197 scopus 로고    scopus 로고
    • An optimized intruder model for sat-based model-checking of security protocols
    • To appear in
    • A. Armando and L. Compagna. An optimized intruder model for sat-based model-checking of security protocols. To appear in the Proc. of ARSPA 2004., 2004.
    • (2004) The Proc. of ARSPA 2004.
    • Armando, A.1    Compagna, L.2
  • 6
    • 35248876774 scopus 로고    scopus 로고
    • SAT-based model-checking of security protocols using planning graph analysis
    • Springer-Verlag
    • A. Armando, L. Compagna, and P. Ganty. SAT-based Model-Checking of Security Protocols using Planning Graph Analysis. In Proc. of FME 2003, LNCS 2805. Springer-Verlag, 2003.
    • (2003) Proc. of FME 2003 , vol.2805 LNCS
    • Armando, A.1    Compagna, L.2    Ganty, P.3
  • 7
    • 0142188052 scopus 로고    scopus 로고
    • An on-the-fly model-checker for security protocol analysis
    • Springer-Verlag
    • D. Basin, S. Mödersheim, and L. Viganò. An On-The-Fly Model-Checker for Security Protocol Analysis. In Proc. of ESORICS'03, LNCS 2808. Springer-Verlag, 2003.
    • (2003) Proc. of ESORICS'03 , vol.2808 LNCS
    • Basin, D.1    Mödersheim, S.2    Viganò, L.3
  • 9
    • 84961707449 scopus 로고    scopus 로고
    • Formal specification and analysis of active networks and communication protocols: The Maude experience
    • IEEE Computer Society Press
    • Grit Denker, Jose Meseguer, and Carolyn Talcott. Formal specification and analysis of active networks and communication protocols: The Maude experience. In Proc. of DISCEX'00, pages 251-265. IEEE Computer Society Press, 2000.
    • (2000) Proc. of DISCEX'00 , pp. 251-265
    • Denker, G.1    Meseguer, J.2    Talcott, C.3
  • 11
    • 0001119421 scopus 로고
    • The stable model semantics for logic programming
    • Robert Kowalski and Kenneth Bowen, editors
    • M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Robert Kowalski and Kenneth Bowen, editors, Logic Programming: Proc. Fifth Int'l Conf. and Symp., pages 1070-1080, 1988.
    • (1988) Logic Programming: Proc. Fifth Int'l Conf. and Symp. , pp. 1070-1080
    • Gelfond, M.1    Lifschitz, V.2
  • 12
    • 77951505493 scopus 로고
    • Classical negation in logic programs and disjunctive databases
    • Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
    • (1991) New Generation Computing , vol.9 , pp. 365-385
    • Gelfond, M.1    Lifschitz, V.2
  • 13
    • 9444283782 scopus 로고    scopus 로고
    • Cmodels-2: Sat-based answer set solver enhanced to nontight programs
    • Yuliya Lierler and Marco Maratea. Cmodels-2: Sat-based answer set solver enhanced to nontight programs. In Proc. LPNMR-04, pages 346-350, 2004.
    • (2004) Proc. LPNMR-04 , pp. 346-350
    • Lierler, Y.1    Maratea, M.2
  • 14
    • 0031633395 scopus 로고    scopus 로고
    • Casper: A compiler for the analysis of security protocols
    • G. Lowe. Casper: a Compiler for the Analysis of Security Protocols. Journal of Computer Security, 6(1):53-84, 1998.
    • (1998) Journal of Computer Security , vol.6 , Issue.1 , pp. 53-84
    • Lowe, G.1
  • 15
    • 0035751921 scopus 로고    scopus 로고
    • Constraint solving for bounded-process cryptographic protocol analysis
    • J. K. Millen and V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In Proc. of CCS'01, pages 166-175, 2001.
    • (2001) Proc. of CCS'01 , pp. 166-175
    • Millen, J.K.1    Shmatikov, V.2
  • 18
    • 0012352010 scopus 로고    scopus 로고
    • Extending the smodels system with cardinality and weight constraints
    • Jack Minker, editor, Kluwer
    • Ilkka Niemelä and Patrik Simons. Extending the Smodels system with cardinality and weight constraints. In Jack Minker, editor, Logic-Based Artificial Intelligence, pages 491-521. Kluwer, 2000.
    • (2000) Logic-based Artificial Intelligence , pp. 491-521
    • Niemelä, I.1    Simons, P.2
  • 19
    • 0010122418 scopus 로고    scopus 로고
    • Extending and implementing the stable model semantics
    • Ilkka Niemelä, Patrik Simons, and Timo Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138:181-234, 2002.
    • (2002) Artificial Intelligence , vol.138 , pp. 181-234
    • Niemelä, I.1    Simons, P.2    Soininen, T.3
  • 20
    • 0031643297 scopus 로고    scopus 로고
    • The inductive approach to verifying cryptographic protocols
    • L. C. Paulson. The Inductive Approach to Verifying Cryptographic Protocols. Journal of Computer Security, 6(1):85-128, 1998.
    • (1998) Journal of Computer Security , vol.6 , Issue.1 , pp. 85-128
    • Paulson, L.C.1
  • 21
    • 0032678887 scopus 로고    scopus 로고
    • Athena: A new efficient automatic checker for security protocol analysis
    • IEEE Computer Society Press
    • D. Song. Athena: A new efficient automatic checker for security protocol analysis. In Proc. of the 12th IEEE Computer Security Foundations Workshop (CSFW'99), pages 192-202. IEEE Computer Society Press, 1999.
    • (1999) Proc. of the 12th IEEE Computer Security Foundations Workshop (CSFW'99) , pp. 192-202
    • Song, D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.