带关键字搜索的公钥加密方案的设计与分析

发布时间：2018-05-16 22:29

本文选题：带关键字搜索的公钥加密 + 匿名　；参考：《南京理工大学》2017年硕士论文

【摘要】：带关键字搜索的公钥加密体制在不解密出消息及关键字的情况下,实现了服务器检索带有某个指定关键字密文的功能,弥补了传统加解密算法无法搜索的不足。在带关键字搜索的公钥加密体制中,发送者发送密文给服务器,接收者发送关键字的陷门给服务器,服务器按预先设定的规则对上述密文和陷门进行测试。若匹配成功则可锁定到包含该关键字的密文,匹配失败则不能。上述过程不会泄露消息及关键字信息。本文首先介绍了一个匿名的基于身份的加密方案,然后,基于该方案构造出一个建立在素数阶双线性群上的带关键字搜索的公钥加密方案。同时,本文证明出该方案在DBDH假设和D-Linear假设下是IND-PEKS-CPA安全的。相比于同类型的带关键字搜索的公钥加密方案,该方案具有更短的私钥和密文,极大的减少了通信成本。其次,为了解决以往带关键字搜索的公钥加密方案无法恢复通信消息的缺陷,本文利用双线性技术,构造出一个可解密出消息的指定测试者的带关键字搜索的公钥加密方案。该方案在离散对数困难问题下被证明出是选择关键字攻击下密文不可区分安全的,此外,利用Diffie-Hellman困难问题证明出该方案在选择关键字攻击下是陷门不可区分安全的,从而说明该方案在随机预言模型下是选择关键字攻击安全的。该方案相比其它指定测试者的带关键字搜索的公钥加密方案,具有解密功能,更具实用意义。最后,本文将上述可搜索加密方案嵌入到邮件服务系统中,保障了邮件系统在日常运行过程中的安全通信。
[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.
【学位授予单位】：南京理工大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TN918.4

【参考文献】