Proxy Re-signature Schemes Without Random Oracles

  • Jun Shao
  • Zhenfu Cao
  • Licheng Wang
  • Xiaohui Liang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4859)


To construct a suitable and secure proxy re-signature scheme is not an easy job, up to now, there exist only three schemes, one is proposed by Blaze et al. [6] at EUROCRYPT 1998, and the others are proposed by Ateniese and Hohenberger [2] at ACM CCS 2005. However, none of these schemes is proved in the standard model (i.e., do not rely on the random oracle heuristic). In this paper, based on Waters’ approach [20], we first propose a multi-use bidirectional proxy re-signature scheme, denoted as S mb , which is existentially unforgeable in the standard model. And then, we extend S mb to be a multi-use bidirectional ID-based proxy re-signature scheme, denoted by S id − mb, which is also existentially unforgeable in the standard model. Both of these two proposed schemes are computationally efficient, and their security bases on the Computational Diffie-Hellman (CDH) assumption.


proxy re-signature standard model ID-based bilinear maps existential unforgeability 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    An, J.H., Dodis, Y., Rabin, T.: On the Security of Joint Signature and Encrption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 83–107. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  2. 2.
    Ateniese, G., Hohenberger, S.: Proxy Re-Signatures: New Definitions, Algorithms, and Applications. In: ACM CCS 2005, pp. 310–319 (2005)Google Scholar
  3. 3.
    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
  4. 4.
    Boneh, D., Boyen, X.: Secure Identity Based Encryption Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 443–459. Springer, Heidelberg (2004)Google Scholar
  5. 5.
    Bellare, M., Boldyreva, A., Palacio, A.: An uninstantiable random-oracle-model scheme for a hybrid-encryption problem. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 171–188. Springer, Heidelberg (2004)Google Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. SIAM Journal of Computing 32(3), 586–615 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Canetti, R., Hohenberger, S.: Chosen-ciphertext secure proxy re-encryption. Cryptology ePrint Archieve: Report 2007/171(2007)Google Scholar
  9. 9.
    Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. In: STOC 1998, pp. 209–218 (1998)Google Scholar
  10. 10.
    Cramer, R., Shoup, V.: Signature schemes based on the strong RSA assumption. ACM TISSEC 3(3), 161–185 (2000)CrossRefGoogle Scholar
  11. 11.
    Galindo, D., Herranz, J., Kiltz, E.: On the Generic Construction of Identity-Based Signatures with Additional Properties. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 178–193. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  12. 12.
    Gennaro, R., Halevi, S., Rabin, T.: Secure hash-and-sign signatures without the random oracle. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 123–139. Springer, Heidelberg (1999)Google Scholar
  13. 13.
    Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing 17(2), 281–308 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Naccache, D.: Secure and Practical Identity-based encryption. Cryptology ePrint Archive, Report 2005/369Google Scholar
  15. 15.
    Paterson, K.G., Schuldt, J.C.N.: Efficient Identity-based Signatures Secure in the Standard Model. In: Batten, L.M., Safavi-Naini, R. (eds.) ACISP 2006. LNCS, vol. 4058, pp. 207–222. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  16. 16.
    Sarkar, P., Chatterjee, S.: Trading time for space: Towards an efficient IBE scheme with short(er) public parameters in the standard model. In: Won, D.H., Kim, S. (eds.) ICISC 2005. LNCS, vol. 3935, pp. 424–440. Springer, Heidelberg (2006)Google Scholar
  17. 17.
    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)CrossRefGoogle Scholar
  18. 18.
    Shao, J., Cao, Z., Wang, L., Liang, X.: Proxy Re-signature Scheme without Random Oracles. Cryptology ePrint Archive, Report (2007)Google Scholar
  19. 19.
    Taban, G., Cárdenas, A.A., Gligor, V.D.: Towards a Secure and Interoperable DRM Architecture. In: ACM DRM 2006, pp. 69–78 (2006)Google Scholar
  20. 20.
    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
  21. 21.
    Zhang, F., Chen, X., Susilo, W., Mu., Y.: A New Short Signature Scheme without Random Oracles from Bilinear Pairings. In: Nguyen, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol. 4341, pp. 67–80. Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Jun Shao
    • 1
  • Zhenfu Cao
    • 1
  • Licheng Wang
    • 1
  • Xiaohui Liang
    • 1
  1. 1.Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200240, ShanghaiP.R. China

Personalised recommendations