Deterministic and Efficiently Searchable Encryption
Deterministic and Efficiently Searchable Encryption
复制标题
DOI：
10.1007/978-3-540-74143-5_30
复制
发表时间：
2007-08
期刊：
影响因子：
--
通讯作者：
M. Bellare;A. Boldyreva;Adam O'Neill
中科院分区：
文献类型：
--
作者：
M. Bellare;A. Boldyreva;Adam O'Neill
我们提出了尽可能强的隐私定义，以及实现它们的构造，用于加密算法是确定性的公钥加密方案。因此，我们获得了允许快速（即次线性，实际上是对数时间）搜索的数据库加密方法，同时可以证明在这种快速搜索约束下提供尽可能强的隐私。我们的一个构造称为RSA-DOAEP，它具有保留长度的附加特性，因此它是公钥密码的第一个示例。我们对此进行了推广，以获得一种有效可搜索的加密方案的概念，该方案通过一种称为桶化的技术允许更灵活的隐私来进行搜索时间权衡。我们的结果回答了数据库社区中经常被问到的问题，并为在那里完成的工作提供了基础。
We present as-strong-as-possible definitions of privacy, and constructions achieving them, for public-key encryption schemes where the encryption algorithm isdeterministic. We obtain as a consequence database encryption methods that permit fast (i.e. sub-linear, and in fact logarithmic, time) search while provably providing privacy that is as strong as possible subject to this fast search constraint. One of our constructs, called RSA-DOAEP, has the added feature of being length preserving, so that it is the first example of a public-key cipher. We generalize this to obtain a notion of efficiently-searchable encryption schemes which permit more flexible privacy to search-time trade-offs via a technique called bucketization. Our results answer much-asked questions in the database community and provide foundations for work done there.