Revocable identity-based proxy re-signature scheme in the standard model

被引:0
|
作者
Yang X. [1 ,2 ]
Li Y. [1 ]
Wang J. [1 ]
Ma T. [1 ]
Wang C. [1 ]
机构
[1] College of Computer Science and Engineering, Northwest Normal University, Lanzhou
[2] State Key Laboratory of Cryptology, Beijing
来源
基金
中国博士后科学基金; 中国国家自然科学基金;
关键词
Binary tree; Identity-based proxy re-signature; Signing key exposure; Standard model; User revocation;
D O I
10.11959/j.issn.1000-436x.2019072
中图分类号
学科分类号
摘要
User revocation is necessary to the practical application of identity-based proxy re-signature scheme. To solve the problem that the existing identity-based proxy re-signature schemes cannot provide revocation functionality, the notion of revocable identity-based proxy re-signature was introduced. Furthermore, the formal definition and security model of revocable identity-based proxy re-signature were presented. Based on proxy re-signature scheme and binary tree structure, a revocable identity-based proxy re-signature scheme was proposed. In the proposed, scheme, the user's signing key consists of two parts, a secret key and an update key. The secret key transmitted over the secure channel is fixed, but the update key broadcasted by the public channel is periodically changed. Only the user who has not been revoked can obtain the update key, and then randomize the secret key and update the key to generate the corresponding signature key of the current time period. In the standard model, the proposed scheme is proved to be existentially unforgeable against adaptive chosen-identity and chosen-message attacks. In addition, the proposed scheme has properties of bidirectionality and multi-use, and can resist signing key exposure attacks. The analysis results show that the proposed scheme can efficiently revoke the user and update the user's key, and thus it has good scalability. © 2019, Editorial Board of Journal on Communications. All right reserved.
引用
收藏
页码:153 / 162
页数:9
相关论文
共 26 条
  • [1] Yang T., Yu B., Wang H., Et al., Cryptanalysis and improvement of Panda-public auditing for shared data in cloud and internet of things, Multimedia Tools and Applications, 76, 19, pp. 19411-19428, (2017)
  • [2] Sookhak M., Gani A., Khan M.K., Et al., Dynamic remote data auditing for securing big data storage in cloud computing, Information Sciences, 380, pp. 101-116, (2017)
  • [3] Waters B., Efficient identity-based encryption without random oracles, The 24th Annual International Conference on the Theory and Application of Cryptographic Techniques, pp. 114-127, (2005)
  • [4] Shao J., Cao Z., Wang L., Et al., Proxy re-signature schemes without random oracles, The 8th International Conference on Cryptology, pp. 197-209, (2007)
  • [5] Feng J., Lan C., Jia B., ID-based proxy re-signature scheme with strong unforgeability, Journal of Computer Applications, 34, 11, pp. 3291-3294, (2014)
  • [6] Hu X., Zhang Z., Yang Y., Identity based proxy re-signature schemes without random oracle, Computational Intelligence and Security, pp. 256-259, (2009)
  • [7] Shao J., Wei G., Ling Y., Et al., Unidirectional identity-based proxy re-signature, IEEE International Conference on Communications, pp. 1-5, (2011)
  • [8] Huang P., Yang X., Yan L.I., Et al., Identity-based proxy re-signature scheme without bilinear pairing, Journal of Computer Applications, 35, 6, pp. 1678-1682, (2015)
  • [9] Jiang M.M., Hu Y.P., Wang B.C., Et al., Identity-based unidirectional proxy re-signature over lattice, Journal of Electronics & Information Technology, 36, 3, pp. 645-649, (2014)
  • [10] Tian M.M., Identity-based proxy re-signatures from lattices, Information Processing Letters, 115, 4, pp. 462-467, (2015)