Approach to keyword search over encrypted data in cloud

Peng ZHANG; Yan LI; Hai-lun LIN; Rong YANG; Qing-yun LIU

doi:10.3969/j.issn.1000-436x.2014.z2.020

您当前的位置：

首页 >

文章列表页 >

Approach to keyword search over encrypted data in cloud

Papers | 更新时间：2024-06-05

- Approach to keyword search over encrypted data in cloud
- Journal on Communications Vol. 35, Issue Z2, Pages: 147-153(2014)
- 作者机构：
  
  1. 中国科学院信息工程研究所，北京 100093
  2. 信息内容安全技术国家工程实验室，北京 100093
  3. 国家计算机网络应急技术处理协调中心，北京 100029
  4. 中国科学院计算技术研究所，北京 100049
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(61402464）);The Ph.D.Programs Foundation of China(2013M541076)
- DOI：10.3969/j.issn.1000-436x.2014.z2.020
  CLC： TP319
- Online First：2014-11，
  
  Published：30 November 2014
- 稿件说明：
移动端阅览
Peng ZHANG, Yan LI, Hai-lun LIN, et al. Approach to keyword search over encrypted data in cloud[J]. Journal on Communications, 2014, 35(Z2): 147-153.
DOI：

Peng ZHANG, Yan LI, Hai-lun LIN, et al. Approach to keyword search over encrypted data in cloud[J]. Journal on Communications, 2014, 35(Z2): 147-153. DOI： 10.3969/j.issn.1000-436x.2014.z2.020.

摘要

随着云计算的出现，越来越多的数据开始集中存储到云端，为了保护数据隐私，敏感数据需要在外包到云端之前进行加密，使在加密数据上进行有效检索成为一个挑战性任务。尽管传统的加密检索模型支持在加密数据上进行关键词检索，但是它们没有描述检索结果的相关度，导致返回所有包含关键词的检索结果占用了大量的网络带宽，并且用户从返回的检索结果中再次选择最相关的结果也会产生大量的时间开销，为此，提出了云计算环境下支持排名的关键词加密检索方法。该方法根据相关度返回排序后的检索结果，其中的保序对称加密模型不仅防止了相关度信息的泄漏，而且提供了高效的检索性能。实验表明了该方法的有效性。

Abstract

With the advent of cloud computing

large-scale data are being increasingly outsourced to the cloud.For the protection of data privacy

sensitive data has to be encrypted before outsourcing

which makes effective data utilization a very challenging task.Although traditional searchable encryption approaches allow users to search over encrypted data through keywords

they don’t capture any relevance of data files

so users have to spend much time on post-processing every retrieved file in order to find ones most matching their interest.Moreover

retrieving all files containing the queried keyword further incurs unnecessary network traffic

which is not accord with pay-as-you-use cloud paradigm.An approach to ranked keyword search over encrypted data in cloud is proposed.Ranked search greatly mitigate the user’s effort by returning the matching files in a ranked order

and also protects the data privacy by order-preserving encryption.Extensive experimental results demonstrate the efficiency.

关键词

Keywords

references

VAQUERO L M , RODERO-MERINO L , CACERES J , et al . A break in the clouds:towards a cloud definition [J ] . ACM SIGCOMM Computer Communication Review , 2009 , 39 ( 1 ): 50 - 55 .

孟小峰 , 慈祥 . 大数据管理:概念,技术与挑战 [J ] . 计算机研究与发展 , 2013 , 50 ( 1 ): 146 - 169 .

MENG X F , CI X . Big data management:concepts,techniques and challenges [J ] . Journal of Computer Research and Development , 2013 , 50 ( 1 ): 146 - 169 .

KAMARA S , LAUTER K . Cryptographic Cloud Storage [M ] . Financial Cryptography and Date Security Berlin,Heidelberg , 2010 . 136 - 149 .

CURTMOLA R , GARAY J A , KAMARA S , et al . Searchable symmetric encryption:improved definitions and efficient constructions [A ] . Proceedings of the 13th ACM Conference on Computer and Communications Security [C ] . 2006 . 79 - 88 .

HWANG Y H , LEE P J . Public key encryption with conjunctive keyword search and its extension to a multi-user system [A ] . Pairing-Based Cryptography–Pairing 2007 [C ] . Springer Berlin Heidelberg , 2007 . 2 - 22 .

BOLDYREVA A , CHENETTE N , LEE Y , et al . Order-preserving symmetric encryption [A ] . Cryptology-EUROCRYPT 2009 [C ] . Springer Berlin Heidelberg , 2009 . 224 - 241 .

BOŽOVIĆ V , SOCEK D , STEINWANDT R , et al . Multi-authority attribute-based encryption with honest-but-curious central authority [J ] . International Journal of Computer Mathematics , 2012 , 89 ( 3 ): 268 - 283 .

SINGHAL A . Modern information retrieval:a brief overview [J ] . IEEE Data Engineering Bulletin , 2001 , 24 ( 4 ): 35 - 43 .

WITTEN I H , MOFFAT A , BELL T C . Managing Gigabytes:Compressing and Indexing Documents and Images [M ] . Morgan Kaufmann , 1999 .

PINKAS B , REINMAN T . Oblivious RAM revisited [A ] . Cryptology—CRYPTO 2010 [C ] . Springer Berlin Heidelberg , 2010 . 502 - 519 .

RFC . Request for Comments Database [EB/OL ] . http://www.ietf.org/rfc.html http://www.ietf.org/rfc.html .

SWAMINATHAN A , MAO Y , SU G M , et al . Confidentiality-preserving rank-ordered search [A ] . Proceedings of the 2007 ACM Workshop on Storage Security and Survivability [C ] . 2007 . 7 - 12 .

ZERR S , OLMEDILLA D , NEJDL W , et al . Zerber+r:top-k retrieval from a confidential index [A ] . Proceedings of the 12th International Conference on Extending Database Technology:Advances in Database Technology [C ] . 2009 . 439 - 449 .

Views

538

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

K-Means clustering outsourcing scheme based on sparse matrix transformation and bounded random perturbation

Cryptographic inference for large language model via secret sharing

Survey of research on efficient secure inference for deep learning

Privacy-preserving convolutional neural network inference scheme based on homomorphic ciphertext transformation

Cryptographic service optimization scheduling algorithm for collaborative jobs in cloud environment

Related Author

Zhao Wei

Tan Jingwen

Wang Huanran

Han Shuai

Yang Wu

Lai Mingzhu

CHENG Ke

XIA Yuheng

Related Institution

School of Computer Science and Technology, Harbin Engineering University

School of Mathematics and Statistics, Hainan Normal University

School of Computer Science and Technology, Xidian University

Shaanxi Key Laboratory of Network and System Security, Xidian University

Department of Cryptogram Engineering, Information Engineering University

AI问答

⁰