本文選題：帶關(guān)鍵字搜索的公鑰加密 + 匿名�。� 參考：《南京理工大學(xué)》2017年碩士論文

【摘要】：帶關(guān)鍵字搜索的公鑰加密體制在不解密出消息及關(guān)鍵字的情況下,實(shí)現(xiàn)了服務(wù)器檢索帶有某個(gè)指定關(guān)鍵字密文的功能,彌補(bǔ)了傳統(tǒng)加解密算法無法搜索的不足。在帶關(guān)鍵字搜索的公鑰加密體制中,發(fā)送者發(fā)送密文給服務(wù)器,接收者發(fā)送關(guān)鍵字的陷門給服務(wù)器,服務(wù)器按預(yù)先設(shè)定的規(guī)則對上述密文和陷門進(jìn)行測試。若匹配成功則可鎖定到包含該關(guān)鍵字的密文,匹配失敗則不能。上述過程不會泄露消息及關(guān)鍵字信息。本文首先介紹了一個(gè)匿名的基于身份的加密方案,然后,基于該方案構(gòu)造出一個(gè)建立在素?cái)?shù)階雙線性群上的帶關(guān)鍵字搜索的公鑰加密方案。同時(shí),本文證明出該方案在DBDH假設(shè)和D-Linear假設(shè)下是IND-PEKS-CPA安全的。相比于同類型的帶關(guān)鍵字搜索的公鑰加密方案,該方案具有更短的私鑰和密文,極大的減少了通信成本。其次,為了解決以往帶關(guān)鍵字搜索的公鑰加密方案無法恢復(fù)通信消息的缺陷,本文利用雙線性技術(shù),構(gòu)造出一個(gè)可解密出消息的指定測試者的帶關(guān)鍵字搜索的公鑰加密方案。該方案在離散對數(shù)困難問題下被證明出是選擇關(guān)鍵字攻擊下密文不可區(qū)分安全的,此外,利用Diffie-Hellman困難問題證明出該方案在選擇關(guān)鍵字攻擊下是陷門不可區(qū)分安全的,從而說明該方案在隨機(jī)預(yù)言模型下是選擇關(guān)鍵字攻擊安全的。該方案相比其它指定測試者的帶關(guān)鍵字搜索的公鑰加密方案,具有解密功能,更具實(shí)用意義。最后,本文將上述可搜索加密方案嵌入到郵件服務(wù)系統(tǒng)中,保障了郵件系統(tǒng)在日常運(yùn)行過程中的安全通信。
[Abstract]:The public-key encryption system with keyword search realizes the function of retrieving ciphertext with a specified key without decrypting messages and keywords, which makes up for the deficiency that the traditional encryption and decryption algorithm can not search. In the public-key cryptosystem with keyword search, the sender sends the ciphertext to the server, the receiver sends the keyword-trapping door to the server, and the server tests the ciphertext and the trapdoor according to the pre-set rules. If the match is successful, it can be locked to the ciphertext containing the keyword, and the match fails. The above procedures do not disclose messages and keyword information. In this paper, we first introduce an anonymous identity-based encryption scheme, and then, based on this scheme, we construct a public key encryption scheme based on a prime bilinear group with keyword search. At the same time, it is proved that the scheme is IND-PEKS-CPA secure under the DBDH and D-Linear assumptions. Compared with the public key encryption scheme with keyword search, this scheme has shorter private key and ciphertext, which greatly reduces the communication cost. Secondly, in order to solve the problem that the public key encryption scheme with key search can not recover the communication message, this paper constructs a public key encryption scheme with keyword search for the designated testers who can decrypt the message by using bilinear technique. It is proved that the scheme is indistinguishable and secure under the attack of selected keywords under discrete logarithmic difficulties. In addition, it is proved that the scheme is trapdoor indistinguishable and secure under the attack of selected keywords by using the Diffie-Hellman problem. It shows that this scheme is safe to select keyword attack under random prophecy model. Compared with other public key encryption schemes with keyword search, this scheme has decryption function and is more practical. Finally, this paper embed the searchable encryption scheme into the mail service system to ensure the secure communication of the mail system in the daily running process.
【學(xué)位授予單位】：南京理工大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TN918.4

【參考文獻(xiàn)】

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

1 計(jì)海萍;徐磊;蔚曉玲;許春根;;云計(jì)算環(huán)境下基于身份的分層加密管理系統(tǒng)研究[J];信息網(wǎng)絡(luò)安全;2016年05期

，

本文編號：1898699