引用本文:苏中民,林行良,戴一奇.一种简单阈值方案的优化.软件学报,1997,8(2):128-136
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 4582次   下载 5295 本文二维码信息
码上扫一扫!
分享到: 微信 更多
一种简单阈值方案的优化
苏中民1, 林行良1, 戴一奇1
清华大学计算机系,北京,100084
摘要:
秘密分存是一种安全有效的密钥管理技术,现已广泛应用于数据安全的各个方面.以往的(k,n)阈值方案,计算量较大.本文提出了用赋标号降低数据扩展的优化方法,给出了一种优化后的简单(k,n)阈值方案论证了其安全性并分析了其数据扩展.这种方案适用于图象秘密分存等秘密数据量较大的情况.
关键词:  秘密分存  密钥管理  数据安全  k,n)阈值方案  数据扩展
DOI:
分类号:
基金项目:
THE IMPROVEMENT OF A SIMPLE THRESHOLD SCHEME
SU Zhongmin,LIN Xingliang,DAI Yiqi
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.
Key words:  Secret sharing  key management  data security  k,n)threshold scheme  data expansion