期刊文献+

基于ECC一般访问结构的多重秘密共享方案

Multi-secret sharing scheme with general access structures based on ECC
下载PDF
导出
摘要 基于Shamir的门限方案、椭圆曲线密码体制以及hash函数,提出了一个基于一般访问结构上的多重秘密共享方案。该方案具有以下特点:参与者的秘密份额由自己选定;每个参与者只需维护一个秘密份额就可以实现对任意多个秘密的共享;任何参与者都可以是秘密分发者,分发者和各参与者之间可以明文形式传输;在秘密恢复过程中,秘密恢复者能够验证其他参与者是否进行了欺骗。方案的安全性是基于Shamir的门限方案、椭圆曲线密码体制的安全性以及hash函数的安全性。 Based on Shamir's threshold scheme, the elliptic curve (the security of ECDLP) and hash function, a secret sharing scheme for the general access structure is proposed. The scheme has the following characteristics: Each participant's secret shadow is selected by the participant himself. The shadows don't need to change when the shared secret is renewed. The participant can be work as dealer. Scheme is security without conflict parameters. In the recovery phase, each participant can check whether shadow is true or not. The security of the scheme is the same as that of Shamir's threshold scheme, the elliptic curve cryptosystem and hash function.
出处 《计算机工程与设计》 CSCD 北大核心 2008年第1期16-17,75,共3页 Computer Engineering and Design
基金 国家自然科学基金项目(60503012)
关键词 椭圆曲线密码体制 秘密共享 访问结构 门限方案 安全性 elliptic curve cryptography secret sharing access structure threshold scheme security
  • 相关文献

参考文献8

二级参考文献33

  • 1张小萍,周大水.RSA在DSP下的快速加密实现[J].计算机工程与设计,2004,25(7):1093-1095. 被引量:6
  • 2庞辽军,王育民.基于RSA密码体制(t,n)门限秘密共享方案[J].通信学报,2005,26(6):70-73. 被引量:32
  • 3Herzberg A, Jakobsson M, Jarecki S. Proactive Public-Key and Signature Schemes[C]. In Proceedings of the 4th Annual Conference on Computer Communications Security, 1997. 100-110.
  • 4Gennaro R, Jarecki S, Krawczyk H, et al. Rabin. Robust Threshold DSS Signatures[C]. Advances in Cryptology-Eurocrypt'96, International Conference on the Theory and Application of Cryptographic Techniques, 1996. 354-371.
  • 5Ostrovsky R, Yung M. How to Withstand Mobile Virus Attacks[C]. In Proceedings of the 10th Annual Symposium on Principles of Distributed Computing, 1991. 51-59.
  • 6Blakley G R. Safeguarding Cryptographic Keys[C]. Proceedings of the 1979 National Computer Conference, Volume 48 of AFIPS Conference Proceedings, 1979. 313-317.
  • 7Shamir A. How to Share a Secret[J]. Communication of the ACM, 1979,22(11):612-613.
  • 8Feldman P. A Practical Scheme for Non-Interactive Verifiable Secret Sharing[J]. In Proc.28th Annual Symp. 1987.427-437.
  • 9Gemmell P. An Introduction to Threshold Cryptography[J]. Cryptobytes, 1997: 7-12.
  • 10Pedersen T. Non-Interactive and Information-Theoretic Secure Verifiable secret Sharing[C]. Advances in Cryptology-Crypto'91, the 11th Annual International Cryptology Conference, 1992. 129-140.

共引文献58

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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