Searchable symmetric encryption capable of searching for an arbitrary string

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A booming cloud service has made it possible to consider a third-party server as private storage. When storage is used as a document archive, it is useful to provide functionality that allows users to find documents containing a specified string as a substring. The current method for providing such functionality while keeping the contents of the documents secret, either has linear complexity in the total size of the documents or needs to extract keywords when the documents are stored. Therefore, no method exists for efficiently searching for an arbitrary string that has not been extracted as a keyword. We propose the first encryption scheme that enables efficient searching for an arbitrary string. Although our scheme leaks some information for the sake of efficiency, all information leaked is derived from the precise leakage profile we have defined. © 2016 The Authors Security and Communication Networks Published by John Wiley & Sons Ltd.

Cite

CITATION STYLE

APA

Uchide, Y., & Kunihiro, N. (2016). Searchable symmetric encryption capable of searching for an arbitrary string. In Security and Communication Networks (Vol. 9, pp. 1726–1736). John Wiley and Sons Inc. https://doi.org/10.1002/sec.1437

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free