Conjunctive Wildcard Search over Encrypted Data

Bösch, Christoph and Brinkman, Richard and Hartel, Pieter and Jonker, Willem (2011) Conjunctive Wildcard Search over Encrypted Data. In: 8th VLDB Workshop on Secure Data Management, SDM 2011, 2 September 2011, Seattle, WA, USA.

PDF
Restricted to UT campus only: Request a copy
340Kb

Abstract:	Searchable encryption allows a party to search over encrypted data without decrypting it. Prior schemes in the symmetric setting deal only with exact or similar keyword matches. We describe a scheme for the problem of wildcard searches over encrypted data to make search queries more flexible, provide a security proof for our scheme and com- pare the computational, communication and space complexity with existing schemes. We develop an efficient scheme, using pseudorandom functions and Bloom filters, that supports wildcard searches over encrypted data. The scheme also supports conjunctive wildcard searches, efficient and secure updates and is more efficient than previous solutions. Besides, our construction is independent of the encryption method of the remote data and is practical to use in real world applications.
Item Type:	Conference or Workshop Item
Copyright:	© 2011 Springer
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Distributed and Embedded Systems (DIES) Databases (DB)
Link to this item:	http://purl.utwente.nl/publications/77961
Official URL:	http://dx.doi.org/10.1007/978-3-642-23556-6_8
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Repository Staff Only: item control page