Logic in Computer Science (LICS 2001)

Paper: A Bound on Attacks on Payment Protocols (at LICS 2001)

Authors: Scott D. Stoller

Abstract

Electronic payment protocols are designed to work correctly in the presence of an adversary that can prompt honest principals to engage in an unbounded number of concurrent instances of the protocol. This paper establishes an upper bound on the number of protocol instances needed to attack a large class of protocols, which contains versions of some well-known electronic payment protocols, including SET and 1KP. Such bounds clarify the nature of attacks on and provide a rigorous basis for automated verification of payment protocols.

BibTeX

  @InProceedings{Stoller-ABoundonAttacksonPa,
    author = 	 {Scott D. Stoller},
    title = 	 {A Bound on Attacks on Payment Protocols},
    booktitle =  {Proceedings of the Sixteenth Annual IEEE Symp. on Logic in Computer Science, {LICS} 2001},
    year =	 2001,
    editor =	 {Joseph Halpern},
    month =	 {June}, 
    pages =      {61--70},
    location =   {Boston, MA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }