Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Parallel and Distributed Processing Symposium (IPDPS)

Certified E-Mail Delivery with DSA Receipts

Aleksandra Nenadić, Ning Zhang, Qi Shi, Carole Goble

Published Apr 19, 2005• 4 citations
Publisher

Abstract

In this paper we present two variant protocols DSA-CEMD1 and DSA-CEMD2 for certified e-mail delivery with DSA receipts. The protocols are based on a cryptographic primitive called Verifiable and Recoverable Encryption of a Signature (VRES) and are capable of achieving non-repudiation and strong fairness security properties. The novel design of the VRES primitive allows efficiency improvements in comparison with the related certified e-mail delivery protocols based on similar primitives. The protocols employ the services of an off-line and invisible trusted third party (TTP) only in case of dispute. In DSA-CEMD1 the content of the e-mail message is not revealed to the TTP during possible recovery and this is achieved at the cost of some additional cryptographic operations. In DSA-CEMD2 the confidentiality of the message is not protected from the TTP, but the protocol is slightly more efficient.

DOI
10.1109/ipdps.2005.135

Related papers

Security Analysis of Two RSA-Based Fair Document Exchange Protocols

Zuhua Shao

In 2005, A. Nenadic N. Zhang and Q. Shi proposed a new cryptographic primitive, called Verifiable and Recoverable Encryption of Signature VRES. Based on RSA-based VRES, they presented two variant protocols RSA-CEMD1 and RSA-CEMD2 for certified e-mail delivery with RSA receipts. They claimed that the protocols provided strong fairness to ensure that the recipient receives the e-mail if and only if the sender receives the receipt. Later, N. Zhang, Q. Shi, M. Merabti, and R. Askwith presented a practical and efficient fair document exchange protocol based on a verifiable and recoverable encryption of keys that is somewhat similar to the VRES. In this paper, we find that the VRES scheme is universal forgeable. Anyone can generate the false VRES for any message without the knowledge of any private key of the sender, the recipient and the TTP. It follows that the two variant protocols RSA-CEMD1, RSA-CEMD2 are all insecure. Meanwhile, we show that the document exchange protocol is not fair since the verifiable and recoverable encryption of keys is not recoverable.

•Jan 1, 2009•0 citations

A New Protocol for Certified Mail Based on Off-line Conditional TTP

Shen Wei

Electronic mail delivery is one of the most important and desirable services, by which the intended recipient will get the mail if and only if the mail originator receives a valid and irrefutable proof of the receipt. The idea of conditional trusted third party has been developed on the basis of semi-trusted TTP and a suite of acceptable conditions is given. A new practical protocol for certified e-mail is presented, which can guarantee acceptable fair with interception of conditional TTP. More, the evidence in the new protocol is publicly verifiable without any restrictions on the type of signature and encryption algorithms.

Jisuanji gongcheng•Jan 1, 2004•0 citations

Certified e-Mail Protocol with Verifiable Third Party

Macià Mut–Puigserver, Josep Lluís Ferrer Gomila, Llorenç Huguet Rotger

Certified e-mail is a particular case of fair exchange. TTPs play an important role in this kind of protocols and their reliability and security is a problem that needs to be addressed. In order to enhance the trust in non-repudiation services we propose TTPs that provide verifiable services, so users get evidence of the TTPs operations. In this paper we design a new certified e-mail protocol where the user confidence on what is happening when he invokes the TTP is enhanced.

IEEE Conference on Commerce and Enterprise Computing (CEC)•Apr 12, 2005•12 citations

A security protocol for certified e-goods delivery

Aleksandra Nenadić, Ning Zhang, S. Barton

This paper presents an efficient security protocol for certified e-goods delivery with the following features: (1) ensures strong fairness, (2) ensures non-repudiation of origin and non-repudiation of receipt, (3) allows the receiver of an e-goods to verify, during the protocol execution, that the e-goods he is about to receive is the one he is signing the receipt for, (4) does not require the active involvement of a fully trusted third party, but rather an off-line and transparent semi-trusted third party (STTP) only in cases of unfair behaviour by any party, and (5) provides confidentiality protection for the exchanged items from the STTP.

International Conference on Information Technology: Coding and Computing (ITCC)•Jan 1, 2004•16 citations

Efficient and secure protocol in fair certified E-mail delivery

Ren-Junn Hwang, Chih-Hua Lai

Abstract:- An efficient and secure protocol in certified e-mail delivery is proposed in this paper. With the widespread use of public Internet, communication via electronic mail (e-mail) becomes a convenience application instead of traditional manuscript letter. People can easily append his/her digital signature to the e-mail in order to achieve the goal of non-repudiation of origin. However, the evidence of receipt still relies on the willingness of the recipient in the standard e-mail service. Hence, the recipient has no responsible for the received e-mail. In this paper, we present an efficient and secure protocol in fair certified e-mail delivery (CEMD). Our protocol efficiently provides non-repudiation of origin and receipt in the fair manner. In other words, the sender can obtain the irrefutable receipt if and only if the recipient gets the certified e-mail from the sender, otherwise, neither of them. Moreover, the proposed CEMD is efficiently in sending the other mails to the same recipient by using the pre-computation function. As the evaluations of computational cost and communication overhead, our protocol is cost-effective and efficient than other relevant protocols.

WSEAS Transactions on Information Science and Applications archive•Sep 1, 2008•5 citations

Verifiable encryption of digital signatures and applications

Giuseppe Ateniese

This paper presents a new simple schemes for verifiable encryption of digital signatures. We make use of a trusted third party (TTP) but in an optimistic sense, that is, the TTP takes part in the protocol only if one user cheats or simply crashes. Our schemes can be used as primitives to build efficient fair exchange and certified e-mail protocols.

ACM Transactions on Information and System Security•Feb 1, 2004•96 citations
In this paper we present two variant protocols DSA-CEMD1 and DSA-CEMD2 for certified e-mail delivery with DSA receipts. The protocols are based on a cryptographic primitive called Verifiable and Recoverable Encryption of a Signature (VRES) and are capable of achieving non-repudiation and strong fairness security properties. The novel design of the VRES primitive allows efficiency improvements in comparison with the related certified e-mail delivery protocols based on similar primitives. The protocols employ the services of an off-line and invisible trusted third party (TTP) only in case of dispute. In DSA-CEMD1 the content of the e-mail message is not revealed to the TTP during possible recovery and this is achieved at the cost of some additional cryptographic operations. In DSA-CEMD2 the confidentiality of the message is not protected from the TTP, but the protocol is slightly more efficient.
In 2005, A. Nenadic N. Zhang and Q. Shi proposed a new cryptographic primitive, called Verifiable and Recoverable Encryption of Signature VRES. Based on RSA-based VRES, they presented two variant protocols RSA-CEMD1 and RSA-CEMD2 for certified e-mail delivery with RSA receipts. They claimed that the protocols provided strong fairness to ensure that the recipient receives the e-mail if and only if the sender receives the receipt. Later, N. Zhang, Q. Shi, M. Merabti, and R. Askwith presented a practical and efficient fair document exchange protocol based on a verifiable and recoverable encryption of keys that is somewhat similar to the VRES. In this paper, we find that the VRES scheme is universal forgeable. Anyone can generate the false VRES for any message without the knowledge of any private key of the sender, the recipient and the TTP. It follows that the two variant protocols RSA-CEMD1, RSA-CEMD2 are all insecure. Meanwhile, we show that the document exchange protocol is not fair since the verifiable and recoverable encryption of keys is not recoverable.
Electronic mail delivery is one of the most important and desirable services, by which the intended recipient will get the mail if and only if the mail originator receives a valid and irrefutable proof of the receipt. The idea of conditional trusted third party has been developed on the basis of semi-trusted TTP and a suite of acceptable conditions is given. A new practical protocol for certified e-mail is presented, which can guarantee acceptable fair with interception of conditional TTP. More, the evidence in the new protocol is publicly verifiable without any restrictions on the type of signature and encryption algorithms.
This paper presents an efficient security protocol for certified e-goods delivery with the following features: (1) ensures strong fairness, (2) ensures non-repudiation of origin and non-repudiation of receipt, (3) allows the receiver of an e-goods to verify, during the protocol execution, that the e-goods he is about to receive is the one he is signing the receipt for, (4) does not require the active involvement of a fully trusted third party, but rather an off-line and transparent semi-trusted third party (STTP) only in cases of unfair behaviour by any party, and (5) provides confidentiality protection for the exchanged items from the STTP.
Abstract:- An efficient and secure protocol in certified e-mail delivery is proposed in this paper. With the widespread use of public Internet, communication via electronic mail (e-mail) becomes a convenience application instead of traditional manuscript letter. People can easily append his/her digital signature to the e-mail in order to achieve the goal of non-repudiation of origin. However, the evidence of receipt still relies on the willingness of the recipient in the standard e-mail service. Hence, the recipient has no responsible for the received e-mail. In this paper, we present an efficient and secure protocol in fair certified e-mail delivery (CEMD). Our protocol efficiently provides non-repudiation of origin and receipt in the fair manner. In other words, the sender can obtain the irrefutable receipt if and only if the recipient gets the certified e-mail from the sender, otherwise, neither of them. Moreover, the proposed CEMD is efficiently in sending the other mails to the same recipient by using the pre-computation function. As the evaluations of computational cost and communication overhead, our protocol is cost-effective and efficient than other relevant protocols.