Conjunctive wildcard search over encrypted data

Authors:
Christoph Bösch;Richard Brinkman;Pieter Hartel;Willem Jonker
Affiliations:
University of Twente, Enschede, The Netherlands;University of Twente, Enschede, The Netherlands;University of Twente, Enschede, The Netherlands;University of Twente, Enschede, The Netherlands
Venue:
SDM'11 Proceedings of the 8th VLDB international conference on Secure data management
Year:
2011

Citing 12
Cited 1

Storing a Sparse Table with 0(1) Worst Case Access Time

Journal of the ACM (JACM)
Efficient computation on oblivious RAMs

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Software protection and simulation on oblivious RAMS

Software protection and simulation on oblivious RAMS
Software protection and simulation on oblivious RAMs

Journal of the ACM (JACM)
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
Keying Hash Functions for Message Authentication

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Practical Techniques for Searches on Encrypted Data

SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Searchable symmetric encryption: improved definitions and efficient constructions

Proceedings of the 13th ACM conference on Computer and communications security
Conjunctive, subset, and range queries on encrypted data

TCC'07 Proceedings of the 4th conference on Theory of cryptography
Public key encryption that allows PIR queries

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Privacy preserving keyword searches on remote encrypted data

ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
New proofs for NMAC and HMAC: security without collision-resistance

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology

Supporting complex queries and access policies for multi-user encrypted databases

Proceedings of the 2013 ACM workshop on Cloud computing security workshop

Quantified Score

Hi-index	0.00

Visualization

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 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.