@inproceedings{adbeba63373049f0a77d5745701dced4,

title = "Searching keywords with wildcards on encrypted data",

abstract = "A hidden vector encryption scheme (HVE) is a derivation of identity-based encryption, where the public key is actually a vector over a certain alphabet. The decryption key is also derived from such a vector, but this one is also allowed to have {"}¿{"} (or wildcard) entries. Decryption is possible as long as these tuples agree on every position except where a {"}¿{"} occurs. These schemes are useful for a variety of applications: they can be used as a building block to construct attribute-based encryption schemes and sophisticated predicate encryption schemes (for e.g. range or subset queries). Another interesting application – and our main motivation – is to create searchable encryption schemes that support queries for keywords containing wildcards. Here we construct a new HVE scheme, based on bilinear groups of prime order, which supports vectors over any alphabet. The resulting ciphertext length is equally shorter than existing schemes, depending on a trade-off. The length of the decryption key and the computational complexity of decryption are both constant, unlike existing schemes where these are both dependent on the amount of non-wildcard symbols associated to the decryption key. Our construction hides both the plaintext and public key used for encryption. We prove security in a selective model, under the decision linear assumption.",

author = "S. Sedghi and {Liesdonk, van}, P.P. and S.I. Nikova and P.H. Hartel and W. Jonker",

year = "2010",

doi = "10.1007/978-3-642-15317-4_10",

language = "English",

isbn = "978-3-642-15316-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "138--153",

editor = "J.A. Garay and {De Prisco}, R.",

booktitle = "Security and Cryptography for Networks (7th International Conference, SCN 2010, Amalfi, Italy, September 13-15, 2010. Proceedings)",

address = "Germany",

}