ISCAS OpenIR  > 信息安全国家重点实验室
efficient secret sharing schemes
Lv Chunli; Jia Xiaoqi; Lin Jingqiang; Jing Jiwu; Tian Lijun; Sun Mingli
2011
会议名称8th FTRA International Conference on Secure and Trust Computing, Data Management, and Application, STA 2011
会议录名称Communications in Computer and Information Science
页码114-121
会议日期28-Jun-02
会议地点Loutraki, Greece
收录类别EI
出版地Germany
ISSN18650929
ISBN9783642223389
部门归属(1) State Key Laboratory of Information Security, Graduate University, Chinese Academy of Sciences, China; (2) College of Information and Electrical Engineering, China Agricultural University, China; (3) State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, China
摘要We propose a new XOR-based (k,n) threshold secret SSS, where the secret is a binary string and only XOR operations are used to make shares and recover the secret. Moreover, it is easy to extend our scheme to a multi-secret sharing scheme. When k is closer to n, the computation costs are much lower than existing XOR-based schemes in both distribution and recovery phases. In our scheme, using more shares (≥ k) will accelerate the recovery speed. © 2011 Springer-Verlag.
关键词Information Management
内容类型会议论文
URI标识http://ir.iscas.ac.cn/handle/311060/14315
专题信息安全国家重点实验室
推荐引用方式
GB/T 7714
Lv Chunli,Jia Xiaoqi,Lin Jingqiang,et al. efficient secret sharing schemes[C]. Germany,2011:114-121.
条目包含的文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
efficient secret sha(225KB) 开放获取--请求全文
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Lv Chunli]的文章
[Jia Xiaoqi]的文章
[Lin Jingqiang]的文章
百度学术
百度学术中相似的文章
[Lv Chunli]的文章
[Jia Xiaoqi]的文章
[Lin Jingqiang]的文章
必应学术
必应学术中相似的文章
[Lv Chunli]的文章
[Jia Xiaoqi]的文章
[Lin Jingqiang]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。