带关键词检索公钥加密技术的研究与实现-计算机软件与理论专业论文.docxVIP

II II Abstract With the rapid development of internet, a number of companies and individuals have stored data on a third-party server. How to ensure the confidentiality and privacy of private data has become an urgent problem. Encryption is an effective means of protecting the confidentiality and privacy of data, but retrieval on the encrypted data is a very difficult task. Particularly due to non-trusted environment, how to search on encrypted data efficiently caused widespread concern. Thus, searchable encryption has become a hot topic in recent years. Searchable encryption can be divided into symmetric encryption with keyword search and Public key Encryption with Keyword Search (PEKS). Symmetric encryption with keyword search is simple and has high efficiency, but can not realize the private search for third-party data. The Public key Encryption with Keyword Search can realize the private search for third-party data, but is inefficient. This paper mainly studies searchable encryption. Since great computation of pairings in PEKS schemes are still time consuming and inefficient，this paper proposes a more efficient PEKS scheme. The new PEKS scheme not only retains the advantages of symmetric encryption with keyword search such as simpleness and high efficiency ,but also can realize the private search for third-party data. The new PEKS scheme has broad application prospects. It can be applied in practical systems, such as e-mail system audit logs, etc. In the end, this paper also uses the popular object-oriented software development tool JBuilder 6.0 to implement an encryption mail system based on the new PEKS scheme and completes the comparing experiments. Experiments show that comparing with existing PEKS schemes and other improved schemes, this scheme has the advantages of simpleness, high efficiency. In addition, it’s security is the same as existing PEKS schemes. Keywords: Searchable encryption; public key encryption; Public key Encryption with keyword Search(PE