메뉴 건너뛰기




Volumn 2154, Issue , 2001, Pages 551-565

A game-based verification of non-repudiation and fair exchange protocols

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; TEMPORAL LOGIC;

EID: 84944080333     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_37     Document Type: Conference Paper
Times cited : (59)

References (16)
  • 3
    • 0031650188 scopus 로고    scopus 로고
    • Asynchronous protocols for optimistic fair exchange
    • Oakland, CA, May 1998. IEEE Computer Society, Technical Committee on Security and Privacy, IEEE Computer Society Press
    • N. Asokan, V. Shoup, and M. Waidner. Asynchronous protocols for optimistic fair exchange. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 86–99, Oakland, CA, May 1998. IEEE Computer Society, Technical Committee on Security and Privacy, IEEE Computer Society Press.
    • Proceedings of the IEEE Symposium on Research in Security and Privacy , pp. 86-99
    • Asokan, N.1    Shoup, V.2    Waidner, M.3
  • 5
    • 84944055170 scopus 로고    scopus 로고
    • volume 426, number 1871, 1989. In William Stallings, Practical Cryptography for Data Internetworks, IEEE Computer Society Press
    • M. Burrows, M. Abadi, and R. Needham. A logic of authentication, from proceedings of the royal society, volume 426, number 1871, 1989. In William Stallings, Practical Cryptography for Data Internetworks, IEEE Computer Society Press, 1996. 1996.
    • (1996) A Logic of Authentication, from Proceedings of the Royal Society , vol.1996
    • Burrows, M.1    Abadi, M.2    Needham, R.3
  • 7
    • 0010569409 scopus 로고    scopus 로고
    • Optimistic non-repudiable information exchange
    • In J. Biemond, editor, Werkgemeenschap Informatie- en Communicatietheorie, Enschede, may
    • S. Kremer and O. Markowitch. Optimistic non-repudiable information exchange. In J. Biemond, editor, 21th Symp. on Information Theory in the Benelux, pages 139–146. Werkgemeenschap Informatie- en Communicatietheorie, Enschede, may 2000.
    • (2000) 21Th Symp. On Information Theory in the Benelux , pp. 139-146
    • Kremer, S.1    Markowitch, O.2
  • 9
    • 0342658605 scopus 로고    scopus 로고
    • Breaking and fixing the Needham-Schroeder public-key protocol using FDR
    • G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. Lecture Notes in Computer Science, 1055:147–157, 1996.
    • (1996) Lecture Notes in Computer Science , vol.1055 , pp. 147-157
    • Lowe, G.1
  • 11
    • 84949740740 scopus 로고    scopus 로고
    • Analyzing the Needham-Schroeder public-key protocol: A comparison of two approaches
    • C. A. Meadows. Analyzing the Needham-Schroeder public-key protocol: A comparison of two approaches. Lecture Notes in Computer Science, 1146:351–365, 1996.
    • (1996) Lecture Notes in Computer Science , vol.1146 , pp. 351-365
    • Meadows, C.A.1
  • 12
    • 0030705795 scopus 로고    scopus 로고
    • Proving properties of security protocols by induction
    • IEEE Computer Society Press, June
    • L. C. Paulson. Proving properties of security protocols by induction. In Proceedings of the 10th Computer Security Foundations Workshop, pages 70–83. IEEE Computer Society Press, June 1997.
    • (1997) Proceedings of the 10Th Computer Security Foundations Workshop , pp. 70-83
    • Paulson, L.C.1


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