欢迎访问中国科学院大学学报,今天是
研究简报

一个简单而安全的门限RSA签名方案

  • 王贵林 ,
  • 王明生 ,
  • 卿斯汉 ,
  • 冯登国
展开
  • 1. 中国科学院软件研究所信息安全国家重点实验室, 北京 100080;
    2. 中国科学院信息安全技术工程研究中心, 北京 100080
王贵林,男,1968年10月生,博士

收稿日期: 2001-04-29

  网络出版日期: 2001-03-10

基金资助

国家自然科学基金跨学科重点项目 (G19931010); 973资助项目 (G1999035810)

A Simple and Secure Threshold RSA Signature Scheme

  • Wang Guilin ,
  • Wang Mingsheng ,
  • Qing Sihan ,
  • Feng Dengguo
Expand
  • 1. State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences;
    2. Engineering Research Center for Information Security Technology of the Chinese Academy of Sciences, Bei jing 100080

Received date: 2001-04-29

  Online published: 2001-03-10

摘要

门限签名是普通数字签名的推广.门限签名的生成必须由多个成员合作才能完成,但验证只需要知道群体的公开密钥即可进行.基于有理数域上的插值公式,给出了一个需要庄家的门限RSA签名方案.该方案简单、安全,且部分签名的正确性是可以验证的

本文引用格式

王贵林 , 王明生 , 卿斯汉 , 冯登国 . 一个简单而安全的门限RSA签名方案[J]. 中国科学院大学学报, 2001 , 18(2) : 124 -128 . DOI: 10.7523/j.issn.2095-6134.2001.2.006

Abstract

Threshold signature is the generalization of general digital signature, in w hich the sig nature is generated under the cooperation of some members and verified only using the public key of the group.In this paper, based on the interpolating formula in the rational field, a threshold RSA sig nature scheme, under the help of a dealer, is presented.T his simple scheme is secure,and possesses a property that the validity of partial signature is verifiable.

参考文献

1 [ BF97] D Boneh, M Franklin.Eff icient G eneration of Shared RSA K eys.In :B Kaliski.A dvances in C rypt ology-Crypto 97 Proceedings, LNCS 1294.Berlin :Springer-Verlag, 1997.425 ~ 439

2 [ Boy89] C Boyd.Digital M ult isignatures.In :Cryptography and Coding.1989.241 ~ 246

3 [ CM I93] M Cerecedo, T M atsumoto, H Imai.Ef fici ent and S ecure M ultipart y G eneration of D igi tal Signat ures Based on D iscret e Logarit hm.IEIC E T rans on Fund Elect r Comm and Comp Sci.1993, E76-A(4):532 ~ 545

4 [ D DFY94] A D e S antis, Y Desmedt, Y Frankel, M Yung.How to Share a Funct ion Securely.In :Proc 26t h ACM Symposium on Theory of Computi ng.Santa Fe:IEEE, 1994.522 ~ 533

5 [ D es87] Y D esmedt.Society and G roup O riented Cryptography :a N ew Concept.In :C Pomerance.A dvances in Crypt ology-Crypto 87 Pro-ceedings, LNCS 293.Berlin :Springer-V erlag, 1998.120 ~ 127

6 [ D F89] Y D esmedt, Y Frankel.Threshold Cryptosystem s.In :G Brassard.A dvances in C rypt ology-Crypto 89 Proceedings, LN CS 435.Berlin :Springer-V erlag, 1990.307 ~ 315

7 [ D SS] Digital Signature St andard.Federal Informat ion Proceesing Standards Publication (FIPS PU B 186).U S Department of Commerce/N IS T, National Technical Information Service.S pringf ield, Vi rginia, 1994

8 [ ElG 85] T ElG amal.A Public K ey C ryptosystem and a Signat ure S cheme Based on D iscret e Logarit hms.IEEE T ransactions on Information Theory, 1985, 31 :469 ~ 472

9 [ FGM Y97] Y Frankel, P Gemmall, P M acKenzie, M Yung.Proact ive RSA.In :B K aliski.Advances i n C rypt ology-Crypto 97 Proceedings,LNCS 1294.Berlin :Springer-V erlag, 1997.440 ~ 454

10 [ FG Y96] Y Frankel, P G emmall, M Y ung.Wi tness-based C ryptographic Program Checki ng and Robust Funct ion Sharing.In :Proc 28t h A CM Symposium on Theory of Comput ing.1996.A CM.499 ~ 508

11 [ FM Y 98] Y Frankel, P D M acK enzie, M Yung.Robust Effi cient dist ributed RSA-key G eneration.In :Proc 30th A CM Symposium on the Theory of Comput ing(S TOC 98).1998.663 ~ 672

12 [ Fra89] Y Frankel, A Pract ical Protocol for Large G roup Orien ted Netw ork s.In :J Q uisquarter, J Vandewalle.Advances in Cryptology-Eu rocrypt 89 Proceedings, LN CS 434.Berlin :S pri nger-V erlag, 1990.56 ~ 61

13 [ Gi l99] N Gillboa.Two Parties RSA Key G eneration.In :M Wiener.Advances in Cryptology-Crypto 99 Proceedings, LNCS 1666.Berlin :S pringer-Verlag, 1999.116 ~ 129

14 [ G JK R96a] R Gennaro, S Jarecki, H K rawczyk, T Rabi n.Robust Threshold DSS S ignatu res.In :U M M au rer.A dvances in Cryptology-Eu rocrypt 96 Proceedings, LN CS 1070.Berli n :S pringer-V erlag, 1996.354 ~ 371

15 [ G JK R96b] R Gennaro, S Jarecki, H K rawczyk, T Rabi n.Robust and Effi cient Sharing of RSA Funct ions.In :N K obli tz.Advances in Cryptology-Crypt o 96 Proceedings, LNCS 1109.Berli n :Springer-Verlag, 1996.157 ~ 172

16 [ G M W87] O G oldrei ch, S Mi cali, A Wigderson.How to Play any Mental Game.In :Proc 19th A CM Symposium on the Theory of Comput-ing(STO C 87).IEEE Press, 1987.218

17 [ HJJ +97] A Herzberg, M Jakobsson, S Jarecki, H K raw czyk, M Yung.Proactive Public Key and S ignatu re System s.In :1997 A CM Confer-ence on Comput ers and Communi cat ion Secu rit y.1997

18 [ Ped91] T P Pedersen.A Th reshold Cryptosystem wi thout a Trusted Party.In :D W D avies.Advances in Cryptology-Eu rocrypt 91 Proceed-ings, LNCS 547.Berlin :Springer-Verlag, 1991.522 ~ 526

19 [ PK 96] C Park, K K urosawa.New ElG amal Type Threshold Si gnature Scheme.IEICE Trans on Fund Electr Comm and CompSci, 1996,E79-A(1):86 ~ 93

20 [ PS98] GPoupard, J St ern.G eneration of Shared RSA K eys by Tw o Part ies.In :A dvances in Cryptology-ASIA CRY PT 98 Proceedings,LN CS.Berlin :Springer-V erlag, 1998.11 ~ 24

21 [ Rab98] T Rabin.A Simplifi ed Approach t o Threshold and Proactive RSA.In :H K raw czyk.A dvances in Cryptology-Eu rocrypt 94 Proceed-ings, LNCS 1462.Berlin :Springer-V erlag, 1998.89 ~ 104

22 [ Sch89] C P S chnorr.Ef ficient Ident ification and Signat ures for S mart Cards.In :G.Brassard.Advances in C ryptology-Crypt o 89 Proceed-ings, LNCS 435.Berlin :Springer-V erlag, 1989.239 ~ 252

23 [ S ha79] A Shami r.How t o Share a Secret.C ommunications of t he A CM, 1979, 22(11):612 ~ 613

24 [ W XX00] 王宏, 肖鸿, 肖国镇.防欺诈的二方共享 RSA 密钥.软件学报, 2000, 11(10):1344 ~ 1347

25 [ X u00] 徐秋亮.改进门限 RSA 数字签名体制.计算机学报, 2000, 23(5):449 ~ 453

文章导航

/