An Efficient Non-transferable Proxy Re-encryption Scheme

  • S. Sharmila Deva Selvi
  • Arinjita Paul
  • C. Pandu Rangan
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 719)


Proxy re-encryption (PRE) allows re-encryption of a ciphertext for Alice (delegator) into a ciphertext for Bob (delegatee) via a semi-trusted proxy, who should not obtain the underlying plaintext. Alice generates a re-encryption key (re-key) for the proxy using which, the proxy transforms the ciphertexts. The basic notion of PRE provides security against the proxy from learning anything about the encrypted message given the re-encryption key. However, this is not sufficient in all situations as the proxy can collude with Bob and re-delegate Alice’s decryption rights. Hence, non-transferability is a desirable property in real-time scenarios wherein an illegal attempt to transfer Alice’s decryption rights exposes Bob’s private key as a penalty. In Pairing 2010, Wang et al. presented a CPA secure non-transferable Identity Based PRE scheme in the random oracle model. However, we show that the scheme violates the non-transferable property. Also, we present the first construction of a non-transferable unidirectional PRE scheme in the PKI setting using bilinear maps which meets CCA security under a variant of the decisional Diffie-Hellman hardness assumption in the random oracle model.


Proxy re-encryption Bilinear maps Public key Unidirectional Non-transferable 


  1. 1.
    Ateniese, G., Fu, K., Green, M., Hohenberger, S.: Improved proxy re-encryption schemes with applications to secure distributed storage. In Proceedings of the Network and Distributed System Security Symposium, NDSS 2005, San Diego, California, USA, pp. 29–43 (2005)Google Scholar
  2. 2.
    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
  3. 3.
    Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity-based encryption. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 207–222. Springer, Heidelberg (2004). doi: 10.1007/978-3-540-24676-3_13 CrossRefGoogle Scholar
  4. 4.
    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
  5. 5.
    Guo, H., Zhang, Z., Jing, X.: Non-transferable proxy re-encryption. IACR Cryptology ePrint Archive 2015:1216 (2015)Google Scholar
  6. 6.
    Hayashi, R., Matsushita, T., Yoshida, T., Fujii, Y., Okada, K.: Unforgeability of re-encryption keys against collusion attack in proxy re-encryption. In: Iwata, T., Nishigaki, M. (eds.) IWSEC 2011. LNCS, vol. 7038, pp. 210–229. Springer, Heidelberg (2011). doi: 10.1007/978-3-642-25141-2_14 CrossRefGoogle Scholar
  7. 7.
    He, Y.J., Chim, T.W., Hui, L.C.K., Yiu, S.M.: Non-transferable proxy re-encryption scheme. In: 5th International Conference on New Technologies, Mobility and Security, Istanbul, Turkey, NTMS 2012, 7–10 May 2012, pp. 1–4 (2012)Google Scholar
  8. 8.
    Isshiki, T., Nguyen, M.H., Tanaka, K.: Attacks to the proxy re-encryption schemes from IWSEC2011. In: Sakiyama, K., Terada, M. (eds.) IWSEC 2013. LNCS, vol. 8231, pp. 290–302. Springer, Heidelberg (2013). doi: 10.1007/978-3-642-41383-4_19 CrossRefGoogle Scholar
  9. 9.
    Libert, B., Vergnaud, D.: Tracing malicious proxies in proxy re-encryption. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 332–353. Springer, Heidelberg (2008). doi: 10.1007/978-3-540-85538-5_22 CrossRefGoogle Scholar
  10. 10.
    Libert, B., Vergnaud, D.: Unidirectional chosen-ciphertext secure proxy re-encryption. IEEE Trans. Inform. Theory 57(3), 1786–1802 (2011)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Sharmila Deva Selvi, S., Paul, A., Pandu Rangan, C.: An efficient non-transferable proxy re-encryption scheme (full version). Cryptology ePrint Archive, May 2017Google Scholar
  12. 12.
    Sree Vivek, S., Sharmila Deva Selvi, S., Radhakishan, V., Pandu Rangan, C.: Efficient conditional proxy re-encryption with chosen ciphertext security. Int. J. Network Secur. Appl. 4(2), 179–199 (2012)CrossRefGoogle Scholar
  13. 13.
    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). doi: 10.1007/978-3-642-17455-1_21 CrossRefGoogle Scholar
  14. 14.
    Yu, S., Wang, C., Ren, K., Lou, W.: Attribute based data sharing with attribute revocation. In: Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, ASIACCS 2010, Beijing, China, 13–16 April 2010, pp. 261–270 (2010)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2017

Authors and Affiliations

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

Personalised recommendations