Equational approach to formal verification of SET

We have formally verified that a payment protocol, which is an abstract SET payment protocol but retains the essential part of the SET payment protocol, has several desired properties. Among the properties are that, if the payment gateway authorizes a payment, then both cardholder and merchant concerned always agree on the payment, and at this time, the two principals also agree on the transaction amount.

[1]  Lawrence C. Paulson,et al.  The Inductive Approach to Verifying Cryptographic Protocols , 2021, J. Comput. Secur..

[2]  Nachum Dershowitz,et al.  Rewrite Methods for Clausal and Non-Clausal Theorem Proving , 1983, ICALP.

[3]  Fabio Massacci,et al.  The verification of an industrial payment protocol: the SET purchase phase , 2002, CCS '02.

[4]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[5]  Dominique Bolignano.  Towards the formal verification of electronic commerce protocols , 1997, Proceedings 10th Computer Security Foundations Workshop.

[6]  Kazuhiro Ogata,et al.  Flaw and modification of the iKP electronic payment protocols , 2003, Inf. Process. Lett..

[7]  Shiyong Lu,et al.  Model checking the secure electronic transaction (SET) protocol , 1999, MASCOTS '99. Proceedings of the Seventh International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[8]  Kazuhiro Ogata,et al.  Proof Scores in the OTS/CafeOBJ Method , 2003, FMOODS.

[9]  Kazuhiro Ogata,et al.  Formal Analysis of the iKP Electronic Payment Protocols , 2002, ISSS.