Encrypted Keyword Search in a Distributed Storage System
Encrypted keyword search allows a server to perform a search over a set of encrypted documents on behalf of a client without learning the contents of the documents or the words being searched for. Designing a practical system is challenging because the privacy constraint thwarts standard indexing an...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/31216 |
| _version_ | 1826206108938665984 |
|---|---|
| author | Artzi, Shay Kiezun, Adam Newport, Calvin Schultz, David |
| author2 | Michael Ernst |
| author_facet | Michael Ernst Artzi, Shay Kiezun, Adam Newport, Calvin Schultz, David |
| author_sort | Artzi, Shay |
| collection | MIT |
| description | Encrypted keyword search allows a server to perform a search over a set of encrypted documents on behalf of a client without learning the contents of the documents or the words being searched for. Designing a practical system is challenging because the privacy constraint thwarts standard indexing and ranking techniques. We present Mafdet, an encrypted keyword search system we have implemented. Our system makes the search practical even for large data sets. We evaluated Mafdet's performance on a set of queries and a large collection of documents. In these queries, Mafdet's accuracy is within 6% of Google Desktop, and the search time is on the order of seconds for document sets as large as 2.6 GB. |
| first_indexed | 2024-09-23T13:24:13Z |
| id | mit-1721.1/31216 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T13:24:13Z |
| publishDate | 2006 |
| record_format | dspace |
| spelling | mit-1721.1/312162019-04-11T06:23:38Z Encrypted Keyword Search in a Distributed Storage System Artzi, Shay Kiezun, Adam Newport, Calvin Schultz, David Michael Ernst Program Analysis Bloomfilters Encrypted keyword search allows a server to perform a search over a set of encrypted documents on behalf of a client without learning the contents of the documents or the words being searched for. Designing a practical system is challenging because the privacy constraint thwarts standard indexing and ranking techniques. We present Mafdet, an encrypted keyword search system we have implemented. Our system makes the search practical even for large data sets. We evaluated Mafdet's performance on a set of queries and a large collection of documents. In these queries, Mafdet's accuracy is within 6% of Google Desktop, and the search time is on the order of seconds for document sets as large as 2.6 GB. 2006-02-23T20:36:51Z 2006-02-23T20:36:51Z 2006-02-23 MIT-CSAIL-TR-2006-010 http://hdl.handle.net/1721.1/31216 en_US Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory 11 p. 16238506 bytes 625872 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | Bloomfilters Artzi, Shay Kiezun, Adam Newport, Calvin Schultz, David Encrypted Keyword Search in a Distributed Storage System |
| title | Encrypted Keyword Search in a Distributed Storage System |
| title_full | Encrypted Keyword Search in a Distributed Storage System |
| title_fullStr | Encrypted Keyword Search in a Distributed Storage System |
| title_full_unstemmed | Encrypted Keyword Search in a Distributed Storage System |
| title_short | Encrypted Keyword Search in a Distributed Storage System |
| title_sort | encrypted keyword search in a distributed storage system |
| topic | Bloomfilters |
| url | http://hdl.handle.net/1721.1/31216 |
| work_keys_str_mv | AT artzishay encryptedkeywordsearchinadistributedstoragesystem AT kiezunadam encryptedkeywordsearchinadistributedstoragesystem AT newportcalvin encryptedkeywordsearchinadistributedstoragesystem AT schultzdavid encryptedkeywordsearchinadistributedstoragesystem |