메뉴 건너뛰기




Volumn 85, Issue 1-4, 2008, Pages 359-375

LDYIS: A framework for model checking security protocols

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC VERIFICATION; MULTI AGENT SYSTEM (MAS); NSPK PROTOCOL; SECURITY PROTOCOLS;

EID: 67650450119     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper
Times cited : (12)

References (21)
  • 2
    • 14044277509 scopus 로고    scopus 로고
    • An optimized intruder model for SAT-based model-checking of security protocols
    • DOI 10.1016/j.entcs.2004.05.021, PII S1571066105000769, Proceedings of the Workshop on Automated Reasoning for Security Protocol Analysis (ARSPA 2004)
    • A. Armando and L. Compagna. An optimized intruder model for SAT-based model-checking of security protocols. ENTCS, 125(1): 91-108, 2005. (Pubitemid 40276663)
    • (2005) Electronic Notes in Theoretical Computer Science , vol.125 , Issue.1 , pp. 91-108
    • Armando, A.1    Compagna, L.2
  • 3
    • 0025386404 scopus 로고
    • A logic of authentication, acm trans
    • M. Burrows, M. Abadi, R. Needham. A Logic of Authentication, ACM Trans. Comput. Syst. 8(1): 18-36, 1990.
    • (1990) Comput. Syst. , vol.8 , Issue.1 , pp. 18-36
    • Burrows, M.1    Abadi, M.2    Needham, R.3
  • 4
    • 19744367735 scopus 로고    scopus 로고
    • OFMC: A symbolic model checker for security protocols
    • DOI 10.1007/s10207-004-0055-7
    • D. A. Basin, S. Modersheim, and Luca Vigano. OFMC: A symbolic model checker for security protocols. International Journal of Information Security, 4(3): 181-208, 2005. (Pubitemid 40743365)
    • (2005) International Journal of Information Security , vol.4 , Issue.3 , pp. 181-208
    • Basin, D.1    Modersheim, S.2    Vigano, L.3
  • 5
    • 0023861309 scopus 로고
    • The dining cryptographers problem: Unconditional sender and recipient untraceability
    • D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1(1): 65-75, 1988. (Pubitemid 18606152)
    • (1988) Journal of Cryptology , vol.1 , Issue.1 , pp. 65-75
    • Chaum David1
  • 7
    • 0020720357 scopus 로고
    • On the security of public key protocols
    • D. Dolev and A. Yao. On the security of public key protocols. IEEE Trans. Inf. Theory, 29(2): 198-208, 1983.
    • (1983) IEEE Trans. Inf. Theory , vol.29 , Issue.2 , pp. 198-208
    • Dolev, D.1    Yao, A.2
  • 10
    • 35248868917 scopus 로고    scopus 로고
    • Modeling adversaries in a logic for security protocol analysis
    • Springer-Verlag
    • J. Y. Halpern and R. Pucella. Modeling adversaries in a logic for security protocol analysis. In Proc. FASec'02), volume 2629 of LNCS, pages 115-132. Springer-Verlag, 2003.
    • (2003) Proc. FASec'02)., Volume 2629 of LNCS , pp. 115-132
    • Halpern, J.Y.1    Pucella, R.2
  • 11
    • 34548649341 scopus 로고    scopus 로고
    • Modelling and checking timed authentication of security protocols
    • Special Issue on Concurrency Specification and Programming
    • G. Jakubowska and W. Penczek. Modelling and checking timed authentication of security protocols. In Fundamenta Informaticae, 79(3-4): 363-378, 2007. (Pubitemid 47409637)
    • (2007) Fundamenta Informaticae , vol.79 , Issue.3-4 , pp. 363-378
    • Jakubowska, G.1    Penczek, W.2
  • 12
    • 34548632468 scopus 로고    scopus 로고
    • Sat-based verification of security protocols via translation to networks of automata
    • Springer-Verlag
    • M. Kurkowski, W. Penczek, and A. Zbrzezny. Sat-based verification of security protocols via translation to networks of automata. In MoChart IV, volume 4428 of LNAI, pages 146-165. Springer-Verlag, 2007.
    • (2007) MoChart IV, Volume 4428 of LNAI , pp. 146-165
    • Kurkowski, M.1    Penczek, W.2    Zbrzezny, A.3
  • 14
    • 33747048946 scopus 로고    scopus 로고
    • Comparing BDD and SAT based techniques for model checking Chaum's Dining Cryptographers protocol
    • SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CSandP 2005) Ruciane-Nide, Poland, 28-30 September 2005
    • M. Kacprzak, A. Lomuscio, A. Niewiadomski, W. Penczek, F. Raimondi, and M. Szreter. Comparing BDD and SAT based techniques for model checking Chaum's dining cryptographers protocol. Fundamenta Informaticae, Vol 72(1-3), 215-234, 2006. (Pubitemid 44215263)
    • (2006) Fundamenta Informaticae , vol.72 , Issue.1-3 SPEC. ISS. , pp. 215-234
    • Kacprzak, M.1    Lomuscio, A.2    Niewiadomski, A.3    Penczek, W.4    Raimondi, F.5    Szreter, M.6
  • 16
    • 33745782313 scopus 로고    scopus 로고
    • MCMAS: A model checker for multi-agent systems
    • In H. Hermanns and J. Palsberg, editors Springer Verlag
    • A. Lomuscio and F. Raimondi. MCMAS: A model checker for multi-agent systems. In H. Hermanns and J. Palsberg, editors, Proc. of TACAS 2006, Vienna, volume 3920, 450-454. Springer Verlag, 2006.
    • (2006) Proc. of TACAS 2006, Vienna, Volume 3920, 450-454
    • Lomuscio, A.1    Raimondi, F.2
  • 17
    • 34247215146 scopus 로고    scopus 로고
    • A complete and decidable security-specialised logic and its application to the TESLA protocol
    • DOI 10.1145/1160633.1160658, Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems
    • A. Lomuscio and B. Wozna. A complete and decidable security-specialised logic and its application to the TESLA protocol. In Proc. of AAMAS'06, ACM Press, 145-152, 2006. (Pubitemid 46609447)
    • (2006) Proceedings of the International Conference on Autonomous Agents , vol.2006 , pp. 145-152
    • Lomuscio, A.1    Wozna, B.2
  • 18
    • 0037560142 scopus 로고    scopus 로고
    • Verifying epistemic properties of multi-agent systems via bounded model checking
    • W. Penczek and A. Lomuscio. Verifying epistemic properties of multi-agent systems via bounded model checking. Fundamenta Informaticae, 55(2): 167-185, 2003.
    • (2003) Fundamenta Informaticae , vol.55 , Issue.2 , pp. 167-185
    • Penczek, W.1    Lomuscio, A.2
  • 19
    • 0036600797 scopus 로고    scopus 로고
    • Bounded Model Checking for the universal fragment of CTL
    • W. Penczek, B. Wozna, and A. Zbrzezny. Bounded model checking for the universal fragment of CTL. Fundamenta Informaticae, 51(1-2): 135-156, 2002. (Pubitemid 34772520)
    • (2002) Fundamenta Informaticae , vol.51 , Issue.1-2 , pp. 135-156
    • Penczek, W.1    Wozna, B.2    Zbrzezny, A.3
  • 20
    • 33745769799 scopus 로고    scopus 로고
    • Automatic verification of multi-agent systems bymodel checking via OBDDs
    • To appear in Special issue on Logic-based agent verification
    • F. Raimondi and A. Lomuscio. Automatic verification of multi-agent systems bymodel checking via OBDDs. Journal of Applied Logic, 2005. To appear in Special issue on Logic-based agent verification.
    • Journal of Applied Logic, 2005
    • Raimondi, F.1    Lomuscio, A.2
  • 21
    • 4944250729 scopus 로고    scopus 로고
    • Symbolic model checking the knowledge of the dining cryptographers
    • USA,. IEEE Computer Society
    • R. van der Meyden and Kaile Su. Symbolic model checking the knowledge of the dining cryptographers. In Proc. CSFW'04, 280-291, USA, 2004. IEEE Computer Society.
    • (2004) Proc. CSFW'04, 280-291
    • Meyden Der R.Van1    Su, K.2


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