EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Search
 Organisation

EEMCS EPrints Service


18604 Searching Keywords with Wildcards on Encrypted Data
Home Policy Brochure Browse Search User Area Contact Help

Sedghi, S. and van Liesdonk, P. and Nikova, S.I. and Hartel, P.H. and Jonker, W. (2010) Searching Keywords with Wildcards on Encrypted Data. In: Proceedings of the Seventh international Conference on Security and Cryptography for Networks (SCN), 13-15 September 2010, Amalfi, Italy. pp. 138-153. Lecture Notes in Computer Science 6280. Springer Verlag. ISBN 978-3-642-15316-7

Full text available as:

PDF
- Univ. of Twente only
256 Kb

Official URL: http://dx.doi.org/10.1007/978-3-642-15317-4_10

Exported to Metis

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.

Item Type:Conference or Workshop Paper (Full Paper, Talk)
Research Group:EWI-DIES: Distributed and Embedded Security, EWI-DB: Databases
Research Program:CTIT-ISTRICE: Integrated Security and Privacy in a Networked World
Research Project:SEDAN: Searchable Data Encryption
ID Code:18604
Status:Published
Deposited On:19 October 2010
Refereed:Yes
International:Yes
More Information:statisticsmetis

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item