Home > Papers

 
 
ID-Based Robust Threshold Signature Scheme from Bilinear Pairings
Rongxing Lu 1,Zhenfu Cao 1 *,Yuan Zhou 2
1.Department of Computer Science and Engineering, Shanghai Jiao Tong University
2.Department of Computer Science and Engineering-Shanghai Jiao Tong University
*Correspondence author
#Submitted by
Subject:
Funding: 教育部博士点基金(No.20020248024)
Opened online:30 November 2005
Accepted by: none
Citation: Rongxing Lu,Zhenfu Cao,Yuan Zhou.ID-Based Robust Threshold Signature Scheme from Bilinear Pairings[OL]. [30 November 2005] http://en.paper.edu.cn/en_releasepaper/content/3925
 
 
In recent years, the bilinear pairings, namely the Weil pairing of algebraic curves, have initiated some new fields in cryptography, and many excellent ID-based signature schemes from pairings have been proposed. However, we notice that ID-based threshold signature schemes today are far rarer than basic ID-based signature schemes. In order to fill this void, in this paper, we would like to present a new ID-based robust threshold signature scheme from bilinear pairings. Any or more members in our scheme can cooperate to generate a valid ID-based signature, while or less can’t. In addition, our scheme also enjoys robustness.
Keywords:Threshold Signature; ID-based Threshold Signature; Bilinear Pairings.
 
 
 

For this paper

  • PDF (0B)
  • ● Revision 0   
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags

Add yours

Related Papers

Statistics

PDF Downloaded 399
Bookmarked 0
Recommend 5
Comments Array
Submit your papers