Efficient Trapdoor Generation from Multiple Hashing in Searchable Symmetric Encryption
| Autor: | Yutaka Kawai, Koseki Yoshihiro, Takato Hirano |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
060201 languages & linguistics
business.industry Computer science Hash function 06 humanities and the arts 02 engineering and technology Short length Bit array Encryption Masking (Electronic Health Record) Random oracle Symmetric-key algorithm 0602 languages and literature 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Adaptive security business Algorithm |
| Zdroj: | Information Security Practice and Experience ISBN: 9783319998060 ISPEC |
| DOI: | 10.1007/978-3-319-99807-7_10 |
| Popis: | Searchable symmetric encryption (SSE) which can search encrypted data using encrypted keywords has been extremely studied. In Asiacrypt’10, Chase and Kamara formalized structured encryption which is a generalization of SSE, and its concrete schemes were proposed. An efficient SSE scheme (hereafter, Chase-Kamara scheme) which has a very simple encrypted index is obtained by simplifying the concrete schemes, and its adaptive security can be proved, easily. In the Chase-Kamara scheme, a search result for a keyword is represented as a bit string in which the i-th bit is 1 when the i-th document contains the keyword, and the encrypted index is built by directly masking the search result with each bit of the output of a pseudo-random function. Therefore, the Chase-Kamara scheme requires pseudo-random functions whose output lengths are longer than the number of documents that users would like to store. As a result, the trapdoor size of the Chase-Kamara scheme depends on the number of stored documents. In this paper, we propose a modified scheme whose trapdoor size does not depend on the number of stored documents. The modified scheme is constructed by using our multiple hashing technique which can transform a trapdoor of short length to that of long length without any secret information. We also show that the modified scheme achieves the same adaptive security as the Chase-Kamara scheme in the random oracle model. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|