An Identity-Based Proxy Re-Encryption Scheme with Source Hiding Property, and its Application to a Mailing-List System | SpringerLink
Skip to main content

An Identity-Based Proxy Re-Encryption Scheme with Source Hiding Property, and its Application to a Mailing-List System

  • Conference paper
Public Key Infrastructures, Services and Applications (EuroPKI 2010)

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

Included in the following conference series:

Abstract

Identity-Based Proxy Re-Encryption (IB-PRE) has been proposed by Green and Ateniese (ACNS2007), where the proxy transforms a source ciphertext encrypted by a delegator’s identity into a destination ciphertext that can be decrypted using a delegatee’s secret key corresponding to the delegatee’s identity. By using IB-PRE, we expect that mailing-list systems can be constructed without public key certificates. However, in all previous IB-PRE, information about whether a source ciphertext (encrypted by a mailing-list address) is the source of a destination ciphertext (encrypted by an e-mail address) or not, is revealed from both the source ciphertext and the destination ciphertext. In this paper, for the first time we propose an IB-PRE scheme with source hiding property, where no information about source identity is revealed from the destination ciphertext. Our work is the valuable and important milestone for establishing the secure PRE-based mailing-list system without public key certificates.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. Ateniese, G., Benson, K., Hohenberger, S.: Key-private proxy re-encryption. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 279–294. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  2. Ateniese, G., Fu, K., Green, M., Hohenberger, S.: Improved proxy re-encryption schemes with applications to secure distributed storage. ACM Trans. Inf. Syst. Secur. 9(1), 1–30 (2006)

    Article  MATH  Google Scholar 

  3. Barr, D.: Majordomo, http://www.greatcircle.com/majordomo/

  4. Blaze, M., Bleumer, G., Strauss, M.: Divertible protocols and atomic proxy cryptography. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 127–144. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Bobba, R., Muggli, J., Pant, M., Basney, J., Khurana, H.: Usable secure mailing lists with untrusted servers. In: IDtrust, pp. 103–116 (2009)

    Google Scholar 

  6. Boneh, D., Franklin, M.K.: Identity-based encryption from the weil pairing. SIAM J. Comput. 32(3), 586–615 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Boyen, X., Waters, B.: Anonymous hierarchical identity-based encryption (Without random oracles). In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 290–307. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Chu, C.-K., Tzeng, W.-G.: Identity-based proxy re-encryption without random oracles. In: Garay, J.A., Lenstra, A.K., Mambo, M., Peralta, R. (eds.) ISC 2007. LNCS, vol. 4779, pp. 189–202. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Fang, L., Susilo, W., Wang, J.: Anonymous conditional proxy re-encryption without random oracle. In: Pieprzyk, J., Zhang, F. (eds.) ProvSec 2009. LNCS, vol. 5848, pp. 47–60. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  11. Green, M., Ateniese, G.: Identity-based proxy re-encryption. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 288–306. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Hu, X., Chen, X., Huang, S.: Fully secure identity based proxy re-encryption schemes in the standard model. In: ICCSIT 2008: Proceedings of the 2008 International Conference on Computer Science and Information Technology, pp. 53–57. IEEE Computer Society, Washington, DC, USA (2008)

    Chapter  Google Scholar 

  13. Ibraimi, L., Tang, Q., Hartel, P.H., Jonker, W.: A type-and-identity-based proxy re-encryption scheme and its application in healthcare. In: Jonker, W., Petković, M. (eds.) SDM 2008. LNCS, vol. 5159, pp. 185–198. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Free Software Foundation Inc. Mailman, the GNU Mailing List Manager, http://www.list.org/

  15. Khurana, H., Hahm, H.-S.: Certified mailing lists. In: ASIACCS, pp. 46–58 (2006)

    Google Scholar 

  16. Khurana, H., Heo, J., Pant, M.: From proxy encryption primitives to a deployable secure-mailing-list solution. In: Ning, P., Qing, S., Li, N. (eds.) ICICS 2006. LNCS, vol. 4307, pp. 260–281. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Khurana, H., Slagell, A.J., Bonilla, R.: SELS: a secure e-mail list service. In: SAC, pp. 306–313 (2005)

    Google Scholar 

  18. Libert, B., Vergnaud, D.: Unidirectional chosen-ciphertext secure proxy re-encryption. In: Cramer, R. (ed.) PKC 2008. LNCS, vol. 4939, pp. 360–379. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  19. Matsuo, T.: Proxy re-encryption systems for identity-based encryption. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 247–267. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  20. Shao, J., Cao, Z.: CCA-secure proxy re-encryption without pairings. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 357–376. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  21. Shao, J., Cao, Z., Liu, P.: SCCR: a generic approach to simultaneously achieve CCA security and collusion-resistance in proxy re-encryption. Security and Communication Networks (2), 1–16 (2009)

    Google Scholar 

  22. Tang, Q., Hartel, P.H., Jonker, W.: Inter-domain identity-based proxy re-encryption. In: Yung, M., Liu, P., Lin, D. (eds.) Inscrypt 2008. LNCS, vol. 5487, pp. 332–347. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  23. Wang, L., Wang, L., Mambo, M., Okamoto, E.: New identity-based proxy re-encryption schemes to prevent collusion attacks. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol. 6487, pp. 327–346. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Emura, K., Miyaji, A., Omote, K. (2011). An Identity-Based Proxy Re-Encryption Scheme with Source Hiding Property, and its Application to a Mailing-List System. In: Camenisch, J., Lambrinoudakis, C. (eds) Public Key Infrastructures, Services and Applications. EuroPKI 2010. Lecture Notes in Computer Science, vol 6711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22633-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22633-5_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22632-8

  • Online ISBN: 978-3-642-22633-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics