### Abstract

Original language | English |
---|---|

Title of host publication | Security and Cryptography for Networks |

Subtitle of host publication | 7th International Conference, SCN 2010, Amalfi, Italy, September 13-15, 2010, Proceedings |

Editors | Juan A. Garay, Roberto De Prisco |

Place of Publication | Berlin |

Publisher | Springer |

Pages | 138-153 |

Number of pages | 16 |

ISBN (Electronic) | 978-3-642-15317-4 |

ISBN (Print) | 978-3-642-15316-7 |

DOIs | |

Publication status | Published - 15 Sep 2010 |

Event | 7th international Conference on Security and Cryptography for Networks, SCN 2010 - Amalfi, Italy Duration: 13 Sep 2010 → 15 Sep 2010 Conference number: 7 |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Publisher | Springer Verlag |

Volume | 6280 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 7th international Conference on Security and Cryptography for Networks, SCN 2010 |
---|---|

Abbreviated title | SCN |

Country | Italy |

City | Amalfi |

Period | 13/09/10 → 15/09/10 |

### Fingerprint

### Keywords

- METIS-271072
- EWI-18604
- SCS-Cybersecurity
- IR-73702

### Cite this

*Security and Cryptography for Networks: 7th International Conference, SCN 2010, Amalfi, Italy, September 13-15, 2010, Proceedings*(pp. 138-153). (Lecture Notes in Computer Science; Vol. 6280). Berlin: Springer. https://doi.org/10.1007/978-3-642-15317-4_10

}

*Security and Cryptography for Networks: 7th International Conference, SCN 2010, Amalfi, Italy, September 13-15, 2010, Proceedings.*Lecture Notes in Computer Science, vol. 6280, Springer, Berlin, pp. 138-153, 7th international Conference on Security and Cryptography for Networks, SCN 2010, Amalfi, Italy, 13/09/10. https://doi.org/10.1007/978-3-642-15317-4_10

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Searching Keywords with Wildcards on Encrypted Data

AU - Sedghi, Saeed

AU - van Liesdonk, Peter

AU - Nikova, Svetla

AU - Hartel, Pieter

AU - Jonker, Willem

PY - 2010/9/15

Y1 - 2010/9/15

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 "*" (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.

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 "*" (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.

KW - METIS-271072

KW - EWI-18604

KW - SCS-Cybersecurity

KW - IR-73702

U2 - 10.1007/978-3-642-15317-4_10

DO - 10.1007/978-3-642-15317-4_10

M3 - Conference contribution

SN - 978-3-642-15316-7

T3 - Lecture Notes in Computer Science

SP - 138

EP - 153

BT - Security and Cryptography for Networks

A2 - Garay, Juan A.

A2 - De Prisco, Roberto

PB - Springer

CY - Berlin

ER -