期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

具有前向安全性质的秘密共享方案 被引量：4

A Forward Secure Secret Sharing
在线阅读 下载PDF
导出
摘要 由于已有的秘密共享方案都不具有前向安全的性质,该文基于有限域上离散对数难解问题和强RSA假设,应用前向安全理论和已有的秘密共享方案特别是Boyd提出的乘法门限方案的思想,提出了一种具有前向安全特性的秘密共享方案。该方案具有子密的可验证性,能够检测伪子密,防止欺诈者;具有子密更新简便及更新后的子密的可验证性;具有秘密恢复快捷且能直接恢复时间周期j的秘密信息及检测恢复得到的秘密信息是否正确等功效。该文同时还对方案的安全性进行了分析。 As prior secret sharing can not provide forward-secure. So in this paper a forward secure secret sharing scheme is proposed to achieve security against cheating participants by using multiplicative threshold scheme of Boyd, based on discrete logarithms and the strong -RSA assumption. In the scheme participants can update and verify the shares. Security of the scheme is provided under the strong-RSA assumption and discrete logarithms.
作者 王彩芬 刘军龙 贾爱库 于成尊
机构地区 西北师范大学数学与信息科学学院
出处 《电子与信息学报》 EI CSCD 北大核心 2006年第9期1714-1716,共3页 Journal of Electronics & Information Technology
基金 甘肃省自然科学基金项目(3ZS051-A25-042) 西北师范大学网络安全重点学科基金项目资助课题
关键词 秘密共享 前向安全 离散对数 强RSA假设 Secret sharing, Forward secure, Discrete logarithms, Strong -RSA assumption
分类号 TN918 [电子电信—通信与信息系统]
  • 相关文献

参考文献13

  • 1Blakley G R. Safeguarding cryptographic keys. Proceedings of AFIPS National Computer Conference. New York, USA, AFIPS Press, 1979,Vol.48: 313 - 317.
  • 2Shamir A. How to share a secret. Communications of the ACM,1979, 24(11): 612-613.
  • 3Anderson R. Invited Lecture. Proceedings of The 4^th ACM Conference on Computer and Communications Security, Zurich,Switzerland, 1997: 1-7.
  • 4Bellare M, Miner S K. A forward-secure digital signature schemeProceedings of 19th Annual International Cryptology ConferenceSanta Barbara, California, USA, Springer, 1999, LNCS 1666:431-448.
  • 5Kozlov A, Reyzin L. Forward-secure digital signature scheme with fast key update. In Proceedings of Security in Communication Networks. Amalf, Italy, Springer, 2002, LNCS2576:241-256.
  • 6ltkis G, Reyzin L. Forward-secure signature scheme with optimal signing and verifying. Proceedings of 21st Annual International Cryptology Conference, Santa Barbara, California,USA, Springer, 2001, LNCS2139: 332-354.
  • 7Blundo C, Gressti A, Santis A D, et al.. Fully dynamic secret sharing schemes. Proceedings of 13th Annual International Cryptology Conference, Santa Barbara, California, USA,Springer, 1993, LNCS773: 110-125.
  • 8Tassa T. Hierarchical threshold secret sharing. Proceedings of Theory of Cryptography Conference 2004, Cambridge, MA, USA,Springer, 2004, LNCS 2951: 473-490.
  • 9Cachin C. On-line secret sharing. Proceeding of the 5th IMA Conference on Cryptography and Coding, Cirencester, UK,Springer, 1995, LNCS 1025: 190-198.
  • 10Chor B, Goldwasser S, Micali S, et al. Verifiable secret sharing and achieving simultaneity in the presence of faults. Proceedings of the 26th IEEE Symposium on the Foundations of Computer Science, New York,1985:383 -395.

同被引文献21

  • 1张福泰.基于向量空间接入结构的分布式密钥生成[J].电子学报,2005,33(5):816-819. 被引量：2
  • 2Cheng Xiangguo,Liu Jingmei,Guo Lifeng,Wang Xinmei.IDENTITY-BASED MULTISIGNATURE AND AGGREGATE SIGNATURE SCHEMES FROM M-TORSION GROUPS[J].Journal of Electronics(China),2006,23(4):569-573. 被引量：11
  • 3Ohta K,Okamoto T.A digital muhisignature scheme based on the fiat-shamir scheme[C]//Advances in Cryptology-ASIACRYPT'91. Fuiyoshida, Japan : Springer-Verlag, 1991 : 75-79.
  • 4Burmester M,Desmedt Y,Doi H,et al.A structured ElGamal-type muhisignature scheme[C]//Public Key Cryptography.Victoria,Australia: Springer, 2000 : 466-483.
  • 5Bellare M,Miner S K.A forward-secure digital signature scheme[C]// LNCS 1666:Proceedings of 19th Annual International Cryptology Conference.Santa Barbara,California,USA:Springer, 1999:431-448.
  • 6Kozlov A,Reyzin L.Forward-secure digital signature scheme with fast key update[C]//LNCS 2576:Proceedings of Security in Communication Networks.Amalf, Italy: Springer, 2002: 241-256.
  • 7hkis G,Reyzin L.Forward-secure signature scheme with optimal signing and verifying[C]//LNCS 2139:Proceedings of 21st Annual International Cryptology Conference.Santa Barbara,California,USA: Springer, 2001 : 332-354.
  • 8Fujisaki E,Okamoto T.Statistical zero knowledge protocols to prove modular polynomial relations[C]//LNCS 1294:Proceedings of 17th Annual International Cryptology Conference.Santa Barbara,California, USA: Springer, 1997 : 16-30.
  • 9Boneh D,Lynn B,Shacham H.Short signatures from the Weil pairing[C]//Proceedings of Advances in Cryptology ASIA Cryptography. Berlin : Springer-Verlag, 2001 : 514-532.
  • 10Hess F.Efficient identity based signature scheme based on pairings[C]// Proceedings of Selected Areas in Cryptography,Newfoundland, Canada, 2002: 310-324.

引证文献4

二级引证文献9

电子与信息学报
2006年 第9期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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