Song, Wagner and Perrig have published a theoretical paper about keyword search on encrypted textual data. We describe a prototype implementing their theory. Tests are carried out with this prototype to analyse efficiency and timing aspects. As expected encryption and search times are linear in the size of the database. More interestingly they also depend on the parameters used in the protocol.
|Place of Publication||Enschede|
|Publisher||Centre for Telematics and Information Technology (CTIT)|
|Number of pages||13|
|Publication status||Published - Sep 2003|
|Publisher||University of Twente, Centre for Telematics and Information Technology (CTIT)|
Brinkman, R., Feng, L., Etalle, S., Hartel, P. H., & Jonker, W. (2003). Experimenting with linear search in encrypted data. (CTIT-technical reports; No. 2003-43). Enschede: Centre for Telematics and Information Technology (CTIT).