一种支持一般访问结构的可验证短秘密共享方案  

A Verifiable Short Secret Sharing Scheme Supporting General Access Structure

作　　者：李良斌[1,2] 王劲林[2] 陈君[2] 

机构地区：[1]中国科学院研究生院,北京100049 [2]中国科学院声学研究所国家网络新媒体工程技术研究中心,北京100190

出　　处：《微计算机应用》2011年第5期1-5,共5页Microcomputer Applications

摘　　要：数据分离是构建可生存存储系统的关键技术,本文在分析现有数据分离方案的特性及不足的基础上,提出一种支持一般访问结构可验证短秘密共享数据分离方案。该方案生成的数据片段由密文分量和密钥分量组成,首先对原始数据进行加密并采用纠删编码分离密文,然后采用一种改进的可验证秘密共享算法分离密钥,且密钥的分离过程须依赖于密文分量。相比现有的工作,本方案在空间开销、保密性及可验证性方面均获得了较高的性能,并支持一般访问结构。Data dispersal is a key technology for survivable storage system,based on the analysis of features and shortcomings of existing data dispersal scheme,a verifiable short secret sharing data dispersal scheme supporting general access structure is proposed.The fragment generated by our scheme is composed of cipher-text portion and cipher-key portion.Firstly the original data is encrypted and dispersed with erasure coding,secondly the cipher-key is dispersed with an improved verifiable secret sharing algorithm,and dispersal of the cipher-key must depend on the cipher-text portion.Comparing to existing work,our scheme achieves high performance in all aspects of space cost,secrecy and verifiability,and the general access structure is also supported.

关 键 词：可生存存储系统 数据分离 访问结构 短秘密共享 

分 类 号：TN918[电子电信—通信与信息系统]