EEMCS EPrints Service
|
||||||||||||||||||||||||||||||||||
|
Brinkman, R. and Feng, Ling and Etalle, S. and Hartel, P.H. and Jonker, W.
(2003)
Experimenting with linear search in encrypted data.
Technical Report TR-CTIT-03-43,
Centre for Telematics and Information Technology University of Twente, Enschede.
ISSN 1381-3625
Full text available as:
AbstractSong, 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.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
||||||||||||||||||||||||||||||||||