메뉴 건너뛰기




Volumn 3783 LNCS, Issue , 2005, Pages 27-39

On the quest for impartiality: Design and analysis of a fair non-repudiation protocol

Author keywords

[No Author keywords available]

Indexed keywords

NON-REPUDIATION PROTOCOL; SESSION LABELS; VULNERABILITIE;

EID: 33646736777     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602897_3     Document Type: Conference Paper
Times cited : (14)

References (21)
  • 3
    • 84949486769 scopus 로고    scopus 로고
    • Mechanical proofs about a non-repudiation protocol
    • R. J. Boulton and P. B. Jackson, editors, TPHOLs 2001. Springer-Verlag, September
    • G. Bella and L. C. Paulson, Mechanical proofs about a non-repudiation protocol. In R. J. Boulton and P. B. Jackson, editors, TPHOLs 2001, volume 2152 of LNCS, pages 91-104. Springer-Verlag, September 2001.
    • (2001) LNCS , vol.2152 , pp. 91-104
    • Bella, G.1    Paulson, L.C.2
  • 4
    • 84856533229 scopus 로고    scopus 로고
    • Exploring fair exchange protocols using specification animation
    • Information Security Workshop (ISW). Springer-Verlag
    • C. Boyd and P. Kearney. Exploring fair exchange protocols using specification animation. In Information Security Workshop (ISW), volume 1975 of LNCS, pages 209-223. Springer-Verlag, 2000.
    • (2000) LNCS , vol.1975 , pp. 209-223
    • Boyd, C.1    Kearney, P.2
  • 5
    • 33646739268 scopus 로고    scopus 로고
    • On the quest for impartiality: Design and analysis of a fair non-repudiation protocol (extended version)
    • University of Twente, The Netherlands
    • J. Cederquist, R. Corin, and M. Torabi Dashti. On the quest for impartiality: Design and analysis of a fair non-repudiation protocol (extended version). Technical Report TR-CTIT-05-32, University of Twente, The Netherlands, 2005.
    • (2005) Technical Report , vol.TR-CTIT-05-32
    • Cederquist, J.1    Corin, R.2    Torabi Dashti, M.3
  • 6
    • 33646730052 scopus 로고    scopus 로고
    • An intruder model for verifying termination in security protocols
    • University of Twente, Enschede, The Netherlands
    • J. Cederquist and M. Torabi Dashti. An intruder model for verifying termination in security protocols. Technical Report TR-CTIT-05-29, University of Twente, Enschede, The Netherlands, 2005.
    • (2005) Technical Report , vol.TR-CTIT-05-29
    • Cederquist, J.1    Torabi Dashti, M.2
  • 7
    • 20144373491 scopus 로고    scopus 로고
    • The Dolev-Yao intruder is the most powerful attacker
    • J. Halpern, editor, Boston, MA, 16-19 June. IEEE Computer Society Press
    • I. Cervesato. The Dolev-Yao Intruder is the Most Powerful Attacker. In J. Halpern, editor, LICS'01, Boston, MA, 16-19 June 2001. IEEE Computer Society Press.
    • (2001) LICS'01
    • Cervesato, I.1
  • 8
    • 0020720357 scopus 로고
    • On the security of public key protocols
    • March
    • D. Dolev and A.C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, IT-29(2): 198-208, March 1983.
    • (1983) IEEE Transactions on Information Theory , vol.IT-29 , Issue.2 , pp. 198-208
    • Dolev, D.1    Yao, A.C.2
  • 9
    • 84957379824 scopus 로고    scopus 로고
    • CADP: A protocol validation and verification toolbox
    • R. Alur and T. A. Henzinger, editors, Proceedings of the 8th Conference on Computer-Aided Verification. Springer-Verlag
    • J.-C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu. CADP: A protocol validation and verification toolbox. In R. Alur and T. A. Henzinger, editors, Proceedings of the 8th Conference on Computer-Aided Verification, volume 1102 of LNCS, pages 437-440. Springer-Verlag, 1996.
    • (1996) LNCS , vol.1102 , pp. 437-440
    • Fernandez, J.-C.1    Garavel, H.2    Kerbrat, A.3    Mateescu, R.4    Mounier, L.5    Sighireanu, M.6
  • 12
    • 0001879305 scopus 로고
    • The syntax and semantics of μCRL
    • A. Ponse, C. Verhoef, and S. F. M. van Vlijmcn, editors, Workshops in Computing Series. Springer-Verlag
    • J. F. Groote and A. Ponse. The syntax and semantics of μCRL. In A. Ponse, C. Verhoef, and S. F. M. van Vlijmcn, editors, Algebra of Communicating Processes '94, Workshops in Computing Series, pages 26-62. Springer-Verlag, 1995.
    • (1995) Algebra of Communicating Processes '94 , pp. 26-62
    • Groote, J.F.1    Ponse, A.2
  • 13
    • 35248837018 scopus 로고    scopus 로고
    • On the security of fair non-repudiation protocols
    • Information Security Conference (ISC). Springer
    • S. Gürgens, C. Rudolph, and M. Vogt. On the security of fair non-repudiation protocols. In Information Security Conference (ISC), volume 2851 of LNCS, pages 193-207. Springer, 2003.
    • (2003) LNCS , vol.2851 , pp. 193-207
    • Gürgens, S.1    Rudolph, C.2    Vogt, M.3
  • 14
    • 0036836682 scopus 로고    scopus 로고
    • An intensive survey of non-repudiation protocols
    • November
    • S. Kremer, O. Markowitch, and J. Zhou. An intensive survey of non-repudiation protocols. Computer Communications, 25(17):1606-1621, November 2002.
    • (2002) Computer Communications , vol.25 , Issue.17 , pp. 1606-1621
    • Kremer, S.1    Markowitch, O.2    Zhou, J.3
  • 15
    • 84944080333 scopus 로고    scopus 로고
    • A game-based verification of non-repudiation and fair exchange protocols
    • K. Larsen and M. Nielsen, editors, Proceedings of the 12th International Conference on Concurrency Theory. Springer-Verlag
    • S. Kremer and J. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In K. Larsen and M. Nielsen, editors, Proceedings of the 12th International Conference on Concurrency Theory, volume 2154 of LNCS, pages 551-565. Springer-Verlag, 2001.
    • (2001) LNCS , vol.2154 , pp. 551-565
    • Kremer, S.1    Raskin, J.2
  • 16
    • 0037332768 scopus 로고    scopus 로고
    • Efficient on-the-fly model-checking for regular alternation-free mu-calculus
    • R. Mateescu and M. Sighireanu. Efficient on-the-fly model-checking for regular alternation-free mu-calculus. Sci. Comput. Program., 46(3):255-281, 2003.
    • (2003) Sci. Comput. Program. , vol.46 , Issue.3 , pp. 255-281
    • Mateescu, R.1    Sighireanu, M.2
  • 17
    • 0037250964 scopus 로고    scopus 로고
    • Formal methods for cryptographic protocol analysis: Emerging issues and trends
    • C. Meadows. Formal methods for cryptographic protocol analysis: Emerging issues and trends. IEEE Journal on Selected Areas in Communication, 21(2):44-54, 2003.
    • (2003) IEEE Journal on Selected Areas in Communication , vol.21 , Issue.2 , pp. 44-54
    • Meadows, C.1
  • 18
    • 0003960505 scopus 로고    scopus 로고
    • On the impossibility of fair exchange without a trused third party
    • Darmstadt University
    • H. Pagnia and F. C. Gärtner. On the impossibility of fair exchange without a trused third party. Technical Report TUD-BS-1999-02, Darmstadt University, 1999.
    • (1999) Technical Report , vol.TUD-BS-1999-02
    • Pagnia, H.1    Gärtner, F.C.2
  • 19
    • 0037076869 scopus 로고    scopus 로고
    • Finite-state analysis of two contract signing protocols
    • V. Shmatikov and J. C. Mitchell. Finite-state analysis of two contract signing protocols. Theoretical Computer Science, 283(2):419-450, 2002.
    • (2002) Theoretical Computer Science , vol.283 , Issue.2 , pp. 419-450
    • Shmatikov, V.1    Mitchell, J.C.2
  • 20
    • 35048853123 scopus 로고    scopus 로고
    • On the security of a multi-party certified email protocol
    • Proc. ICICS'04. Springer
    • J. Zhou. On the security of a multi-party certified email protocol. In Proc. ICICS'04, volume 3269 of Lecture Notes in Computer Science, pages 40-52. Springer, 2004.
    • (2004) Lecture Notes in Computer Science , vol.3269 , pp. 40-52
    • Zhou, J.1


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