A Forward Secure Threshold Signature Scheme from Bilinear Pairing

Peng Huaxi and Feng Dengguo

Journal of Computer Research and Development > 2007 > 44(4): 574-580.

Peng Huaxi and Feng Dengguo. A Forward Secure Threshold Signature Scheme from Bilinear Pairing[J]. Journal of Computer Research and Development, 2007, 44(4): 574-580.

Citation:

Peng Huaxi and Feng Dengguo. A Forward Secure Threshold Signature Scheme from Bilinear Pairing[J]. Journal of Computer Research and Development, 2007, 44(4): 574-580.

Citation:

Peng Huaxi and Feng Dengguo. A Forward Secure Threshold Signature Scheme from Bilinear Pairing[J]. Journal of Computer Research and Development, 2007, 44(4): 574-580.

PDF (371 KB)

A Forward Secure Threshold Signature Scheme from Bilinear Pairing

Peng Huaxi and Feng Dengguo

(State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080)

More Information

Published Date: April 14, 2007

Graphical Abstract

Abstract

Abstract

A forward secure threshold signature scheme from bilinear pairing is proposed by combining the concept of forward security with threshold signature from bilinear pairing. In the scheme proposed the signature key is distributed into the whole group and is updated by means of updating partial keys. So the security of the signature key is enhanced and the scheme has the characters of forward security. Furthermore, for the character of partial keys-update, the scheme can prevent the mobile adversaries. The security of the scheme is also analyzed. It is shown that the proposed scheme is secure and effective.
- threshold signature,
- bilinear pairing,
- forward secure,
- ID-based cryptography

FullText(HTML)

References (0)

[1]	Kong Hao, Lu Wenyan, Chen Yan, Yan Guihai, Li Xiaowei. Survey of Sort Acceleration Methods on FPGA[J]. Journal of Computer Research and Development, 2024, 61(3): 780-798. DOI: 10.7544/issn1000-1239.202220789
[2]	Zeng Weixin, Zhao Xiang, Tang Jiuyang, Tan Zhen, Wang Wei. Iterative Entity Alignment via Re-Ranking[J]. Journal of Computer Research and Development, 2020, 57(7): 1460-1471. DOI: 10.7544/issn1000-1239.2020.20190643
[3]	Liu Linlan, Zhang Jiang, Shu Jian, Guo Kai, Meng Lingchong. Multiple Attribute Decision Making-Based Prediction Approach of Critical Node for Opportunistic Sensor Networks[J]. Journal of Computer Research and Development, 2017, 54(9): 2021-2031. DOI: 10.7544/issn1000-1239.2017.20160645
[4]	Shi Song, Li Hongliang, Zhu Wei. Efficient Merge Sort Algorithms on Array-Based Manycore Architectures[J]. Journal of Computer Research and Development, 2016, 53(2): 362-373. DOI: 10.7544/issn1000-1239.2016.20148246
[5]	Li Ximing, Yang Bo, Guo Yubin, Yao Jintao. A New Key Hiding Scheme Based on Fingerprint[J]. Journal of Computer Research and Development, 2013, 50(3): 532-539.
[6]	Chen Hui, Yin Jianping, and Zhu En. A Method to Adjust Minutiae Location and Direction in Nonlinear Distorted Fingerprint Image[J]. Journal of Computer Research and Development, 2010, 47(12).
[7]	Hao Fanchang, Luan Junfeng, Zhu Daming, Zhang Peng, and Li Ming. A Faster Algorithm for Sorting Genomes by Reciprocal Translocation, Insertion and Deletion[J]. Journal of Computer Research and Development, 2010, 47(11): 2011-2023.
[8]	Yang Lei and Song Tao. The Array-Based Bucket Sort Algorithm[J]. Journal of Computer Research and Development, 2007, 44(2): 341-347.
[9]	Yin Yilong, Zhang Hongwei, and Liu Ning. Fingerprint Matching Based on Delaunay Triangulation[J]. Journal of Computer Research and Development, 2005, 42(9): 1622-1627.
[10]	Qin Liangxi, Shi Zhongzhi. SFP-Max—A Sorted FP-Tree Based Algorithm for Maximal Frequent Patterns Mining[J]. Journal of Computer Research and Development, 2005, 42(2): 217-223.