Skip to main content
SpringerLink
Log in

Universally composable secure proxy re-signature scheme with effective calculation

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

In proxy re-signature scheme, the semi-trust proxy is given special information to convert user A’s signature into another user B’s signature on the same message m. This has numerous application, such as simplifying the certificate management by constructing a secure channel between two authentication centers, simplifying group signature management by making each signature transformed to the group’s signature, helping relieve some common key management headaches by resigning without the authentication center, and constructing digital right management (DRM) interoperable system by sharing the certification. In this paper, we proposed a novel proxy re-signature scheme with universally composable security. The proposed scheme is unidirectional, single-use, key optimal, non-transitive and non-temporary. Its security is based on Computational Diffie–Hellman assumption in the random oracle model. Furthermore, we present the universal composable based security definition of proxy re-signature, as well as the equivalent game based definition. If a scheme is proved to be safe in our game, it will have the universally composable property, which will simplify the future security analysis. Finally, we support the proposed scheme with detailed security and performance analysis.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Blaze, M., Bleumer, G., Strauss, M.: Divertible protocols and atomic proxy cryptography. In: EUROCRYPT1998. LNCS 1403, pp. 127–144, (1998)

  2. Blaze, M., Strauss, M.: Atomic Proxy Cryptography, Technical Reports. AT&T Research, Austin (1997)

    Google Scholar 

  3. Ateniese, G., Fu, K., Green, M., Hohenberger, S.: Improved proxy re-encryption schemes with applications to secure distributed storage. In: Network and distributed system security symposium, pp. 29–43, (2005)

  4. Ateniese, G., Hohenberger, S.: Proxy re-signatures: new definitions, algorithms, and applications. In: ACM CCS 2005, pp. 310–319, (2005)

  5. Taban, G., Cardenas, A.A., Gligor, V.D.: Towards a secure and interoperable DRM architecture. In: ACMDRM 2006, pp. 69–78, (2006)

  6. Dodis, Y., Ivan, A.: Proxy cryptography revisited. In: Network and distributed system security symposium, February (2003)

  7. Shao, J., Chao, Z., Wang, L., Liang, X.: Proxy re-signature schemes without random oracles. In: Indocrypt 2007, LNCS 4859, pp. 197–209, (2007)

  8. Kim, K., Yie, I., Lim, S.: Remark on Shao et al’s bidirectional proxy re-signature scheme in Indocrypt’07. Int. J. Netw. Secur. 9(1), 8–11 (2009)

    Google Scholar 

  9. Libert, B., Vergnaud, D.: Multi-use unidirectional proxy re-signatures. In: Proceedings of the 15th ACM conference on computer and communications security, (2008)

  10. Chow, S., Phan, R.: Proxy re-signatures in the standard model. In: ISC 2008, LNCS 5222, pp. 260–276, (2008)

  11. Chen, L., Chen, X., Sun, Y., Du, X.: A new certificate less proxy re-signature scheme in the standard model. In: 2014 Seventh international symposium on computational intelligence and design, pp. 202–206, (2014)

  12. Hu, X., Liu, Y., Xu, H., Wang, J., Zhang, X.: Analysis and improvement of certificateless signature and proxy re-signature schemes. In: IEEE advanced information technology. Electronic and automation control conference (IAEAC) 2015, pp. 166–170, (2015)

  13. Wang X.: Proxy re-signature supporting conditional delegation. In: 10th international conference on P2P, parallel, grid, cloud and internet computing, pp. 844-848, (2015)

  14. Vivek, S., Balasubramanian, G.: Controlled proxy re-signing-conditional proxy re-signatures. In: International conference on security & cryptography, (2015)

  15. Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings of the 42th IEEE symposium on foundations of computer science, pp. 136–158, (2001)

  16. Canetti, R., Hohenberger, S.: Chosen-ciphertext secure proxy re-encryption. In: ACM CCS 2007, pp. 185–194, (2007)

  17. Bellare, M., Pogaway, P.: Random oracles are practical: a paradigm from designing efficient protocols. In: ACM 1993, November, (1993)

  18. Backes, M., Hofheinz, D.: How to break and repair a universally composable signature fucntionality. In: ISC 2004, LNCS 3225, pp. 61–72, (2004)

  19. Barak, B., Canetti, R., Nielsen, J.B., Pass, R.: Universally composable protocols with relaxed set-up assumption. In: FoCS 2004, pp. 186–195, (2004)

  20. Ye, J., Zhou, X., Xu, Z., Ding, Y.: Verifiable outsourcing of high-degree polynomials and its application in keyword search. Intell. Autom. Soft Comput. doi:10.1080/10798587.2016.1267239

  21. Canetti, R.: Universally composable signature, certification, and authentication. In: Proceedings of the 17th computer security foundations workshop (CSFW), (2004)

  22. Ding, Y., Xu, Z., Ye, J., Choo, K.: Secure outsourcing of modular exponentiations under single untrusted programme model. J. Comput. Syst. Sci. doi:10.1016/j.jcss.2016.11.005

  23. Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17, 281–308 (1988)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  25. Boneh, D., Shacham, H., Lynn, B.: Short signature from the Weil pairing. Asiacrypt 2001. 514–532 (2001)

Download references

Acknowledgements

This work is supported by Shanghai Natural Science Foundation under Grant No. 14ZR1431000, the National Natural Science Foundation of China (NSFC) under Grant No. 61672355, Shanghai technology absorption and innovation project under Grant No. JJ-YJCX-01-15-5250, and The Shanghai Committee of Science and Technology under Grant No. 17070502800.

Author information

Authors and Affiliations

  1. Computer Science Department, Shanghai Normal University, Shanghai, 200234, China

    Xuan Hong, Jianhua Gao, Jianguo Pan & Bo Zhang

Authors
  1. Xuan Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianhua Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianguo Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bo Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bo Zhang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hong, X., Gao, J., Pan, J. et al. Universally composable secure proxy re-signature scheme with effective calculation. Cluster Comput 22 (Suppl 4), 10075–10084 (2019). https://doi.org/10.1007/s10586-017-1074-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-017-1074-2

Keywords

Search

Navigation