期刊文献+

前向安全门限签名方案

A forward-secure threshold signature scheme
下载PDF
导出
摘要 提出了一个新的前向安全门限签名方案,方案采用乘法共享的方法,实现十分简单,使用的密钥长度也很短,在参与成员n=t+1时,可抵御收买t个成员的窃听敌手.假设因式分解是难解的,证明了方案在随机预言模型中是前向安全的.最后,给出了抵御恶意敌手的方法. A forward-secure threshold signature scheme was put forward. The scheme based on multiplicative secret sharing, with short key, is very simple. If the number of players is n = t + 1, the scheme can tolerate an eavesdropping adversary corrupting t players. It is proved that it is forward secure in random oracle model assuming that factoring is hard. Finally, the method against mobile malicious adversary is given.
作者 于佳 李大兴
出处 《山东大学学报(理学版)》 CAS CSCD 北大核心 2005年第6期44-48,共5页 Journal of Shandong University(Natural Science)
基金 国家973项目基金资助项目(G1999035802) 国家863高科技研究发展计划资助项目(2001AA141120)
关键词 门限签名方案 前向安全性 最优弹性 敌手 threshold signature scheme forward security optimal resilience adversary
  • 相关文献

参考文献11

  • 1[1]R Anderson.Two remarks on public key cryptology[ R].Invited Lecture,ACM-CCS'97,1997.
  • 2[2]M Bellare,S Miner.A forward-secure digital signature scheme[A].M Wiener.CRYPTO'99,vol 1666 of LNCS[C].Berlin:Springer-Verlag,1999.431 ~448.
  • 3[3]M Abdalla,L Reyzin.A new forward-secure digital signature scheme[A].T Okamoto.Asiacrypt 2000,vol 1976 of LNCS[C].Berlin:Springer-Verlag,2000.116~ 129.
  • 4[4]G Itkis,L Reyzin.Forward-secure signatures with optimal signing and verifying[ A].J Kilian.CRYPTO 2001,vol 2139 of LNCS[C].Berlin:Springer-Verlag,2001.499~514.
  • 5[5]A Kozlov,L Reyzin.Forward-secure signatures with fast key update[ A ].S Cimato.Security in communication networks,vol 2576 of LNCS[C].Berlin:Springer-Verlag,2002.247~262.
  • 6[6]M Abdalla,S Miner,C Na mprempre.Forward-secure threshold signature schemes[A].D Naccache.Cryptology-CT-RSA2001,vol2020 of LNCS[C].Berlin:Springer-Verlag,2001.441 ~ 456.
  • 7[7]M Bellare,P Rogaway.Random oracles are practical:a paradigm for designing efficient protocols[ A].D Denning.In 1st ACM conference on computer and communications security[C].New York:ACM Press,1993.62~ 73.
  • 8[8]C H Lim,P J Lee.More flexible exponentiation with precomputation[ A].Y Desmedt.Cryptology-Crypto' 94 proceedings,vol 839 of LNCS[ C].Berlin:Springer-Verlag,1994.95 ~107.
  • 9[9]Y Frankel,P D Mackenzie,M Yung.Robust efficient distributed rsa-key generation[ A ].Y Bartal.In 30th annual ACMsymposium on the theory of computing[ C].New York:ACMPress,1998.663 ~ 672.
  • 10[10]R Gennaro,M O Rabin,T Rabin.Simplified VSS and fasttrack multiparty computations with applications to threshold cryptography[A].H Krawczyk.In 17th ACM symposium annual on principles of distributed computing[C].New York:ACM Press,1998.101 ~ 111.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部