Credit-card payment protocols such as ikp and SET use digital signatures to authenticate messages and authorize transactions. It is assumed that these digital signatures make the parties' authorizations non-repudiable, i.e., provable to a third-party verifier. In this paper, we define a set of statements which participants in a payment may want to prove. We then investigate which of these statements can be proved with the digital signatures within ikp and SET, and make some general comments about requirements for provability in payment protocols.
By: Els Van Herreweghen
Published in: RZ3156 in 1999
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .