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

一种简单阈值方案的优化
引用本文:苏中民,林行良,戴一奇.一种简单阈值方案的优化[J].软件学报,1997,8(2):128-136.
作者姓名:苏中民  林行良  戴一奇
作者单位:清华大学计算机系,北京,100084;清华大学计算机系,北京,100084;清华大学计算机系,北京,100084
摘    要:秘密分存是一种安全有效的密钥管理技术,现已广泛应用于数据安全的各个方面.以往的(k,n)阈值方案,计算量较大.本文提出了用赋标号降低数据扩展的优化方法,给出了一种优化后的简单(k,n)阈值方案论证了其安全性并分析了其数据扩展.这种方案适用于图象秘密分存等秘密数据量较大的情况.

关 键 词:秘密分存    密钥管理    数据安全    k,n)阈值方案    数据扩展
修稿时间:2/6/1996 12:00:00 AM

THE IMPROVEMENT OF A SIMPLE THRESHOLD SCHEME
SU Zhongmin,LIN Xingliang and DAI Yiqi.THE IMPROVEMENT OF A SIMPLE THRESHOLD SCHEME[J].Journal of Software,1997,8(2):128-136.
Authors:SU Zhongmin  LIN Xingliang and DAI Yiqi
Affiliation:Department of Computer Science and Technology\ Tsinghua University\ Beijing\ 100084
Abstract:Secret sharing is an effective technique for key management, and has been widely used in many aspects of data security. The existing (k,n) threshold schemes for the secret sharing are relatively complex and the data expansion they cause is remarkable. In this paper, a label assignment method is suggested for reducing the data expansion of a simple threshold scheme. The effect of the improved scheme is obvious and its security is ensured too. Such scheme can be used in the secret sharing of the data on a large scale such as images.
Keywords:Secret sharing  key management  data security  (k  n)threshold scheme    data  expansion  
本文献已被 CNKI 维普 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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