A New Leakage Resilient Symmetric Searchable Encryption Scheme for Phrase Search

Samiran Bag, I. G. Ray, F. Hao
{"title":"A New Leakage Resilient Symmetric Searchable Encryption Scheme for Phrase Search","authors":"Samiran Bag, I. G. Ray, F. Hao","doi":"10.5220/0011273600003283","DOIUrl":null,"url":null,"abstract":": Symmetric searchable encryption (SSE) schemes are preferred over asymmetric ones for their lower computa-tional cost. Owing to the big data size of most of the cloud applications, SSE with keyword search often yields a large number of search results matching the search criterion, but only a small portion of them is of actual interest. This results in unnecessary increase of network traffic. A customized search against a phrase instead of keywords can yield more specific and relevant search results and can reduce the network traffic. This motivates the idea of phrase search in SSE. Most of the existing symmetric key searchable encryption schemes either do not support phrase search or have unwanted leakage associated with them. In this paper, we propose a symmetric key searchable encryption scheme for phrase search that minimizes the leakage of information from search pattern and access pattern . We propose a probabilistic trapdoor generation algorithm for phrase search and thereby prevent the leakage due to search pattern . In earlier SSE based schemes, an honest-but-curious server could always learn about the position of the sentences and keywords in the encrypted text after the search operation is performed. This is referred to as the leakage from access pattern . This may turn out to be a significant security concern owing to the prior knowledge of positions of certain sentences and keywords in certain documents. In this paper, we provide the access pattern secure encryption scheme such that, an honest-but-curious cloud server could not learn anything about the position of the phrase in the sentence even after the search. We implement a prototype of our scheme and validate it against commercial data and provide security and performance analysis to demonstrate its practicality.","PeriodicalId":74779,"journal":{"name":"SECRYPT ... : proceedings of the International Conference on Security and Cryptography. International Conference on Security and Cryptography","volume":"50 1","pages":"366-373"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SECRYPT ... : proceedings of the International Conference on Security and Cryptography. International Conference on Security and Cryptography","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5220/0011273600003283","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

: Symmetric searchable encryption (SSE) schemes are preferred over asymmetric ones for their lower computa-tional cost. Owing to the big data size of most of the cloud applications, SSE with keyword search often yields a large number of search results matching the search criterion, but only a small portion of them is of actual interest. This results in unnecessary increase of network traffic. A customized search against a phrase instead of keywords can yield more specific and relevant search results and can reduce the network traffic. This motivates the idea of phrase search in SSE. Most of the existing symmetric key searchable encryption schemes either do not support phrase search or have unwanted leakage associated with them. In this paper, we propose a symmetric key searchable encryption scheme for phrase search that minimizes the leakage of information from search pattern and access pattern . We propose a probabilistic trapdoor generation algorithm for phrase search and thereby prevent the leakage due to search pattern . In earlier SSE based schemes, an honest-but-curious server could always learn about the position of the sentences and keywords in the encrypted text after the search operation is performed. This is referred to as the leakage from access pattern . This may turn out to be a significant security concern owing to the prior knowledge of positions of certain sentences and keywords in certain documents. In this paper, we provide the access pattern secure encryption scheme such that, an honest-but-curious cloud server could not learn anything about the position of the phrase in the sentence even after the search. We implement a prototype of our scheme and validate it against commercial data and provide security and performance analysis to demonstrate its practicality.
一种新的抗泄漏对称可搜索短语搜索加密方案
:对称可搜索加密(SSE)方案优于非对称加密方案,因为其计算成本较低。由于大多数云应用的数据量都很大,使用关键字搜索的SSE通常会产生大量符合搜索条件的搜索结果,但其中只有一小部分是真正感兴趣的。这将导致不必要的网络流量增加。针对短语而不是关键字进行自定义搜索可以产生更具体和相关的搜索结果,并可以减少网络流量。这激发了SSE中短语搜索的思想。大多数现有的对称密钥可搜索加密方案要么不支持短语搜索,要么存在不必要的泄漏。本文提出了一种对称密钥可搜索的短语搜索加密方案,该方案最大限度地减少了搜索模式和访问模式的信息泄漏。提出了一种用于短语搜索的概率活板门生成算法,从而防止了由于搜索模式导致的泄漏。在早期基于SSE的方案中,在执行搜索操作后,诚实但好奇的服务器始终可以了解加密文本中句子和关键字的位置。这被称为访问模式的泄漏。由于事先知道某些句子和某些文档中的关键字的位置,这可能会成为一个重大的安全问题。在本文中,我们提供了一种访问模式安全加密方案,使得一个诚实但好奇的云服务器即使在搜索之后也无法了解短语在句子中的位置。我们实现了该方案的原型,并针对商业数据对其进行了验证,并提供了安全性和性能分析来证明其实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信