A Group Proxy Signature Scheme Based on Sub-Secret Evolution

Gu Ke; Jia Weijia; Jiang Chunlin

Journal of Computer Research and Development > 2012 > 49(5): 962-973.

Gu Ke, Jia Weijia, Jiang Chunlin. A Group Proxy Signature Scheme Based on Sub-Secret Evolution[J]. Journal of Computer Research and Development, 2012, 49(5): 962-973.

Citation:

Gu Ke, Jia Weijia, Jiang Chunlin. A Group Proxy Signature Scheme Based on Sub-Secret Evolution[J]. Journal of Computer Research and Development, 2012, 49(5): 962-973.

Citation:

Gu Ke, Jia Weijia, Jiang Chunlin. A Group Proxy Signature Scheme Based on Sub-Secret Evolution[J]. Journal of Computer Research and Development, 2012, 49(5): 962-973.

PDF (1181 KB)

A Group Proxy Signature Scheme Based on Sub-Secret Evolution

1(School of Information Science and Engineering, Central South University, Changsha 410083) 2(Department of Computer Science, City University of Hong Kong, Hong Kong)

More Information

Published Date: May 14, 2012

Graphical Abstract

Abstract

Abstract

Few sharing methods of delegating information are used in current group proxy signature schemes. A new secure group proxy signature scheme based on sub-secret evolution is proposed in this paper, which is based on CDHP and bilinear pairings. In this scheme, double sub-secret of delegating information is constructed by secret sharing method and cellular automata theory so that sharing secrets can be evolved with the number of proxy signatures. And the correctness, the security and the efficiency of the scheme are analyzed. The scheme is more efficient without trust center, and is proved to have the existential group proxy signature unforgeability under the provable security model of group proxy signature and to be able to can trace proxies abusing proxy signature. Compared with other group proxy signature schemes, this scheme is more secure.
- sub-secret evolution,
- proxy signature,
- CDHP,
- cellular automata,
- provable security

FullText(HTML)

References (0)

[1]	Zhang Jing, Ju Jialiang, Ren Yonggong. Double-Generators Network for Data-Free Knowledge Distillation[J]. Journal of Computer Research and Development, 2023, 60(7): 1615-1627. DOI: 10.7544/issn1000-1239.202220024
[2]	Zhang Xiaojian, Chen Li, Jin Kaizhong, Meng Xiaofeng. Private High-Dimensional Data Publication with Junction Tree[J]. Journal of Computer Research and Development, 2018, 55(12): 2794-2809. DOI: 10.7544/issn1000-1239.2018.20170756
[3]	Zhang Ting, Du Yi, Huang Tao, Li Xue. A Reconstruction Method for Spatial Data Using Parallel SNESIM[J]. Journal of Computer Research and Development, 2015, 52(6): 1431-1442. DOI: 10.7544/issn1000-1239.2015.20140356
[4]	Zhu Yelei, Wang Yujun, Luo Qiang, and Tao Qing. A Soft-Thresholding Coordinate Descent Algorithm for Solving Truncated Hinge Loss[J]. Journal of Computer Research and Development, 2013, 50(11): 2295-2303.
[5]	Qi Yafei, Wang Yijie, and Li Xiaoyong. A Skyline Query Method over Gaussian Model Uncertain Data Streams[J]. Journal of Computer Research and Development, 2012, 49(7): 1467-1473.
[6]	Lei Shaohua, Han Yinhe, and Li Xiaowei. Soft Error Rate Analysis for Combinational Logic Using Frequency Method[J]. Journal of Computer Research and Development, 2011, 48(3): 535-544.
[7]	Sun Yan, Zhang Minxuan, Li Shaoqing, and Gao Changlei. Optimizing Soft Error Rate and Overhead of Circuits Based on Sensitive Registers Replacement[J]. Journal of Computer Research and Development, 2011, 48(1): 28-35.
[8]	Zhang Ting, Lu Detang, Li Daolun, Du Yi. Research on Statistical Information Reconstruction of Images Based on Multiple-Point Geostatistics Integrating Soft Data with Hard Data[J]. Journal of Computer Research and Development, 2010, 47(1): 43-52.
[9]	Zou Yan, Lu Peizhong, and Zhu Xueling. A Novel Algorithm of Soft Fast Correlation Attack and Applications[J]. Journal of Computer Research and Development, 2007, 44(4): 581-588.
[10]	Huang Hailin, Tang Zhimin, Xu Tong. Fault Injection and Soft Error Sensitivity Characterization for Fault-Tolerant Godson-1 Processor[J]. Journal of Computer Research and Development, 2006, 43(10): 1820-1827.