Query-Biased Preview over Outsourced and Encrypted Data
For both convenience and security, more and more users encrypt their sensitive data before outsourcing it to a third party such as cloud storage service. However, searching for the desired documents becomes problematic since it is costly to download and decrypt each possibly needed document to check...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2013/860621 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832551186748669952 |
|---|---|
| author | Ningduo Peng Guangchun Luo Ke Qin Aiguo Chen |
| author_facet | Ningduo Peng Guangchun Luo Ke Qin Aiguo Chen |
| author_sort | Ningduo Peng |
| collection | DOAJ |
| description | For both convenience and security, more and more
users encrypt their sensitive data before outsourcing it to a third party such as cloud storage service. However, searching for the desired documents becomes problematic since it is costly to download and decrypt each possibly needed
document to check if it contains the desired content. An informative query-biased preview feature, as applied in modern search engine, could help the users to learn about the content without downloading the entire document. However, when the data are encrypted, securely extracting a keyword-in-context snippet from the data as a preview becomes a challenge. Based on private information retrieval protocol and the core concept of searchable encryption, we propose a single-server and two-round solution to securely obtain a query-biased snippet over the encrypted data from the server. We achieve this novel result by making a document (plaintext) previewable under any cryptosystem and constructing a secure index to support dynamic computation for a best matched snippet when queried by some keywords. For each document, the scheme has O(d) storage complexity and O(log(d/s)+s+d/s) communication complexity, where d is the document size and s is the snippet length. |
| format | Article |
| id | doaj-art-5ca0188ac0c0481d9a592128c50d3bda |
| institution | Kabale University |
| issn | 1537-744X |
| language | English |
| publishDate | 2013-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | The Scientific World Journal |
| spelling | doaj-art-5ca0188ac0c0481d9a592128c50d3bda2025-02-03T06:04:42ZengWileyThe Scientific World Journal1537-744X2013-01-01201310.1155/2013/860621860621Query-Biased Preview over Outsourced and Encrypted DataNingduo Peng0Guangchun Luo1Ke Qin2Aiguo Chen3School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, ChinaSchool of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, ChinaSchool of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, ChinaSchool of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, ChinaFor both convenience and security, more and more users encrypt their sensitive data before outsourcing it to a third party such as cloud storage service. However, searching for the desired documents becomes problematic since it is costly to download and decrypt each possibly needed document to check if it contains the desired content. An informative query-biased preview feature, as applied in modern search engine, could help the users to learn about the content without downloading the entire document. However, when the data are encrypted, securely extracting a keyword-in-context snippet from the data as a preview becomes a challenge. Based on private information retrieval protocol and the core concept of searchable encryption, we propose a single-server and two-round solution to securely obtain a query-biased snippet over the encrypted data from the server. We achieve this novel result by making a document (plaintext) previewable under any cryptosystem and constructing a secure index to support dynamic computation for a best matched snippet when queried by some keywords. For each document, the scheme has O(d) storage complexity and O(log(d/s)+s+d/s) communication complexity, where d is the document size and s is the snippet length.http://dx.doi.org/10.1155/2013/860621 |
| spellingShingle | Ningduo Peng Guangchun Luo Ke Qin Aiguo Chen Query-Biased Preview over Outsourced and Encrypted Data The Scientific World Journal |
| title | Query-Biased Preview over Outsourced and Encrypted Data |
| title_full | Query-Biased Preview over Outsourced and Encrypted Data |
| title_fullStr | Query-Biased Preview over Outsourced and Encrypted Data |
| title_full_unstemmed | Query-Biased Preview over Outsourced and Encrypted Data |
| title_short | Query-Biased Preview over Outsourced and Encrypted Data |
| title_sort | query biased preview over outsourced and encrypted data |
| url | http://dx.doi.org/10.1155/2013/860621 |
| work_keys_str_mv | AT ningduopeng querybiasedpreviewoveroutsourcedandencrypteddata AT guangchunluo querybiasedpreviewoveroutsourcedandencrypteddata AT keqin querybiasedpreviewoveroutsourcedandencrypteddata AT aiguochen querybiasedpreviewoveroutsourcedandencrypteddata |