Sciweavers

Share
SDMW
2010
Springer

Computationally Efficient Searchable Symmetric Encryption

8 years 8 months ago
Computationally Efficient Searchable Symmetric Encryption
Searchable encryption is a technique that allows a client to store documents on a server in encrypted form. Stored documents can be retrieved selectively while revealing as little information as possible to the server. In the symmetric searchable encryption domain, the storage and the retrieval are performed by the same client. Most conventional searchable encryption schemes suffer from two disadvantages. First, searching the stored documents takes time linear in the size of the database, and/or uses heavy arithmetic operations. Secondly, the existing schemes do not consider adaptive attackers; a search-query will reveal information even about documents stored in the future. If they do consider this, it is at a significant cost to updates. In this paper we propose a novel symmetric searchable encryption scheme that offers searching at constant time in the number of unique keywords stored on the server. We present two variants of the basic scheme which differ in the efficiency of search...
Peter van Liesdonk, Saeed Sedghi, Jeroen Doumen, P
Added 14 Feb 2011
Updated 14 Feb 2011
Type Journal
Year 2010
Where SDMW
Authors Peter van Liesdonk, Saeed Sedghi, Jeroen Doumen, Pieter H. Hartel, Willem Jonker
Comments (0)
books