引用本文:宋云,李志慧,王文华.一般存取结构上抗内存泄露的多级秘密共享.软件学报,2022,33(10):3891-3902
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 1827次   下载 5026 本文二维码信息
码上扫一扫!
分享到: 微信 更多
一般存取结构上抗内存泄露的多级秘密共享
宋云1, 李志慧2, 王文华3
1.陕西师范大学 计算机科学学院, 陕西 西安 710119;2.陕西师范大学 数学与统计学院, 陕西 西安 710119;3.陕西师范大学 民族教育学院, 陕西 西安 710062
摘要:
在多级秘密共享方案中,每级存取结构里的授权集中参与者可联合重构对应的秘密.但在实际中,腐化了非授权集的攻击者可通过内存攻击获取部分或全部其余参与者的份额信息,从而非法得到部分甚至是全部的秘密信息.面对这样的内存泄漏,现有的多级秘密共享方案都不再安全.基于此,首先给出了抗内存泄漏的多级秘密共享对选择秘密攻击不可区分的形式化的计算安全模型.然后,利用物理不可克隆函数及模糊提取器的联合作用,基于极小线性码构造了一个适用于一般存取结构的抗内存泄露的可验证多级秘密共享方案.同时,在内存攻击者存在的情况下,证明方案在随机预言模型下是计算安全的.最后,将所提出方案与现有方案在性能和计算复杂度两方面进行了比较分析.
关键词:  多级秘密共享  极小线性码  物理不可克隆函数  抗内存泄露  可证明安全
DOI:10.13328/j.cnki.jos.006296
分类号:TP393
基金项目:国家自然科学基金(61602291,61802241);中国博士后科学基金(2018M633456);陕西省自然科学基础研究计划(2019JQ-472);中央高校基本科研业务费专项资金(GK202003093)
Memory Leakage-resilient Multi-stage Secret Sharing Scheme with General Access Structures
SONG Yun1, LI Zhi-Hui2, WANG Wen-Hua3
1.School of Computer Science, Shaanxi Normal University, Xi'an 710119, China;2.School of Mathematics and Statistics, Shaanxi Normal University, Xi'an 710119, China;3.School of Ethnic Education, Shaanxi Normal University, Xi'an 710062, China
Abstract:
In the multi-stage secret sharing scheme, the participants of authorized sets in each level of access structures can jointly reconstruct the corresponding secret. But in reality, adversaries who corrupted an unauthorized set can obtain some or even all of the share information of the uncorrupted participants through memory attacks, thereby illegally obtaining some or even all of the shared secrets. Facing with such memory leaks, the existing multi-stage secret sharing schemes are no longer secure. Based on this, this study firstly proposes a formal computational security model of indistinguishable ability against chosen secret attack for multi-stage secret sharing. Then, using the combination of the physical unclonable function and the fuzzy extractor, a verifiable memory leakage-resistant multi- stage secret sharing scheme for general access structures is constructed based on the minimal linear codes. Furthermore, in the presence of a memory attacker, it is proved that the scheme is computational secure in the random oracle model. Finally, the proposed scheme is compared with the existing schemes in terms of their properties and computational complexity.
Key words:  multi-stage secret sharing  minimal linear code  physical unclonable functions (PUFs)  memory leakage-resilient  provable security

引用本文:
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览次   下载  
分享到: 微信 更多
摘要:
关键词:  
DOI:
分类号:
基金项目:
Abstract:
Key words: