当前位置: X-MOL 学术IEEE Trans. Emerg. Top. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A New Secure and Lightweight Searchable Encryption Scheme over Encrypted Cloud Data
IEEE Transactions on Emerging Topics in Computing ( IF 5.1 ) Pub Date : 2019-10-01 , DOI: 10.1109/tetc.2017.2737789
Shahzaib Tahir , Sushmita Ruj , Yogachandran Rahulamathavan , Muttukrishnan Rajarajan , Cornelius Glackin

Searchable Encryption is an emerging cryptographic technique that enables searching capabilities over encrypted data on the cloud. In this paper, a novel searchable encryption scheme for the client-server architecture has been presented. The scheme exploits the properties of the modular inverse to generate a probabilistic trapdoor which facilitates the search over the secure inverted index table. We propose indistinguishability that is achieved by using the property of a probabilistic trapdoor. We design and implement a proof of concept prototype and test our scheme with a real dataset of files. We analyze the performance of our scheme against our claim of the scheme being light weight. The security analysis yields that our scheme assures a higher level of security as compared to other existing schemes.

中文翻译:

一种新的基于加密云数据的安全轻量级可搜索加密方案

可搜索加密是一种新兴的加密技术,它支持对云上加密数据的搜索功能。在本文中,提出了一种用于客户端-服务器架构的新型可搜索加密方案。该方案利用模逆的特性来生成概率陷门,这有助于对安全倒排索引表的搜索。我们提出了通过使用概率陷门的属性实现的不可区分性。我们设计并实现了一个概念验证原型,并使用真实的文件数据集测试我们的方案。我们根据我们声称的方案重量轻来分析我们方案的性能。安全性分析表明,与其他现有方案相比,我们的方案确保了更高级别的安全性。
更新日期:2019-10-01
down
wechat
bug