An Efficient Certificateless Proxy Re-Encryption Scheme Without Pairing

  • S. Sharmila Deva Selvi
  • Arinjita Paul
  • Chandrasekaran Pandu Rangan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10592)

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.

Keywords

Proxy re-encryption Pairing-less Public key Certificateless Unidirectional 

References

  1. 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 CrossRefGoogle Scholar
  2. 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. 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)CrossRefMATHGoogle Scholar
  4. 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. 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 CrossRefGoogle Scholar
  6. 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 CrossRefGoogle Scholar
  7. 7.
    Schnorr, C.-P.: Efficient signature generation by smart cards. J. Cryptol. 4(3), 161–174 (1991)MathSciNetCrossRefMATHGoogle Scholar
  8. 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. 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 CrossRefGoogle Scholar
  10. 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. 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 CrossRefGoogle Scholar
  12. 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. 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

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • S. Sharmila Deva Selvi
    • 1
  • Arinjita Paul
    • 1
  • Chandrasekaran Pandu Rangan
    • 1
  1. 1.Theoretical Computer Science Lab, Department of Computer Science and EngineeringIndian Institute of Technology MadrasChennaiIndia

Personalised recommendations