### Abstract

Original language | Undefined |
---|---|

Place of Publication | Enschede |

Publisher | Centre for Telematics and Information Technology (CTIT) |

Number of pages | 13 |

Publication status | Published - 8 Apr 2010 |

### Publication series

Name | CTIT Technical Report Series |
---|---|

Publisher | Centre for Telematics and Information Technology, University of Twente |

No. | TR-CTIT-10-14 |

ISSN (Print) | 1381-3625 |

### Keywords

- Pairing Based Cryptography
- PEKS
- SCS-Cybersecurity
- METIS-270786
- IR-70901
- EWI-17789
- Hidden Vector Encryption
- Searchable Encryption

### Cite this

*Searching Keywords with Wildcards on Encrypted Data*. (CTIT Technical Report Series; No. TR-CTIT-10-14). Enschede: Centre for Telematics and Information Technology (CTIT).

}

*Searching Keywords with Wildcards on Encrypted Data*. CTIT Technical Report Series, no. TR-CTIT-10-14, Centre for Telematics and Information Technology (CTIT), Enschede.

**Searching Keywords with Wildcards on Encrypted Data.** / Sedghi, S.; van Liesdonk, Peter; Nikova, S.I.; Hartel, Pieter H.; Jonker, Willem.

Research output: Book/Report › Report › Professional

TY - BOOK

T1 - Searching Keywords with Wildcards on Encrypted Data

AU - Sedghi, S.

AU - van Liesdonk, Peter

AU - Nikova, S.I.

AU - Hartel, Pieter H.

AU - Jonker, Willem

PY - 2010/4/8

Y1 - 2010/4/8

N2 - 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 ``$\star$'' (or wildcard) entries. Decryption is possible as long as these tuples agree on every position except where a ``$\star$'' occurs. These schemes are useful for a variety of applications: they can be used as 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.

AB - 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 ``$\star$'' (or wildcard) entries. Decryption is possible as long as these tuples agree on every position except where a ``$\star$'' occurs. These schemes are useful for a variety of applications: they can be used as 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.

KW - Pairing Based Cryptography

KW - PEKS

KW - SCS-Cybersecurity

KW - METIS-270786

KW - IR-70901

KW - EWI-17789

KW - Hidden Vector Encryption

KW - Searchable Encryption

M3 - Report

T3 - CTIT Technical Report Series

BT - Searching Keywords with Wildcards on Encrypted Data

PB - Centre for Telematics and Information Technology (CTIT)

CY - Enschede

ER -