首页 | 本学科首页   官方微博 | 高级检索  
     

新型有效的秘密共享方案
引用本文:石润华,黄刘生,杨 威,仲 红.新型有效的秘密共享方案[J].通信学报,2012(1):10-16.
作者姓名:石润华  黄刘生  杨 威  仲 红
作者单位:安徽大学计算机科学与技术学院;中国科学技术大学计算机科学与技术系国家高性能计算中心;中国科学技术大学苏州研究院
基金项目:国家自然科学基金资助项目(61173187,61173188);安徽省自然科学基金资助项目(11040606M141);安徽高校省级重点自然科学研究基金资助项目(KJ2010A009);安徽大学211工程基金资助项目~~
摘    要:提出了一种新的秘密共享方案。该方案分两层实现:上层,基于Stern-Brocot树把一个大的秘密拆分为t个小整数(子秘密);底层,借鉴一维元胞自动机模型中的进化方法,把上层的t个子秘密作为初始状态,动态生成各参与者的共享。特别地,该方案能够动态扩展参与者,动态调整门限值,动态更新秘密和共享。另外,还具有计算简单,各参与者共享份额短的优点。分析结果表明,该方案安全、有效。

关 键 词:秘密共享  门限  动态  Stern-Brocot树

Novel and effective secret sharing scheme
SHI Run-hua,HUANG Liu-sheng,YANG Wei,ZHONG Hong.Novel and effective secret sharing scheme[J].Journal on Communications,2012(1):10-16.
Authors:SHI Run-hua  HUANG Liu-sheng  YANG Wei  ZHONG Hong
Affiliation:1(1.School of Computer Science and Technology,Anhui University,Hefei 230039,China; 2.NHPCC,Depart.of CS.& Tech.,USTC,Hefei 230026,China;3.Suzhou Institute for Advanced Study,USTC,Suzhou 215123,China)
Abstract:A novel secret sharing scheme was proposed.This scheme consisted of two layer protocols: in the first layer,a larger secret was split into t smaller integers(sub-secrets) based on the Stern-Brocot tree;in the lower layer,t sub-secrets obtained from the first layer were regarded as t initial states in one-dimensional cellular automaton model,and then from the t initial states it could dynamic create all participants’ shares according to the simple fixed rule.This scheme could dynamic add new member,adjust the threshold value and renew the secret and the shares.Besides,there were still other advantages that the costs of the computation were very low and the size of the shares was very small.The results of analysis show that it was secure and very efficient.
Keywords:secret sharing  threshold  dynamic  Stern-Brocot tree
本文献已被 CNKI 等数据库收录!
点击此处可从《通信学报》浏览原始摘要信息
点击此处可从《通信学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号