Skip to main content
SpringerLink
Log in

An Efficient Certificateless Proxy Re-Encryption Scheme Without Pairing

  • Conference paper
  • First Online:
Provable Security (ProvSec 2017)

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

Included in the following conference series:

Abstract

Proxy re-encryption (PRE) is a cryptographic primitive introduced by Blaze, Bleumer and Strauss [4] to provide delegation of decryption rights. PRE allows re-encryption of a ciphertext intended for Alice (delegator) to a ciphertext for Bob (delegatee) via a semi-honest proxy, who should not learn anything about the underlying message. In 2003, Al-Riyami and Patterson introduced the notion of certificateless public key cryptography which offers the advantage of identity-based cryptography without suffering from key escrow problem. The existing certificateless PRE (CLPRE) schemes rely on costly bilinear pairing operations. In ACM ASIA-CCS SCC 2015, Srinivasan \(et\ al.\) proposed the first construction of a certificateless PRE scheme without resorting to pairing in the random oracle model. In this work, we demonstrate a flaw in the CCA-security proof of their scheme. Also, we present the first construction of a CLPRE scheme without pairing which meets CCA security under the computational Diffie-Hellman hardness assumption in the random oracle model.

S. Sharmila Deva Selvi—Postdoctoral researcher supported by Project No. CCE/CEP/22/VK&CP/CSE/14-15 on Information Security & Awareness (ISEA) Phase-II by Ministry of Electronics & Information Technology, Government of India.

A. Paul and C. Pandu Rangan—Work partially supported by Project No. CCE/CEP/22/VK&CP/CSE/14-15 on ISEA-Phase II.

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 EPUB and 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

Notes

  1. 1.

    The definition of challenge derivative \((ID_i,C)\) is adopted from [5] as stated below:

    • \(\bullet \) Reflexitivity: \((ID_i,C)\) is a challenge derivative of itself.

    • \(\bullet \) Derivative by re-encryption: \((ID_j,C')\) is a challenge derivative of \((ID_i,C)\) if \(C'\leftarrow \mathcal {O}_{re}(ID_i,ID_j,C)\).

    • \(\bullet \) Derivative by re-encryption key: \((ID_j,C')\) is a challenge derivative of \((ID_i,C)\) if \(RK_{i\rightarrow j}\leftarrow \mathcal {O}_{rk}(ID_i,ID_j)\) and \(C'=Re-Encrypt(ID_i,ID_j,C,RK_{i\rightarrow j},params)\).

    .

References

  1. Al-Riyami, S.S., Paterson, K.G.: Certificateless public key cryptography. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 452–473. Springer, Heidelberg (2003). doi:10.1007/978-3-540-40061-5_29

    Chapter  Google Scholar 

  2. Ateniese, G., Fu, K., Green, M., Hohenberger, S.: Improved proxy re-encryption schemes with applications to secure distributed storage. In: IN NDSS (2005)

    Google Scholar 

  3. Ateniese, G., Kevin, F., Green, M., Hohenberger, S.: Improved proxy re-encryption schemes with applications to secure distributed storage. ACM Tran. Inf. Syst. Secur. (TISSEC) 9(1), 1–30 (2006)

    Article  MATH  Google Scholar 

  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). doi:10.1007/BFb0054122

    Google Scholar 

  5. Chow, S.S.M., Weng, J., Yang, Y., Deng, R.H.: Efficient unidirectional proxy re-encryption. In: Bernstein, D.J., Lange, T. (eds.) AFRICACRYPT 2010. LNCS, vol. 6055, pp. 316–332. Springer, Heidelberg (2010). doi:10.1007/978-3-642-12678-9_19

    Chapter  Google Scholar 

  6. Guo, H., Zhang, Z., Zhang, J., Chen, C.: Towards a secure certificateless proxy re-encryption scheme. In: Susilo, W., Reyhanitabar, R. (eds.) ProvSec 2013. LNCS, vol. 8209, pp. 330–346. Springer, Heidelberg (2013). doi:10.1007/978-3-642-41227-1_19

    Chapter  Google Scholar 

  7. Schnorr, C.-P.: Efficient signature generation by smart cards. J. Cryptol. 4(3), 161–174 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  8. Sharmila Deva Selvi, S., Paul, A., Pandu Rangan, C.: An efficient certificateless proxy re-encryption scheme without pairing. Cryptology ePrint Archive, Report 2017/768 (2017). http://eprint.iacr.org/2017/768

  9. Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985). doi:10.1007/3-540-39568-7_5

    Chapter  Google Scholar 

  10. Srinivasan, A., Pandu Rangan, C.: Certificateless proxy re-encryption without pairing: revisited. In: Proceedings of the 3rd International Workshop on Security in Cloud Computing, SCC@ASIACCS 2015, Singapore, Republic of Singapore, 14 April 2015, pp. 41–52 (2015)

    Google Scholar 

  11. Sur, C., Jung, C.D., Park, Y., Rhee, K.H.: Chosen-ciphertext secure certificateless proxy re-encryption. In: De Decker, B., Schaumüller-Bichl, I. (eds.) CMS 2010. LNCS, vol. 6109, pp. 214–232. Springer, Heidelberg (2010). doi:10.1007/978-3-642-13241-4_20

    Chapter  Google Scholar 

  12. Yang, K., Xu, J., Zhang, Z.: Certificateless proxy re-encryption without pairings. In: Lee, H.-S., Han, D.-G. (eds.) ICISC 2013. LNCS, vol. 8565, pp. 67–88. Springer, Cham (2014). doi:10.1007/978-3-319-12160-4_5

    Google Scholar 

  13. Zheng, Y., Tang, S., Guan, C., Chen, M.-R.: Cryptanalysis of a certificateless proxy re-encryption scheme. In: 2013 Fourth International Conference on Emerging Intelligent Data and Web Technologies, Xi’an, Shaanxi, China, 9–11 September 2013, pp. 307–312 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Theoretical Computer Science Lab, Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India

    S. Sharmila Deva Selvi, Arinjita Paul & Chandrasekaran Pandu Rangan

Authors
  1. S. Sharmila Deva Selvi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arinjita Paul
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chandrasekaran Pandu Rangan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arinjita Paul .

Editor information

Editors and Affiliations

  1. NTT Laboratories, Tokyo, Japan

    Tatsuaki Okamoto

  2. Shaanxi Normal University, Xi’an, China

    Yong Yu

  3. Hong Kong Polytechnic University, Hong Kong, China

    Man Ho Au

  4. University of Wollongong, Wollongong, New South Wales, Australia

    Yannan Li

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Sharmila Deva Selvi, S., Paul, A., Pandu Rangan, C. (2017). An Efficient Certificateless Proxy Re-Encryption Scheme Without Pairing. In: Okamoto, T., Yu, Y., Au, M., Li, Y. (eds) Provable Security. ProvSec 2017. Lecture Notes in Computer Science(), vol 10592. Springer, Cham. https://doi.org/10.1007/978-3-319-68637-0_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-68637-0_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-68636-3

  • Online ISBN: 978-3-319-68637-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation