期刊文献+

特殊门限秘密共享方法及其应用 被引量:2

Special Threshold Secret Sharing Methods and Their Applications
下载PDF
导出
摘要 从电子招投标系统的实际需求出发,提出了特殊门限秘密共享的概念,即具有指定人必须参与、以组为单位、指定组必须参与等性质特征的秘密共享方法.相应于实际需求,基于Shamir秘密共享原理,采用多重门限的方法设计了指定人必须参与的秘密共享、以组为单位的秘密共享、指定组必须参与的秘密共享等算法,解决了实际问题.理论分析表明,文中算法是安全、有效的.所设计的算法已被实际应用于电子招投标系统中,经实践证明,系统运行稳定,算法的执行效率高. Based on the practical requirements of the electronic bidding system, the concept of special threshold secret sharing is proposed, which owns the features and properties of that the designated person must participate, that a group acts as a unit, or that the designated group must participate. Corresponding to the actual requirements, some secret sharing algorithms are designed to solve the practical problems by adopting the multi-threshold method based on Shamir's secret sharing principle, which include the one that the designated person must participate, the one that a group acts as a unit, and the one that the designated group must participate. It is shown by theoretical analysis that the proposed algorithms are secure and effective. Moreover, the designed algorithms are practically aplied to an electronic bidding system. The results indicate that the system runs stably and the algorithm works efficiently.
作者 唐韶华
出处 《华南理工大学学报(自然科学版)》 EI CAS CSCD 北大核心 2007年第10期168-171,177,共5页 Journal of South China University of Technology(Natural Science Edition)
基金 国家自然科学基金资助项目(60572139) 霍英东教育基金会资助项目(101069) 教育部新世纪人才支持计划(NCET-06-0744)
关键词 秘密共享 门限密码 特殊门限秘密共享 电子招投标 secret sharing threshold cryptography special threshold secret sharing electronic bidding
  • 相关文献

参考文献10

  • 1Blakley G R.Safeguarding cryptographic keys[C]//Proceeding of AFIPS 1979 the National Computer Conference.NewYork:AFIPS,1979:313-317.
  • 2Shamir A.How to share a secret[J].Communications of ACM,1979,22:612-613.
  • 3Asmuth C,Bloom J.A modular approach to key safeguarding[J].IEEE Transactions on Information Theory,1983,IT-29(2):208-210.
  • 4Karnin E D,Greene J W,Hellman M E.On sharing secret systems[J].IEEE Transactions on Information Theory,1983,IT-29:35-41.
  • 5Chor B,Goldwasser S,Micali S,et al.Verifiable secret sharing and achieving simultaneity in the presence of faults[C]// Proceedings of 26th IEEE Symposium on Foundations of Computer Science.Oregon,Portland:IEEE,1985:383-395.
  • 6Stadler M.Publicly verifiable secret sharing[C]// Proceedings of EUROCRYPT96,LNCS 1070.Berlin:Springer-Verlag,1996:190-199.
  • 7庞辽军,李慧贤,王育民.可验证的(t,n)门限秘密共享方案及其安全性[J].华南理工大学学报(自然科学版),2007,35(1):102-105. 被引量:3
  • 8Benaloh J,Leichter J.Generalized secret sharing and monotone functions[C]// Advance in Cryptology-Crypto' 88.Berlin:Springer-Verlag,1990:27-35.
  • 9Jackson W A,Martin K M,O' KEEFE M.Multisecret threshold schemes[C] // Advances in Cryptology-Crypto'93.Berlin:Springer-Verlag,1993:126-135.
  • 10He J,Dawson E.Multisecret sharing scheme based on one way function[J].Electronics Letters,1995,31 (2):93-95.

二级参考文献2

共引文献2

同被引文献18

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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