期刊文献+

基于环境感知的防泄漏多秘密共享方案

Leakproof Multi-Secret Sharing Based on Environment Sensing
下载PDF
导出
摘要 提出了一种基于环境感知的防泄漏多秘密共享方案。在该方案中,可信中心利用中国剩余定理将多个秘密合并成一个秘密,根据拉格朗日插值多项式为各个参与者分配秘密子份额;在秘密重构时,参与者利用双线性映射,根据其秘密子份额和当前环境信息计算伪子份额;验证机构利用拉格朗日插值和双线性映射计算出验证信息,来验证参与者提交的伪子份额的有效性。该方案中参与者的子份额以及共享秘密均具有防泄漏特性,因而可以被重复使用。基于环境感知的动态性可以极大提高该方案对移动攻击者的攻击难度。该方案尤其适用于无线传感器网络、多机器人等野外工作的系统,可以有效提高这些系统的使用效率和安全性。 A leakproof multi-secret sharing scheme based on environment sensing is proposed, in which the private key generator (PKG) uses the Chinese remainder theorem to combine multi-secret into one secret, and computes the shadows through the Lagrange interpolation polynomial. In the reconstruction, the participants use the bilinear map to compute the counterfeit shadows according to the shadows and the current environment. The verifier computes the authentication information through the Lagrange interpolation and the bilinear map, and checks the validity of the counterfeit shadows. In the scheme, the shadows of participants and the shared secret are leakproof, and can be used repeatedly. The dynamic property based on environment sensing can improve the security against the mobile adversary. The proposed scheme is particularly suitable for the system which needs to run long time in the open, such as the wireless sensor network and the multi-robots, and can improve the efficiency and security of these systems effectively.
出处 《电子科技大学学报》 EI CAS CSCD 北大核心 2015年第1期101-105,共5页 Journal of University of Electronic Science and Technology of China
基金 国家自然科学基金(61170250 61103201)
关键词 密码学 环境感知 防泄漏 多秘密共享 秘密共享 cryptography environment sensing leakproof multi-secret sharing secret sharing
  • 相关文献

参考文献18

  • 1SHAMIR A. How to share a secret[J]. Communications of the ACM, 1979,22(11): 612-613.
  • 2ITO M, SAITO A, NISHIZEKI T. Secret sharing schemes realizing general access structure[C]//Proceedings of IEEE Global Telecommunication Conference. New Jersey: IEEE Press, 1987.
  • 3FELDMAN P. A practical scheme for non-interactive verifiable secret sharing[C]I /Proceedings of the 19th Annual ACM Symposium on Theory of Computing. New York: ACM Press, 1987: 427-437.
  • 4PEDERSEN T P. Non-interactive and information-theoretic secure verifiable secret sharing[C]IICRYPTO'91, LNCS 576. Berlin: Springer-Verlag, 1992: 11-15.
  • 5HERZBERG A, JARECKI S, KRAWCZYK H, et al. Proactive secret sharing or how to cope with perpetual leakage[C]IICryptology-Crypto'95. Berlin: Springer-Verlag, 1995: 339-352.
  • 6DESMEDT Y, JAJODIA S. Redistributing secret shares to new access structures and its applications[C]IITechnical Report ISSE TR-97-01. Fairfax, USA:[s.n.], 1997.
  • 7MORILLO P, PADRO C, SAEZ et al. Weighted threshold secret sharing schemes[J]. Information Processing Letters, 1999,70: 211-216.
  • 8SUN H M, CHEN B L. Weighted decomposition construction for perfect secret sharing schemes[J]. Computers and Mathematics with Applications, 2002,43: 877-887.
  • 9KARNIN E D, GREENE J W, HELLMAN M E. On secret sharing systems[J]. IEEE Transactions on Information Theory, 1983,29(1): 35-41.
  • 10CHAN C W, CHANG C C. A scheme for threshold multi-secret sharing[J]. Applied Mathematics and Computation, 2005(166): 1-14.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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