ISSN 1000-1239 CN 11-1777/TP

计算机研究与发展 ›› 2017, Vol. 54 ›› Issue (10): 2107-2120.doi: 10.7544/issn1000-1239.2017.20170627

所属专题: 2017应用驱动的网络空间安全研究进展

• 综述 • 上一篇    下一篇



  1. (华东师范大学计算机科学与软件工程学院密码与网络安全系 上海 200062) (
  • 出版日期: 2017-10-01
  • 基金资助: 

Research Advances on Secure Searchable Encryption

Dong Xiaolei, Zhou Jun, Cao Zhenfu   

  1. (Department of Cryptography and Network Security, School of Computer Science and Software Engineering, East China Normal University, Shanghai 200062)
  • Online: 2017-10-01

摘要: 随着大数据与云计算的发展,以可搜索加密为核心技术的安全搜索问题日益成为国内外研究的热点.围绕可搜索加密的新理论、新方法和新技术,针对可搜索加密的模式、安全性、表达能力和搜索效率等方面进行综述.主要内容如下:安全搜索必不可少的新理论研究进展,包括可搜索加密、属性基加密及其轻量化等相关理论问题的研究情况介绍;基于公钥密码算法(包括轻量化公钥密码算法)的安全搜索研究中,提出的减少公钥密码算法的使用次数的新方法概述;针对体域网、车载网、智能电网等新兴网络应用服务,介绍了前述新理论、新方法的应用情况.实现安全搜索,通常将不得不多次使用开销极大的公钥密码算法,所以在资源受限的网络中“怎么使用公钥密码算法”就成为一个关键问题.因此除了轻量化实现技术,减少使用公钥密码算法的次数(尤其是只使用一次)应成为高效解决这类问题的最为关键的步骤.此外,还指出了该领域当前研究中需要解决的公开问题和未来的发展趋势.

关键词: 安全搜索, 可搜索加密, 轻量化, 属性基加密, 高效实现

Abstract: With the development of big data and cloud computing, the issue of secure search via the technique of searchable encryption has increasingly been the focus of the researchers in cryptography and network security all over the world. In the light of the new theories, new solutions and new techniques of searchable encryption, this paper presents a survey mainly from the following four aspects: the modes, the security, the expressiveness and the efficiency of secure searchable encryption. It discusses the new theories which are essential to secure search for ubiquitous network, including searchable encryption, attribute-based encryption, and applying these cryptographic mechanisms to obtain the generalized solutions to the theoretical problems of secure search in types of new emerging network services. Based on the aforementioned theoretical results, this paper studies the new approaches to construct practical secure search for these network services, comprising the light-weight public-key cryptographic algorithms, reducing the times of applying the light-weight public-key cryptographic algorithms in secure search, and exploiting any public-key cryptographic algorithm only once to obtain new approaches for secure search in the environment of resource-constrained network applications. We also focus on studying how to apply the new theories and approaches to solve the problems associated to secure search in different kinds of networks, including body area network, wireless vehicular ad hoc network, smart grid and so on. It is traditionally required to apply inefficient public-key cryptographic algorithms a number of times to construct secure search protocols. How to manipulate the public-key cryptographic algorithms and make them suitable to be used in resource-constrained networks becomes the key issue. Light-weighting public-key cryptographic algorithms is certainly a convincing way to address it. On the other hand, minimizing the number (once would be ideal) of applying the light-weighted public-key cryptographic algorithms guarantees more efficient and practical solutions and thus is the key problem to address the issue. Finally, we suggest several interesting open research issues and the trend in the future.

Key words: secure search, searchable encryption, lightweight, attribute-based encryption, efficient implementation