Name
Abstract | ||
|---|---|---|
Searchable encryption is a technique that allows a client to store data in encrypted form on a curious server, such that data can be retrieved while leaking a minimal amount of information to the server. Many searchable encryption schemes have been proposed and proved secure in their own computational model. In this paper we propose a generic model for the analysis of searchable encryptions. We then identify the security parameters of searchable encryption schemes and prove information theoretical bounds on the security of the parameters. We argue that perfectly secure searchable encryption schemes cannot be efficient. We classify the seminal schemes in two categories: the schemes that leak information upfront during the storage phase, and schemes that leak some information at every search. This helps designers to choose the right scheme for an application. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-88625-9_23 | ICICS |
Keywords | Field | DocType |
leak information upfront,generic model,information theoretic analysis,searchable encryption scheme,searchable encryption,own computational model,encrypted form,minimal amount,information theoretical bound,security parameter,curious server,computer model | Information leakage,Computer science,Computer network,Encryption,Cryptographic primitive,Probabilistic encryption,Hash function,On-the-fly encryption,Filesystem-level encryption,Provable security | Conference |
Volume | ISSN | Citations |
5308 | 0302-9743 | 2 |
PageRank | References | Authors |
0.65 | 11 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Saeed Sedghi | 1 | 64 | 4.52 |
| Jeroen Doumen | 2 | 326 | 21.84 |
| Pieter Hartel | 3 | 1159 | 115.28 |
| Willem Jonker | 4 | 640 | 55.71 |