Efficient public key encryption with revocable keyword search
Efficient public key encryption with revocable keyword search
复制标题
具有可撤销关键字搜索的高效公钥加密
DOI：
10.1002/sec.790
复制
发表时间：
2014-02-01
影响因子：
--
通讯作者：
Susilo, Willy
中科院分区：
文献类型：
--
作者：
Yu, Yong;Ni, Jianbing;Susilo, Willy
带关键字搜索的公钥加密是一种新的密码原语，使人们能够直接在加密数据上进行搜索。在已知的方案中，一旦获得陷门，服务器就可以不受任何限制地搜索关联数据。然而，在现实中，有时必须防止服务器始终搜索数据，因为服务器并不完全受信任。在本文中，我们提出了公钥加密和可撤销关键字搜索的概念来解决这个问题。我们还开发了一个具体的结构，将整个系统的生命周期划分为不同的时间，以实现我们的目标。该方案在共同判定双线性Diffie-Hellman假设下实现了密文对自适应选择关键字攻击的不可区分性。与两种方案相比，我们的方案在计算成本方面提供了更好的性能。版权所有(C)2013 John Wiley&Sons，Ltd.
Public key encryption with keyword search is a novel cryptographic primitive enabling one to search on the encrypted data directly. In the known schemes, once getting a trapdoor, the server can search associated data without any restrictions. However, in reality, it is sometimes essential to prevent the server from searching the data all the time because the server is not fully trusted. In this paper, we propose the notion of public key encryption with revocable keyword search to address the issue. We also develop a concrete construction by dividing the whole life of the system into distinct times to achieve our goals. The proposed scheme achieves the properties of the indistinguishability of ciphertexts against an adaptive chosen keywords attack security under the co-decisional bilinear Diffie-Hellman assumption in our security model. Compared with two somewhat schemes, ours offers much better performance in terms of computational cost. Copyright (c) 2013 John Wiley & Sons, Ltd.