本文選題：秘密共享體制　切入點(diǎn)：防欺騙函數(shù)　出處：《西安電子科技大學(xué)》2014年碩士論文　論文類型：學(xué)位論文

【摘要】：隨著信息社會(huì)的發(fā)展,信息安全越來越多地受到人們的廣泛關(guān)注。在對(duì)信息安全起核心作用的密碼學(xué)中,一個(gè)加密或簽名算法所用的密鑰的安全保密問題至為關(guān)鍵,尤其是在多層安全建設(shè)中處于頂級(jí)的這樣密鑰(以下稱為主密鑰),若交給單獨(dú)一位管理員來保管,在操作上可能有以下的弊端:(1)每次都需要這位管理員出席方能得到這個(gè)主密鑰;(2)若這位管理員發(fā)生意外不幸喪生,則這個(gè)主密鑰將從此失落,影響系統(tǒng)操作;(3)若這位管理員將此主密鑰出賣給他人,就將危害到整個(gè)系統(tǒng)的安全。運(yùn)用秘密共享技術(shù)可以徹底地解決上述問題。所謂的秘密共享就是將要保管的秘密s(如上述中的主密鑰)提供給一個(gè)參與者集合P的所有成員分開保管,當(dāng)且僅當(dāng)集合P的一個(gè)授權(quán)子集中的所有成員出示他們的秘密份額時(shí)才能恢復(fù)出共享秘密s,而非授權(quán)子集成員則得不到關(guān)于秘密s的任何信息。本文首先綜述了秘密共享技術(shù)的研究狀況;其次,提出了一個(gè)部分廣播信道秘密共享體制,并在其安全性和效率方面給出了一些研究結(jié)果;第三,提出一個(gè)了防欺騙的秘密共享體制,并研究了其安全性的一些主要方面。具體地來說,本文的成果包括以下幾個(gè)方面:1.部分廣播是在一對(duì)多的信道分布下傳輸消息的,它的秘密共享方案構(gòu)造等價(jià)于構(gòu)造一個(gè)cover?free?family集合(任意t?1個(gè)信道都不包含有其他剩余信道的消息內(nèi)容)。本文給出了一個(gè)構(gòu)造cover?free?family集合的方法,然后對(duì)其效率(主要包括信道效率和通信效率)進(jìn)行了分析。效率分析分在信道分布固定不變和變化兩種情況下討論進(jìn)行:對(duì)于信道分布固定不變情形,用接入結(jié)構(gòu)為?的秘密共享方案來構(gòu)造;而對(duì)于信道分布變化情形,用完備的hash family來構(gòu)造。推導(dǎo)的結(jié)果表明,它們的通信效率都比傳統(tǒng)的在一對(duì)一信道上發(fā)送分享秘密的要高。2.傳統(tǒng)的秘密共享體制一般由共享秘密生成算法和共享秘密恢復(fù)算法構(gòu)成,防欺騙秘密共享體制的改進(jìn)之處在于設(shè)計(jì)了一個(gè)有甄別功能的共享秘密恢復(fù)算法,它在沒有出現(xiàn)欺騙者的時(shí)候,將恢復(fù)出秘密;而當(dāng)出現(xiàn)欺騙者的時(shí)候,就會(huì)產(chǎn)生特殊符號(hào)。本文分別從任意有限域上多項(xiàng)式和乘法逆元角度,研究構(gòu)造了兩種防欺騙認(rèn)證函數(shù),并討論了各種欺詐情況出現(xiàn)的條件及其相應(yīng)的概率。
[Abstract]:With the development of information society, more and more people pay attention to information security. In particular, such a key, which is at the top of the multilayer security architecture (hereinafter referred to as the master key, is left to a single administrator to keep it). There may be the following malpractice in operation: 1) every time this administrator is present to get the master key, if the administrator accidentally dies, the master key will be lost from now on. If the administrator sells the master key to someone else, The security of the whole system will be jeopardized. The problem can be solved thoroughly by using the secret sharing technology. The secret sharing is that the secret ss to be kept (such as the master key in the above) is provided to a set of participants P. In the separate custody of all members of the. If and only if all members of an authorized subset of the set P show their secret share, then the shared secret s can be recovered, while the non-authorized subset member can not get any information about the secret s. The research status of secret sharing technology; Secondly, a partial broadcast channel secret sharing scheme is proposed, and some research results are given in terms of its security and efficiency. Thirdly, a deception-proof secret sharing scheme is proposed. And some main aspects of its security are studied. To be specific, the results of this paper include the following aspects: 1. Part of the broadcast transmits messages under a one-to-many channel distribution, and its secret sharing scheme is equivalent to constructing a cover1? Free? Family collection (arbitrary t? A single channel does not contain the message content of other remaining channels. Free? The method of family set is analyzed, and its efficiency (including channel efficiency and communication efficiency) is analyzed. The efficiency analysis is discussed in two cases: the channel distribution is invariant and the channel distribution is invariant. With the access structure? In the case of channel distribution variation, a complete hash family is used to construct the scheme. The derived results show that, Their communication efficiency is higher than that of the traditional one to one channel. 2. The traditional secret sharing scheme is generally composed of shared secret generation algorithm and shared secret recovery algorithm. The improvement of the anti-deception secret sharing system lies in the design of a discriminating algorithm for the restoration of shared secrets, which recovers secrets when there are no spoofers, and when deceivers appear, In this paper, we study and construct two kinds of anti-deception authentication functions from the angles of polynomial and multiplication inverse element on arbitrary finite fields, and discuss the conditions and the corresponding probability of various kinds of fraud cases.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TN918.4

【相似文獻(xiàn)】

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

1 曹來成,李廉,袁占亭;一種安全的主密鑰保護(hù)方案[J];蘭州大學(xué)學(xué)報(bào);2005年04期

2 曹來成;;多級(jí)密鑰管理中主密鑰的安全保護(hù)[J];哈爾濱工業(yè)大學(xué)學(xué)報(bào);2009年01期

3 R·E·Lenou ,S·M·Matyas ,于偉;使用主密鑰不同變型的單向密碼功能[J];通信保密;1982年03期

4 小山謙二 ,張愚;利用主密鑰多址通信的密碼體制[J];通信保密;1983年02期

5 Dorothg.E,Denning;Fred.B.Schneider;林子;;主密鑰問題[J];通信保密;1984年01期

6 本刊編輯部;;安全微世界[J];信息安全與通信保密;2013年08期

7 楊念祖;網(wǎng)上支付概況[J];電腦與信用卡;1999年10期

8 施芳;潘俊華;卞保武;;主密鑰在組播密鑰管理中的應(yīng)用[J];電子商務(wù);2009年12期

9 楊曉元;王志強(qiáng);蔡偉藝;;適應(yīng)性安全的多主密鑰KP-ABE方案[J];中國科學(xué)技術(shù)大學(xué)學(xué)報(bào);2011年07期

10 小山謙二 ,黎明;RSA公開密鑰密碼體制的主密鑰[J];通信保密;1983年01期

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

1 呂洋;基于嵌入式可信平臺(tái)的主密鑰存儲(chǔ)技術(shù)研究[D];南京理工大學(xué);2015年

2 倪磊磊;擴(kuò)展形式秘密共享體制的研究與設(shè)計(jì)[D];西安電子科技大學(xué);2014年

3 李偉;空間信息網(wǎng)絡(luò)密鑰管理研究[D];解放軍信息工程大學(xué);2009年

4 韓琮林;迷你金融系統(tǒng)的設(shè)計(jì)與實(shí)現(xiàn)[D];電子科技大學(xué);2010年

，

本文編號(hào)：1608229