Efficient Multi-keyword Ranked Search over Outsourced Cloud Data based on Homomorphic Encryption
With the development of cloud computing, more and more data owners are motivated to outsource their data to the cloud server for great flexibility and less saving expenditure. Because the security of outsourced data must be guaranteed, some encryption methods should be used which obsoletes tradition...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2016-01-01
|
| Series: | MATEC Web of Conferences |
| Online Access: | http://dx.doi.org/10.1051/matecconf/20165601002 |
| _version_ | 1818616305319673856 |
|---|---|
| author | Nie Mengxi Ran Peng Yang HaoMiao |
| author_facet | Nie Mengxi Ran Peng Yang HaoMiao |
| author_sort | Nie Mengxi |
| collection | DOAJ |
| description | With the development of cloud computing, more and more data owners are motivated to outsource their data to the cloud server for great flexibility and less saving expenditure. Because the security of outsourced data must be guaranteed, some encryption methods should be used which obsoletes traditional data utilization based on plaintext, e.g. keyword search. To solve the search of encrypted data, some schemes were proposed to solve the search of encrypted data, e.g. top-k single or multiple keywords retrieval. However, the efficiency of these proposed schemes is not high enough to be impractical in the cloud computing. In this paper, we propose a new scheme based on homomorphic encryption to solve this challenging problem of privacy-preserving efficient multi-keyword ranked search over outsourced cloud data. In our scheme, the inner product is adopted to measure the relevance scores and the technique of relevance feedback is used to reflect the search preference of the data users. Security analysis shows that the proposed scheme can meet strict privacy requirements for such a secure cloud data utilization system. Performance evaluation demonstrates that the proposed scheme can achieve low overhead on both computation and communication. |
| first_indexed | 2024-12-16T16:47:41Z |
| format | Article |
| id | doaj.art-8d1d85ea98a149d2a04d55aab2b04005 |
| institution | Directory Open Access Journal |
| issn | 2261-236X |
| language | English |
| last_indexed | 2024-12-16T16:47:41Z |
| publishDate | 2016-01-01 |
| publisher | EDP Sciences |
| record_format | Article |
| series | MATEC Web of Conferences |
| spelling | doaj.art-8d1d85ea98a149d2a04d55aab2b040052022-12-21T22:24:07ZengEDP SciencesMATEC Web of Conferences2261-236X2016-01-01560100210.1051/matecconf/20165601002matecconf_iccae2016_01002Efficient Multi-keyword Ranked Search over Outsourced Cloud Data based on Homomorphic EncryptionNie MengxiRan Peng0Yang HaoMiaoUniversity of Electronic Science and Technology of ChinaWith the development of cloud computing, more and more data owners are motivated to outsource their data to the cloud server for great flexibility and less saving expenditure. Because the security of outsourced data must be guaranteed, some encryption methods should be used which obsoletes traditional data utilization based on plaintext, e.g. keyword search. To solve the search of encrypted data, some schemes were proposed to solve the search of encrypted data, e.g. top-k single or multiple keywords retrieval. However, the efficiency of these proposed schemes is not high enough to be impractical in the cloud computing. In this paper, we propose a new scheme based on homomorphic encryption to solve this challenging problem of privacy-preserving efficient multi-keyword ranked search over outsourced cloud data. In our scheme, the inner product is adopted to measure the relevance scores and the technique of relevance feedback is used to reflect the search preference of the data users. Security analysis shows that the proposed scheme can meet strict privacy requirements for such a secure cloud data utilization system. Performance evaluation demonstrates that the proposed scheme can achieve low overhead on both computation and communication.http://dx.doi.org/10.1051/matecconf/20165601002 |
| spellingShingle | Nie Mengxi Ran Peng Yang HaoMiao Efficient Multi-keyword Ranked Search over Outsourced Cloud Data based on Homomorphic Encryption MATEC Web of Conferences |
| title | Efficient Multi-keyword Ranked Search over Outsourced Cloud Data based on Homomorphic Encryption |
| title_full | Efficient Multi-keyword Ranked Search over Outsourced Cloud Data based on Homomorphic Encryption |
| title_fullStr | Efficient Multi-keyword Ranked Search over Outsourced Cloud Data based on Homomorphic Encryption |
| title_full_unstemmed | Efficient Multi-keyword Ranked Search over Outsourced Cloud Data based on Homomorphic Encryption |
| title_short | Efficient Multi-keyword Ranked Search over Outsourced Cloud Data based on Homomorphic Encryption |
| title_sort | efficient multi keyword ranked search over outsourced cloud data based on homomorphic encryption |
| url | http://dx.doi.org/10.1051/matecconf/20165601002 |
| work_keys_str_mv | AT niemengxi efficientmultikeywordrankedsearchoveroutsourcedclouddatabasedonhomomorphicencryption AT ranpeng efficientmultikeywordrankedsearchoveroutsourcedclouddatabasedonhomomorphicencryption AT yanghaomiao efficientmultikeywordrankedsearchoveroutsourcedclouddatabasedonhomomorphicencryption |