Skip to main content

Stateless-Recipient Certified E-Mail System Based on Verifiable Encryption

  • Conference paper
  • First Online:
Topics in Cryptology — CT-RSA 2002 (CT-RSA 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2271))

Included in the following conference series:

Abstract

In this paper we present a certified e-mail system which provides fairness while making use of a TTP only in exceptional circumstances. Our system guarantees that the recipient gets the content of the e-mail if and only if the sender receives an incontestable proof-of-receipt. Our protocol involves two communicating parties, a sender and a recipient, but only the recipient is allowed to misbehave. Therefore, in case of dispute, the sender solicits TTP’s arbitration without involving the recipient. This feature makes our protocols very attractive in real-world environments in which recipients would prefer to assume a passive role rather than being actively involved in dispute resolutions caused by malicious senders. In addition, in our protocol, the recipient can be stateless, i.e., it does not need to keep state to ensure fairness.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Asokan, V. Shoup, and M. Waidner, “Optimistic fair exchange of digital signatures,” IEEE Journal on Selected Area in Communications, 2000.

    Google Scholar 

  2. N. Asokan, V. Shoup, and M. Waidner, “Asynchronous protocols for optimistic fair exchange,” in Proceedings of the IEEE Symposium on Research in Security and Privacy (I. C. S. Press, ed.), pp. 86–99, May 1998.

    Google Scholar 

  3. G. Ateniese, “Efficient verifiable encryption (and fair exchange) of digital signatures,” in Proceedings of the 6th ACM Conference on Computer and Communications Security, ACM Press, 1999.

    Google Scholar 

  4. G. Ateniese, B. de Medeiros, M.T. Goodrich. TRICERT: Distributed Certified Email Schemes. In ISOC 2001 Network and Distributed System Security Symposium (NDSS’01), San Diego, CA, USA, 2001.

    Google Scholar 

  5. M. Ben-Or, O. Goldreich, S. Micali, and R. Rivest, “A fair protocol for signing contracts,” IEEE Transactions on Information Theory IT-36(1), pp. 40–46, 1990.

    Google Scholar 

  6. A. Bahreman and J. D. Tygar, “Certified electronic mail,” in Proceedings of Symposium on Network and Distributed Systems Security (I. Society, ed.), pp. 3–19, February 1994.

    Google Scholar 

  7. F. Bao, R. H. Deng, and W. Mao. Efficient and Practical Fair Exchange Protocols with Off-line TTP. In IEEE Symposium on Security and Privacy, Oakland, California, 1998.

    Google Scholar 

  8. J. Camenisch and M. Michels. Proving in zero-knowledge that a number is the product of two safe primes. In Advances in Cryptology-EUROCRYPT’99, Lecture Notes in Computer Science, Springer-Verlag, 1999.

    Google Scholar 

  9. D. Chaum and T. Pedersen.Wallet databases with observers. In Advances in Cryptology-Crypto’ 92, pages 89–105, 1992.

    Google Scholar 

  10. R. Cramer and V. Shoup. Signature Schemes Based on the Strong RSA Assumption. In 6th ACM Conference on Computer and Communication Security, ACM Press, 1999.

    Google Scholar 

  11. R. H. Deng, L. Gong, A. Lazar, and W. Wang, “Practical protocols for certified electronic e-mail,” Journal of Networks and Systems Management, vol. 4, no. 3, pp. 279–297, 1996.

    Article  Google Scholar 

  12. S. Even, O. Goldreich, and A. Lempel, “A randomized protocol for signing contracts,” Comm. ACM 28, no. 6, pp. 637–647, 1985.

    Article  MathSciNet  Google Scholar 

  13. A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In Advances in Cryptology-CRYPTO’86, volume 263 of Lecture Notes in Computer Science, pages 186–194, Springer-Verlag, 1987.

    Google Scholar 

  14. R. Gennaro, S. Halevi, and T. Rabin. Secure signatures, without trees or random oracles. In Advances in Cryptology-EUROCRYPT’99, volume 1592 of Lecture Notes in Computer Science, pages 123–139, Springer-Verlag, 1999.

    Google Scholar 

  15. L. C. Guillou and J. J. Quisquater. A paradoxical identity-based signature scheme resulting from zero-knowledge. In Advances in Cryptology-CRYPTO’88, volume 403 of Lecture Notes in Computer Science, pages 216–231, Springer-Verlag, 1988.

    Google Scholar 

  16. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of applied cryptography. CRC Press, 1996. ISBN 0-8493-8523-7.

    Google Scholar 

  17. S. Micali. Simultaneous electronic transactions. Technical Report 566420, http://www.delphion.com/cgi-bin/viewpat.cmd/US566420, 1997.

  18. OpenSSL Project team, “Openssl,” May 1999. http://www.openssl.org/.

  19. J. Riordan and B. Schneier, “A certified e-mail protocol,” in 13th Annual Computer Security Applications Conference, pp. 100–106, December 1998.

    Google Scholar 

  20. R. L. Rivest, A. Shamir, and L. M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120–126, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  21. C.P. Schnorr. Efficient signature generation by smart-cards. Journal of Cryptology, 4(3):161–174, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  22. J. Zhou and D. Gollmann, “Certified electronic mail,” in Proceedings of Computer Security-ESORICS’96 (S. Verlag, ed.), pp. 55–61, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ateniese, G., Nita-Rotaru, C. (2002). Stateless-Recipient Certified E-Mail System Based on Verifiable Encryption. In: Preneel, B. (eds) Topics in Cryptology — CT-RSA 2002. CT-RSA 2002. Lecture Notes in Computer Science, vol 2271. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45760-7_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-45760-7_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43224-1

  • Online ISBN: 978-3-540-45760-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics