Towards an Information Theoretic Analysis of Searchable Encryption
Towards an Information Theoretic Analysis of Searchable Encryption
复制标题
可搜索加密的信息论分析
DOI：
10.1007/978-3-540-88625-9_23
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
W. Jonker
中科院分区：
文献类型：
--
作者：
Saeed Sedghi;J. Doumen;P. Hartel;W. Jonker
可搜索加密是一种允许客户端存储数据的技术
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.