Indiana University Bloomington

Luddy School of Informatics, Computing, and Engineering

Technical Report TR537:
A Bound on Attacks on Payment Protocols

Scott D. Stoller
(Feb 2000), 16 pages pages
[Revised January 10, 2001 and April 10, 2001.]
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.

Available as: