ACM Transactions on Computer Systems (TOCS)
Optimistic protocols for fair exchange
Proceedings of the 4th ACM conference on Computer and communications security
On the efficient implementation of fair non-repudiation
ACM SIGCOMM Computer Communication Review
Fairness in electronic commerce
Fairness in electronic commerce
Certified email with a light on-line trusted third party: design and implementation
Proceedings of the 11th international conference on World Wide Web
Formal Analysis of a Non-Repudiation Protocol
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
On Unifying Some Cryptographic Protocol Logics
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
A fair non-repudiation protocol
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
An intensive survey of fair non-repudiation protocols
Computer Communications
Securing digital signatures for non-repudiation
Computer Communications
Non-repudiation Mechanism of Agent-Based Mobile Payment Systems: Perspectives on Wireless PKI
KES-AMSTA '07 Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
SETNR/A: an agent-based secure payment protocol for mobile commerce
KES-AMSTA'08 Proceedings of the 2nd KES International conference on Agent and multi-agent systems: technologies and applications
SETNR/A: an agent-based secure payment protocol for mobile commerce
International Journal of Intelligent Information and Database Systems
Adaptation of agent-based non-repudiation protocol to mobile digital right management (DRM)
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
In 1996, J. Zhou and D. Gollmann proposed a fair non-repudiation protocol, which was unfair in fact for its lack of timeliness. K. Kim, S. Park and J. Baek improved it by adding time limit information to protocol messages. However, the improvement needs mechanisms to synchronize clocks among the protocol entities, thus making its implementation inefficient. In this paper, to make Zhou-Gollmann's non-repudiation protocol provide timeliness while preserving its efficiency, a more efficient synchronization scheme was introduced to improve it. SVO logic was extended slightly to analyze the timeliness of the new protocol. The analysis result shows that while the original protocol does not provide timeliness, the newly updated one does.