Show simple item record

dc.contributor.advisorMichael Ernst
dc.contributor.authorArtzi, Shay
dc.contributor.authorKiezun, Adam
dc.contributor.authorNewport, Calvin
dc.contributor.authorSchultz, David
dc.contributor.otherProgram Analysis
dc.date.accessioned2006-02-23T20:36:51Z
dc.date.available2006-02-23T20:36:51Z
dc.date.issued2006-02-23
dc.identifier.otherMIT-CSAIL-TR-2006-010
dc.identifier.urihttp://hdl.handle.net/1721.1/31216
dc.description.abstractEncrypted 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.
dc.format.extent11 p.
dc.format.extent16238506 bytes
dc.format.extent625872 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesMassachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
dc.subjectBloomfilters
dc.titleEncrypted Keyword Search in a Distributed Storage System


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record