Timed-Release Encryption with Pre-open Capability and Its Application to Certified E-mail System

  • Yong Ho Hwang
  • Dae Hyun Yum
  • Pil Joong Lee
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3650)


We propose timed-release encryption with pre-open capability. In this model, the sender chooses a release time to open the message and a release key to pre-open, and encrypts the message using them. The receiver can decrypt the message only after the release time. When the sender wants the message to be opened before the release time, he may publish the release key. Then, the receiver can decrypt the message from his private key and the release key before the release time. However, an adversary cannot extract any information at any time even with the release key. We formalize the security model and provide an efficient construction secure under the BDH assumption in the random oracle model. In addition, we discuss the application of our schemes to efficient fair exchange systems such as a certified e-mail system.


Time Server Release Time Random Oracle Random Oracle Model Fair Exchange 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ateniese, G.: Verifiable encryption of digital signatures and applications. ACM Transactions on Information and System Security 7(1), 1–20 (2004) (Parts of this paper appeared in ACM CCS 1999 and in CT-RSA 2002)CrossRefGoogle Scholar
  2. 2.
    Ateniese, G., Medeiros, B., Goodrich, M.T.: TRICERT: a distributed certified e-mail scheme. In: ISOC NDSS 2001 (2001)Google Scholar
  3. 3.
    Asokan, N., Shoup, V., Waidner, M.: Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas of Communications 18(4), 591–610 (2000) (Extended abstract of this paper appeared in EUROCRYPT 1998)CrossRefGoogle Scholar
  4. 4.
    Blake, I.F., Chan, A.C.-F.: Scalable, server-passive, user-anonymous timed release public key encryption from bilinear pairing. Cryptology ePrint Archive (2004), Available at
  5. 5.
    Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schems. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 26–45. Springer, Heidelberg (1998)Google Scholar
  6. 6.
    Boneh, D., Franklin, M.: Identity based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  7. 7.
    Boneh, D., Lynn, B., Shacham, H.: Short signature from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  8. 8.
    Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: ACM CCS 1993, pp. 62–73 (1993)Google Scholar
  9. 9.
    Crescenzo, G.D., Ostrovsky, R., Rajagopalan, S.: Conditional oblivious transfer and timed-release encryption. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 74–89. Springer, Heidelberg (1999)Google Scholar
  10. 10.
    Joux, A.: The Weil and Tate pairing as building blocks for public key cryptosystems. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 20–32. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  11. 11.
    Libert, B., Quisquater, J.-J.: Efficient signcryption with key privacy from Gap Diffie-Hellman groups. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 187–200. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  12. 12.
    May, T.C.: Timed-releas crypto. Manuscript (1993), Available at
  13. 13.
    Micali, S.: Simple and fast optimistic protocols for fair electronic exchange. In: PODC 2003, pp. 12–19 (2003)Google Scholar
  14. 14.
    Osipkov, I., Kim, Y., Cheon, J.H.: Timed-release public key based authetnicated encryption. Cryptology ePrint Archive (2004), Available at
  15. 15.
    Okamoto, T., Pointcheval, D.: REACT: rapid enhanced-security asymmetric cryptosystem transform. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 159–174. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  16. 16.
    Pfitzmann, B., Schunter, M., Waidnet, M.: Optinal efficiency of optimistic contract signing. In: PODC 1998, pp. 113–122 (1998)Google Scholar
  17. 17.
    Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. MIT LCS Tech. Report MIT/LCS/TR-684 (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Yong Ho Hwang
    • 1
  • Dae Hyun Yum
    • 1
  • Pil Joong Lee
    • 1
  1. 1.Dept. of Electronic and Electrical EngPOSTECHPohangKorea

Personalised recommendations