Research Advances on Secure Searchable Encryption

被引：0
|
作者：
Dong X. [1 ]
Zhou J. [1 ]
Cao Z. [1 ]
机构：
[1] Department of Cryptography and Network Security, School of Computer Science and Software Engineering, East China Normal University, Shanghai
来源：
Cao, Zhenfu (zfcao@sei.ecnu.edu.cn) | 1600年 / Science Press卷 / 54期
基金：
中国国家自然科学基金; 上海市自然科学基金;
关键词：
Attribute-based encryption; Efficient implementation; Lightweight; Searchable encryption; Secure search;
D O I：
10.7544/issn1000-1239.2017.20170627
中图分类号：
学科分类号：
摘要：
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. © 2017, Science Press. All right reserved.
引用
收藏
页码：2107 / 2120
页数：13
相关论文
共 92 条
  • [1] Song X., Wagner D., Perrig A., Practical techniques for searches on encrypted data, Proc of IEEE Symp on Security and Privacy 2000, pp. 44-55, (2000)
  • [2] Boneh D., Kushilevitz E., Ostrovsky R., Public Key encryption with keyword search, LNCS 3027: Proc of Eurocrypt 2004, pp. 506-522, (2004)
  • [3] Waters B., Balfanz D., Durfee G., Building an encrypted and searchable audit log, Proc of NDSS 2004, pp. 5-6, (2004)
  • [4] Golle P., Staddon J., Waters B., Secure conjunctive keyword search over encrypted data, Proc of ACNS 2004, pp. 31-45, (2004)
  • [5] Park D.J., Kim K., Lee P.J., Public key encryption with conjunctive field keyword search, Information Security Applications, 3325, pp. 73-86, (2005)
  • [6] Curtmola R., Garay J.A., Kamara S., Et al., Searchable symmetric encryption: Improved definitions and efficient constructions, Proc of ACM CCS 2006, pp. 79-88, (2006)
  • [7] Wang P., Wang H., Pieprzyk J., Threshold privacy preserving keyword searches, Proc of SOFSEM 2008, pp. 646-658, (2008)
  • [8] Park D.J., Cha J.Y., Lee P.J., Searchable keyword-based encryption, 2005/367, (2005)
  • [9] Baron J., Defrawy K.E., Minkovich K., Et al., R.5pm: Secure pattern matching, Proc of the 8th Int Conf on Security and Cryptography for Networks, pp. 222-240, (2012)
  • [10] Hazay C., Toft T., Computationally secure pattern matching in the presence of malicious adversaries, Proc of ASIACRYPT 2010, pp. 195-212, (2010)
12345678910