秘密共享技术及其应用的研究

发布时间：2018-04-25 08:48

本文选题：秘密共享 + 访问结构　；参考：《大连理工大学》2017年博士论文

【摘要】：为了保护重要信息(例如密钥),Shamir和Blakley于1979年分别提出了门限秘密共享的概念。随后,研究者们对其进行了深入的研究,并取得了丰硕的成果。目前,秘密共享已经成为信息安全领域的一个重要研究方向,并被广泛地应用于多个领域。本文以Mignotte秘密共享、门限可变秘密共享和基于钥匙锁配对的秘密共享为研究出发点,对秘密共享技术及其相关应用进行了深入的研究。具体研究成果如下:(1)利用Mignotte秘密共享技术,本文提出了一个可验证电子投票方案。通过使用掩码技术,该方案可以保证投票的隐私性。同时,通过利用秘密共享技术,该方案允许投票者对整体投票结果进行验证,并可以有效地平衡隐私性和问责性之间的冲突。此外,通过均衡各个参与者的计算负载,该方案可以避免单点(例如计票中心)计算过载。该方案满足电子投票方案的所有特性要求,且可以有效地抵御各种攻击。(2)根据Zhang等提出的(t→t',n)和({t1,t2,…,tN},n)门限可变秘密共享方案,本文提出了两个改进的方案。通过引入门限调整者,该方案可以有效避免分发者一直在线所带来的安全风险。同时,通过使用双变量单向函数,该方案可以有效防止恶意份额持有者利用历史份额发起合谋攻击,并使得份额持有者仅需保存一个份额。相对于Zhang等提出的方案,本文方案具有无可变门限取值限制、份额存储量小、计算量小、份额可复用及安全性高等优点。(3)结合Zhang等提出的({t1,t2,…,tN},n)门限可变秘密共享及Lin和Chan提出的秘密图像共享的思想,本文提出了首个门限可变的秘密图像共享方案。通过为每个可变门限预备对应份额的方式,该方案使得门限可随着安全策略的变化进行调整。同时,通过使用双变量单向函数,该方案可以有效防止恶意份额持有者利用历史份额发起合谋攻击。由安全性分析可知,该方案可以安全地调整门限。同时,实验显示该方案可以无损恢复秘密图像。(4)根据钥匙锁配对机制,本文提出了一个可无损恢复秘密图像的多秘密图像共享方案。由于该方案基于通用访问结构,因此能够满足复杂的应用需求。同时,通过使用公用锁矩阵和改进目标矩阵的构建方式,该方案可以缩小份额数据的生成量。由安全性分析可知,该方案能够安全地共享多个秘密图像。同时,相对于其他基于通用访问结构的多秘密图像共享方案,实验显示该方案可以生成质量更好的隐秘图像。
[Abstract]:The concept of threshold secret sharing was proposed in 1979 to protect important information, such as secret secret sharing. Subsequently, the researchers carried on the thorough research, and obtained the rich achievement. At present, secret sharing has become an important research direction in the field of information security, and has been widely used in many fields. Based on Mignotte secret sharing, threshold variable secret sharing and key lock based secret sharing, the secret sharing technology and its related applications are deeply studied in this paper. The specific research results are as follows: (1) using Mignotte secret sharing technology, a verifiable electronic voting scheme is proposed in this paper. By using mask technology, the scheme can guarantee the privacy of voting. At the same time, by using secret sharing technology, the scheme allows voters to verify the overall voting results, and can effectively balance the conflict between privacy and accountability. In addition, by balancing the computational load of each participant, the scheme can avoid single point (such as counting center) computing overload. This scheme meets all the characteristic requirements of the electronic voting scheme, and can effectively resist all kinds of attacks. This paper presents two improved schemes for variable threshold secret sharing. By introducing threshold adjuster, this scheme can effectively avoid the security risk brought by distributors all the time. At the same time, by using bivariate unidirectional functions, the scheme can effectively prevent malicious share holders from using historical share to launch collusion attacks, and make share holders only need to save one share. Compared with the scheme proposed by Zhang et al, this scheme has the advantages of no variable threshold limit, small storage, small computation, reusable share and high security. The idea of variable threshold secret sharing and secret image sharing proposed by Lin and Chan is presented. The first secret image sharing scheme with variable threshold is proposed in this paper. By preparing a corresponding share for each variable threshold, the threshold can be adjusted as the security policy changes. At the same time, by using bivariate unidirectional functions, the scheme can effectively prevent malicious share holders from using historical share to launch collusion attacks. According to the security analysis, this scheme can adjust the threshold safely. At the same time, experiments show that the scheme can restore secret image without loss. (4) according to the key locking mechanism, this paper proposes a multi-secret image sharing scheme which can restore secret image without loss. Because the scheme is based on the universal access structure, it can meet the complex application requirements. At the same time, by using the common locking matrix and improving the construction of the target matrix, the scheme can reduce the production of the share data. According to the security analysis, the scheme can share many secret images safely. At the same time, compared with other multi-secret image sharing schemes based on universal access structure, the experimental results show that the scheme can generate better secret images with better quality.
【学位授予单位】：大连理工大学
【学位级别】：博士
【学位授予年份】：2017
【分类号】：TP309

【相似文献】