本文選題：秘密共享 + 訪問結(jié)構(gòu)��； 參考：《大連理工大學(xué)》2017年博士論文

【摘要】：為了保護(hù)重要信息(例如密鑰),Shamir和Blakley于1979年分別提出了門限秘密共享的概念。隨后,研究者們對(duì)其進(jìn)行了深入的研究,并取得了豐碩的成果。目前,秘密共享已經(jīng)成為信息安全領(lǐng)域的一個(gè)重要研究方向,并被廣泛地應(yīng)用于多個(gè)領(lǐng)域。本文以Mignotte秘密共享、門限可變秘密共享和基于鑰匙鎖配對(duì)的秘密共享為研究出發(fā)點(diǎn),對(duì)秘密共享技術(shù)及其相關(guān)應(yīng)用進(jìn)行了深入的研究。具體研究成果如下:(1)利用Mignotte秘密共享技術(shù),本文提出了一個(gè)可驗(yàn)證電子投票方案。通過使用掩碼技術(shù),該方案可以保證投票的隱私性。同時(shí),通過利用秘密共享技術(shù),該方案允許投票者對(duì)整體投票結(jié)果進(jìn)行驗(yàn)證,并可以有效地平衡隱私性和問責(zé)性之間的沖突。此外,通過均衡各個(gè)參與者的計(jì)算負(fù)載,該方案可以避免單點(diǎn)(例如計(jì)票中心)計(jì)算過載。該方案滿足電子投票方案的所有特性要求,且可以有效地抵御各種攻擊。(2)根據(jù)Zhang等提出的(t→t',n)和({t1,t2,…,tN},n)門限可變秘密共享方案,本文提出了兩個(gè)改進(jìn)的方案。通過引入門限調(diào)整者,該方案可以有效避免分發(fā)者一直在線所帶來的安全風(fēng)險(xiǎn)。同時(shí),通過使用雙變量單向函數(shù),該方案可以有效防止惡意份額持有者利用歷史份額發(fā)起合謀攻擊,并使得份額持有者僅需保存一個(gè)份額。相對(duì)于Zhang等提出的方案,本文方案具有無可變門限取值限制、份額存儲(chǔ)量小、計(jì)算量小、份額可復(fù)用及安全性高等優(yōu)點(diǎn)。(3)結(jié)合Zhang等提出的({t1,t2,…,tN},n)門限可變秘密共享及Lin和Chan提出的秘密圖像共享的思想,本文提出了首個(gè)門限可變的秘密圖像共享方案。通過為每個(gè)可變門限預(yù)備對(duì)應(yīng)份額的方式,該方案使得門限可隨著安全策略的變化進(jìn)行調(diào)整。同時(shí),通過使用雙變量單向函數(shù),該方案可以有效防止惡意份額持有者利用歷史份額發(fā)起合謀攻擊。由安全性分析可知,該方案可以安全地調(diào)整門限。同時(shí),實(shí)驗(yàn)顯示該方案可以無損恢復(fù)秘密圖像。(4)根據(jù)鑰匙鎖配對(duì)機(jī)制,本文提出了一個(gè)可無損恢復(fù)秘密圖像的多秘密圖像共享方案。由于該方案基于通用訪問結(jié)構(gòu),因此能夠滿足復(fù)雜的應(yīng)用需求。同時(shí),通過使用公用鎖矩陣和改進(jìn)目標(biāo)矩陣的構(gòu)建方式,該方案可以縮小份額數(shù)據(jù)的生成量。由安全性分析可知,該方案能夠安全地共享多個(gè)秘密圖像。同時(shí),相對(duì)于其他基于通用訪問結(jié)構(gòu)的多秘密圖像共享方案,實(shí)驗(yàn)顯示該方案可以生成質(zhì)量更好的隱秘圖像。
[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.
【學(xué)位授予單位】：大連理工大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2017
【分類號(hào)】：TP309

【相似文獻(xiàn)】

相關(guān)期刊論文 前5條

1 薛婷;李志慧;柳燁;;多分發(fā)者的多秘密共享方案[J];計(jì)算機(jī)工程;2011年02期

2 郭成;李明楚;王智慧;;多分發(fā)者的秘密共享方案[J];計(jì)算機(jī)工程與應(yīng)用;2009年06期

3 李慧;劉煥平;;無分發(fā)者的多重訪問結(jié)構(gòu)秘密共享方案[J];哈爾濱師范大學(xué)自然科學(xué)學(xué)報(bào);2013年06期

4 李婧;李志慧;賴紅;;基于Hash函數(shù)的無分發(fā)者的多秘密共享方案[J];計(jì)算機(jī)工程與應(yīng)用;2012年18期

5 張福泰;王育民;;適用于任意接入結(jié)構(gòu)的可驗(yàn)證多秘密分享方案[J];通信學(xué)報(bào);2007年11期

相關(guān)博士學(xué)位論文 前1條

1 袁理鋒;秘密共享技術(shù)及其應(yīng)用的研究[D];大連理工大學(xué);2017年

相關(guān)碩士學(xué)位論文 前2條

1 劉艷紅;無需秘密信道的可驗(yàn)證秘密分享方案的分析與設(shè)計(jì)[D];南京師范大學(xué);2012年

2 韋曉東;可驗(yàn)證匿名秘密共享及帶權(quán)動(dòng)態(tài)秘密共享的研究[D];安徽大學(xué);2012年

，

本文編號(hào)：1800620