ACM Transactions on Computer Systems (TOCS)
NetCash: a design for practical electronic currency on the Internet
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Accountability in Electronic Commerce Protocols
IEEE Transactions on Software Engineering
Optimistic protocols for fair exchange
Proceedings of the 4th ACM conference on Computer and communications security
Strand spaces: proving security protocols correct
Journal of Computer Security
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Honest Ideals on Strand Spaces
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
Model checking electronic commerce protocols
WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
The modelling and analysis of security protocols: the csp approach
The modelling and analysis of security protocols: the csp approach
Fairness electronic payment protocol
International Journal of Grid and Utility Computing
| Hi-index | 0.00 |
Strand space logic is a formal method for analysing the security protocol. The electronic commerce protocols are of more complex structures, for example, branch structures, or a protocol is composite of multiple sub-protocols, so the analysis of electronic commerce protocols is far more complex than the analysis of authentication protocols. Fairness is a very important feature in e-commerce protocol. But traditional belief logic is not suitable for this. In this paper, we analyse the strand and bundle of ISI payment protocol and then prove its unfairness. We also present a strand node path method to analyse ASW protocol, which consists of multiple sub-protocols with branch structure, and the strand space analysis shows that this protocol is fair.