吉林大学学报(理学版)

• 计算机科学 • 上一篇    下一篇

基于层次结构的大数据秘密共享方案

刘炜1,2, 杨道平2, 简岩2   

  1. 1. 贵州大学 计算机科学与技术学院, 贵阳 550025; 2. 遵义师范学院 计算机与信息科学学院, 贵州 遵义 563002
  • 收稿日期:2015-07-31 出版日期:2016-07-26 发布日期:2016-07-20
  • 通讯作者: 刘炜 E-mail:liuwei@163.com

Secret Sharing Scheme for Big Data Based on Hierarchical Structure

LIU Wei1,2, YANG Daoping2, JIAN Yan2   

  1. 1. College of Computer Science and Technology, Guizhou University, Guiyang 550025, China;2. College of Computer and Information Science, Zunyi Normal College, Zunyi 563002, Guizhou Province, China
  • Received:2015-07-31 Online:2016-07-26 Published:2016-07-20
  • Contact: LIU Wei E-mail:liuwei@163.com

摘要:

利用改进的Shamir门限算法递归构造一个具有层次结构的多秘密共享模型. 使用秘密分发算法在每层共享一个子秘密, 从而实现了短秘密份额对大数据的存储. 该方案利用双变量抗碰撞Hash函数, 使参与者可以动态地加入或退出. 同时公开秘密份额的Hash值, 任何参与者都能检测其他参与者的真实性. 结果表明, 该秘密共享方
案具有动态性与可验证性, 并且可以达到无条件安全.

关键词: 层次结构, 大数据, 秘密共享, 双变量抗碰撞Hash函数

Abstract:

We used the modified Shamir’s threshold recursive algorithm to construct a multisecret sharing model with hierarchical structure. We used a secret distribution algorithm to share a subsecret in each layer, and then achieved huge data storage with short secret shares. Furthermore, the proposed scheme employed a twovariable resistant collision Hash function, so that the participants could dynamically  join or exit. At the same time, any participant could verify the authenticity of other participants  by exposing the Hash values of secret shares. The results show that the secret sharing scheme is dynamic and verifiable, and can achieve unconditional security.

Key words: hierarchical structure, big data, secret sharing, twovariable resistant collision Hash function

中图分类号: 

  • TP309