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 compare 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. © 2011 Springer-Verlag.
CITATION STYLE
Bösch, C., Brinkman, R., Hartel, P., & Jonker, W. (2011). Conjunctive wildcard search over encrypted data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6933 LNCS, pp. 114–127). Springer Verlag. https://doi.org/10.1007/978-3-642-23556-6_8
Mendeley helps you to discover research relevant for your work.