Skip to main content
SpringerLink
Log in

Identity-Based Encryption: How to Decrypt Multiple Ciphertexts Using a Single Decryption Key

  • Conference paper
Pairing-Based Cryptography – Pairing 2007 (Pairing 2007)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 4575))

Included in the following conference series:

Abstract

The beauty of identity-based encryption (IBE) lies in the convenience of public key handling, in the sense that any identification such as an email address, a name, or an IP number can serve as a public key of a party. However, such convenience is not inherited by a system where a party possesses many identities (e.g., many email addresses) and has to use them as his public keys. When this system is handled with a standard IBE, the user must manage all the private keys that are associated with all the public keys (identities). However, keeping these private keys is inconvenient to the user. In this paper, we solve this problem by proposing a novel identity-based encryption where we set a private key that maps multiple public keys (identities); namely, we can use a private key to decrypt multiple ciphertexts; each was encrypted with a different public key (identity).

Supported by National Natural Science Foundation of China (#60502047), Education Bureau of Fujian Province (#JB05329), Science and Technology of Fujian Province (2006F5036) and Open Funds of Key Lab of Fujian Province University Network Security and Cryptology (07B001).

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

Access this chapter

Log in via an institution
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. Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 26–45. Springer, Heidelberg (1998)

    Google Scholar 

  2. Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: ACM conference on Computers and Communication Security, pp. 62–73 (1993)

    Google Scholar 

  3. Benaloh, J., de Mare, M.: One-way accumulators: a decentralized al- ternative to digital signatures. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 274–285. Springer, Heidelberg (1994)

    Google Scholar 

  4. Boneh, D., Boyen, X.: Efficient selective-id secure identity based encryption without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 223–238. Springer, Heidelberg (2004)

    Google Scholar 

  5. Boneh, D., Boyen, X.: Short Signatures Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56–73. Springer, Heidelberg (2004)

    Google Scholar 

  6. Boneh, D., Boyen, X., Goh, E.-J.: Hierarchical Identity Based Encryption with Constant Size Ciphertext. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 440–456. Springer, Heidelberg (2005)

    Google Scholar 

  7. 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)

    Chapter  Google Scholar 

  8. Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13–25. Springer, Heidelberg (1998)

    Google Scholar 

  9. Cheon, J.H.: Security analysis of the Strong Diffie-Hellman problem. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 1–11. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Canetti, R., Halevi, S., Katz, J.: A forward-secure public key encryption scheme. In: Biham, E. (ed.) Advances in Cryptology – EUROCRPYT 2003. LNCS, vol. 2656, Springer, Heidelberg (2003)

    Google Scholar 

  11. Chen, L., Harrison, K., Smart, N.P., Soldera, D.: Applications of Multiple Trust Authorities in pairing based Cryptosystems. In: Davida, G.I., Frankel, Y., Rees, O. (eds.) InfraSec 2002. LNCS, vol. 2437, pp. 260–275. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and applications to efficient revocation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 61–76. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Chatterjee, S., Sarkar, P.: Constant Size Ciphertext HIBE in the Augmented Selective-ID Model and its Extensions http://eprint.iacr.org/2007/084

  14. Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 537–554. Springer, Heidelberg (1999)

    Google Scholar 

  15. Gangishetti, R., Gorantla, M.C., Das, M.L., Saxena, A., Gulati, V.P.: An Efficient Secure Key Issuing Protocol in ID-Based Cryptosystems. In: Proceedings of the International Conference on Information Technology: Coding and Computin (ITCC 2005), vol. 1, pp. 674–678. IEEE Computer Society, Los Alamitos (2005)

    Chapter  Google Scholar 

  16. Gentry, C.: Practical Identity-Based Encryption Without Random Oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 445–464. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Gentry, C., Silverberg, A.: Hierarchical ID-based cryptography. In: Zheng, Y., Zheng, Y. (eds.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 548–566. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  18. Horwitz, J., Lynn, B.: Towards hierarchical identity-based encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 466–481. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  19. Kumar, K.P., Shailaja, G., Saxena, A.: Secure and Efficient Threshold Key Issuing Protocol for ID-based Cryptosystems http://eprint.iacr.org/2006/245

  20. Lee, B., Boyd, C., Dawson, E., Kim, K., Yang, J., Yoo, S.: Secure Key Issuing in ID-based Cryptography. In: proceedings of the Second Australian Information Security Workshop-AISW 2004, ACS Conferences in Research and Practice in Information Technology, vol. 32, pp. 69–74 (2004)

    Google Scholar 

  21. Mitsunari, S., Sakai, R., Kasahara, M.: A new traitor tracing. IEICE Trans E85-A(2), 481–484 (2002)

    Google Scholar 

  22. Menezes, A., Okamoto, T., Vanstone, S.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Tran. on Info. Th. 39, 1639–1646 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  23. Nguyen, L.: Accumulators from Bilinear Pairings and Applications. In: Menezes, A.J. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 275–292. Springer, Heidelberg (2005)

    Google Scholar 

  24. Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  25. Sui, A., Chow, S.S.M., Hui, L.C.K., Yiu, S.M., Chow, K.P., Tsang, W.W., Chong, C.F., Pun, K.H., Chan, H.W.: Seperable and Anonymous Identity-Based Key Issuing without Secure Channel. In: Proc. of the 11th Intermational Comference on Parallel and Distributed Systems (ICPADS 2005), vol. 2, pp. 275–279 (2005)

    Google Scholar 

  26. Waters, B.: Efficient Identity-Based Encryption without Random Oracles. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114–127. Springer, Heidelberg (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Key Lab of Network Security and Cryptology, School of Mathematics and Computer Science, Fujian Normal University, Fuzhou, China

    Fuchun Guo & Zhide Chen

  2. School of Computer Science and Software Engineering, University of Wollongong, Wollongong NSW 2522, Australia

    Yi Mu

Authors
  1. Fuchun Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yi Mu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhide Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tsuyoshi Takagi Tatsuaki Okamoto Eiji Okamoto Takeshi Okamoto

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guo, F., Mu, Y., Chen, Z. (2007). Identity-Based Encryption: How to Decrypt Multiple Ciphertexts Using a Single Decryption Key. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds) Pairing-Based Cryptography – Pairing 2007. Pairing 2007. Lecture Notes in Computer Science, vol 4575. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73489-5_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73489-5_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73488-8

  • Online ISBN: 978-3-540-73489-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation