A randomized protocol for signing contracts
Communications of the ACM
Fair exchange with a semi-trusted third party (extended abstract)
Proceedings of the 4th ACM conference on Computer and communications security
Optimistic protocols for fair exchange
Proceedings of the 4th ACM conference on Computer and communications security
Efficient verifiable encryption (and fair exchange) of digital signatures
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
A Fair-exchange E-commerce Protocol with Automated Dispute Resolution
Proceedings of the IFIP TC11/ WG11.3 Fourteenth Annual Working Conference on Database Security: Data and Application Security, Development and Directions
Stateless-Recipient Certified E-Mail System Based on Verifiable Encryption
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Some Remarks on a Fair Exchange Protocol
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
ACSAC '98 Proceedings of the 14th Annual Computer Security Applications Conference
ACM SIGecom Exchanges
Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A fair non-repudiation protocol
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
Breaking and repairing optimistic fair exchange from PODC 2003
Proceedings of the 3rd ACM workshop on Digital rights management
Fair certified e-mail delivery
Proceedings of the 2004 ACM symposium on Applied computing
Efficient and secure protocol in fair document exchange
Computer Standards & Interfaces
Efficient and secure protocol in fair certified E-mail delivery
WSEAS Transactions on Information Science and Applications
Design and formal verification of a CEM protocol with transparent TTP
Frontiers of Computer Science: Selected Publications from Chinese Universities
Hi-index | 0.00 |
Recently, Nenadic et al. proposed a novel fair exchange protocol RSA-CEMD [A. Nenadic, N. Zhang, S. Barton. Fair certified e-mail delivery, Proceedings of the 9th ACM Symposium on Applied Computing (SAC 2004)-Computer Security Track, Nicosia, Cyprus, pp. 391-396, 2004] for certified e-mail delivery with an off-line and transparent trusted third party. The protocol provides non-repudiation of origin and non-repudiation of receipt security service to protect communicating parties from each other's false denials that the e-mail has been sent and received. In this paper, we show that Nenadic's protocol cannot achieve the claimed fairness. In the exchange protocol, the receiver can cheat the sender successfully by sending an invalid verifiable and recoverable encryption of signature (VRES) which can pass all the sender's verifications, as the VRES scheme proposed in [A. Nenadic, N. Zhang, S. Barton. Fair certified e-mail delivery, Proceedings of the 9th ACM Symposium on Applied Computing (SAC 2004)-Computer Security Track, Nicosia, Cyprus, pp. 391-396, 2004] is inherently unrecoverable in some situations. In other words, there is always that the receiver can get the sender's e-mail message while the sender cannot obtain receiver's receipt. Furthermore, we propose a revised version of certified e-mail delivery protocol that preserves strong fairness while remaining optimistic.