메뉴 건너뛰기




Volumn , Issue , 2007, Pages 181-190

Infinite state AMC-model checking for cryptographic protocols

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC ANALYSIS; CONCURRENT GAMES; CRYPTOGRAPHIC PROTOCOLS; DOLEV-YAO INTRUDERS; GAME-THEORETIC SECURITY PROPERTIES; INFINITE STATE; MODEL CHECKING PROBLEM; NON-REPUDIATION PROTOCOL;

EID: 70350381707     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2007.26     Document Type: Conference Paper
Times cited : (9)

References (19)
  • 1
    • 0031334956 scopus 로고    scopus 로고
    • Alternating-time temporal logic
    • IEEE Computer Society Press
    • R. Alur, T. Henzinger, and O. Kupferman. Alternating-time temporal logic. In FOCS'97, pages 100-109. IEEE Computer Society Press, 1997.
    • (1997) FOCS'97 , pp. 100-109
    • Alur, R.1    Henzinger, T.2    Kupferman, O.3
  • 2
    • 0042908709 scopus 로고    scopus 로고
    • Alternating-time temporal logic
    • To appear Available from
    • R. Alur, T. Henzinger, and O. Kupferman. Alternating-time temporal logic. To appear in Journal of the ACM. Available from http://www.cis.upenn.edu/alur/ Jacm02.pdf, 2002.
    • (2002) Journal of the ACM
    • Alur, R.1    Henzinger, T.2    Kupferman, O.3
  • 4
    • 0031650188 scopus 로고    scopus 로고
    • Asynchronous protocols for optimistic fair exchange
    • IEEE Computer Society
    • N. Asokan, V. Shoup, and M. Waidner. Asynchronous protocols for optimistic fair exchange. In S&P 1998, pages 86-99. IEEE Computer Society, 1998.
    • (1998) S&P 1998 , pp. 86-99
    • Asokan, N.1    Shoup, V.2    Waidner, M.3
  • 5
    • 84879529172 scopus 로고    scopus 로고
    • Symbolic trace analysis of cryptographic protocols
    • Automata, Languages and Programming
    • M. Boreale. Symbolic trace analysis of cryptographic protocols. In ICALP 2001, volume 2076 of LNCS, pages 667-681. Springer, 2001. (Pubitemid 33300838)
    • (2001) Lecture Notes in Computer Science , Issue.2076 , pp. 667-681
    • Boreale, M.1
  • 8
    • 33751024861 scopus 로고    scopus 로고
    • A logic for constraint-based security protocol analysis
    • DOI 10.1109/SP.2006.3, 1624009, Proceedings - 2006 IEEE Symposium on Security and Privacy, S+P 2006
    • R. Corin, S. Etalle, and A. Saptawijaya. A Logic for Constraint-based Security Protocol Analysis. In S&P 2006, pages 155-168. IEEE Computer Society, 2006. (Pubitemid 44753720)
    • (2006) Proceedings - IEEE Symposium on Security and Privacy , vol.2006 , pp. 155-168
    • Corin, R.1    Saptawijaya, A.2    Etalle, S.3
  • 10
    • 27244431635 scopus 로고    scopus 로고
    • Constraint solving for contract-signing protocols
    • CONCUR 2005 - Concurrency Theory: 16th International Conference, CONCUR 2005. Proceedings
    • D. Kahler and R. Küsters. Constraint Solving for Contract-Signing Protocols. In CONCUR 2005, volume 3653 of LNCS, pages 233-247. Springer, 2005. (Pubitemid 41520744)
    • (2005) Lecture Notes in Computer Science , vol.3653 , pp. 233-247
    • Kahler, D.1    Kusters, R.2
  • 11
    • 82755187161 scopus 로고    scopus 로고
    • Infinite state AMC-model checking for cryptographic protocols
    • Germany Available from
    • D. Kahler, R. Küsters, and T. Truderung. Infinite State AMC-Model Checking for Cryptographic Protocols. Technical report IFI-0702, CAU Kiel, Germany, 2007. Available from http://www.informatik.unikiel.de/uploads/tx- publication/KKT-CAU-TR-0702.pdf
    • (2007) Technical Report IFI-0702, CAU Kiel
    • Kahler, D.1    Küsters, R.2    Truderung, T.3
  • 12
    • 24144437134 scopus 로고    scopus 로고
    • Deciding properties of contract-signing protocols
    • STACS 2005 - 22nd Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
    • D. Kahler, R. Küsters, and T. Wilke. Deciding Properties of Contract-Signing Protocols. In STACS 2005, volume 3404 in LNCS, pages 158-169. Springer, 2005. (Pubitemid 41241244)
    • (2005) Lecture Notes in Computer Science , vol.3404 , pp. 158-169
    • Kahler, D.1    Kusters, R.2    Wilke, T.3
  • 14
    • 84944080333 scopus 로고    scopus 로고
    • A game-based verification of non-repudiation and fair exchange protocols
    • CONCUR 2001 - Concurrency Theory
    • S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In CONCUR 2001, volume 2154 of LNCS, pages 551-565. Springer, 2001. (Pubitemid 33326680)
    • (2001) Lecture Notes in Computer Science , Issue.2154 , pp. 551-565
    • Kremer, S.1    Raskin, J.-F.2
  • 15
    • 84948779843 scopus 로고    scopus 로고
    • Game analysis of abuse-free contract signing
    • IEEE Computer Society
    • S. Kremer and J.-F. Raskin. Game analysis of abuse-free contract signing. In CSFW 2002, pages 206-220. IEEE Computer Society, 2002.
    • (2002) CSFW 2002 , pp. 206-220
    • Kremer, S.1    Raskin, J.-F.2
  • 17
    • 0034822801 scopus 로고    scopus 로고
    • Protocol insecurity with finite number of sessions is NP-complete
    • IEEE Computer Society
    • M. Rusinowitch and M. Turuani. Protocol Insecurity with Finite Number of Sessions is NP-complete. In CSFW-14, pages 174-190. IEEE Computer Society, 2001.
    • (2001) CSFW-14 , pp. 174-190
    • Rusinowitch, M.1    Turuani, M.2
  • 19
    • 0037076869 scopus 로고    scopus 로고
    • Finite-state analysis of two contract signing protocols
    • DOI 10.1016/S0304-3975(01)00141-4, PII S0304397501001414
    • V. Shmatikov and J. Mitchell. Finite-state analysis of two contract signing protocols. In TCS, 283(2):419-450, 2002. (Pubitemid 34624079)
    • (2002) Theoretical Computer Science , vol.283 , Issue.2 , pp. 419-450
    • Shmatikov, V.1    Mitchell, J.C.2


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