From a view point of information security, researches on an encrypted search system have been done intensively. Such search systems are called searchable symmetric encryption (SSE). The main part of SSE is an encrypted index which affects security and efficiency. Until now many SSE schemes have been proposed, but most of them uses a random oracle to achieve both adaptive security and an optimal index size. The index size of adaptively secure SSE schemes without a random oracle can be much larger. In this paper, we propose a new SSE scheme which satisfies adaptive security in the standard model and has an optimal index size. Furthermore the index of our scheme consists of Bloom filters and simple arrays, that is, arrays of integers. Since Bloom filters are also implemented by an array of integers, the structure of the index is simple. Thus, unlike other SSE schemes with an optimal index size, the size does not depend on a security parameter.
CITATION STYLE
Miyoshi, R., Yamamoto, H., Fujiwara, H., & Miyazaki, T. (2017). Practical and secure searchable symmetric encryption with a small index. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10674 LNCS, pp. 53–69). Springer Verlag. https://doi.org/10.1007/978-3-319-70290-2_4
Mendeley helps you to discover research relevant for your work.