IF 0.3 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Mamta, B. Gupta, Syed Taqi Ali
{"title":"ISEkFT","authors":"Mamta, B. Gupta, Syed Taqi Ali","doi":"10.4018/jitr.2019070108","DOIUrl":null,"url":null,"abstract":"Public-key encryption with keyword search (PEKS) is a well-known technique which allows searching on encrypted data using the public key system. However, this technique suffers from the keyword guessing attack (KGA). To address this problem, a modified version of PEKS called public key encryption with fuzzy keyword search (PEFKS) has been introduced where each keyword is associated with an exact search trapdoor (EST) and a fuzzy search trapdoor (FST) which is provided to the cloud server. PEFKS prevents KGA in such a way that two or maximum three keywords share the same FST. Hence, even if the cloud server knows the FST it cannot link it to the corresponding keyword. But, with a probability of 1/3 the malicious cloud server can still guess the keyword corresponding to FST. Therefore, in this article, the authors present an approach which can improve the security of the PEFKS technique by reducing the probability of guessing the keyword to 1/k where k is the number of keywords that share the same FST, thus enhancing the overall reliability. In addition, the authors have used an identity-based encryption (IBE) as an underlying technique to construct the searchable encryption scheme and proved its security in the standard model.","PeriodicalId":43429,"journal":{"name":"Journal of Information Technology Research","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Technology Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/jitr.2019070108","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 4

摘要

带关键字搜索的公钥加密(PEKS)是一种众所周知的技术,它允许使用公钥系统搜索加密的数据。然而,这种技术遭受关键字猜测攻击(KGA)。为了解决这个问题,引入了PEKS的修改版本,称为带有模糊关键字搜索的公钥加密(PEFKS),其中每个关键字都与提供给云服务器的精确搜索陷阱门(EST)和模糊搜索陷阱门(FST)相关联。PEFKS以这样的方式防止KGA,即两个或最多三个关键字共享相同的FST。因此,即使云服务器知道FST,也无法将其链接到相应的关键字。但是,恶意云服务器仍然可以以1/3的概率猜出FST对应的关键字。因此,在本文中,作者提出了一种方法,可以通过将猜测关键字的概率降低到1/k (k是共享相同FST的关键字的数量)来提高PEFKS技术的安全性,从而提高整体可靠性。此外,作者还使用基于身份的加密(IBE)作为底层技术来构建可搜索的加密方案,并在标准模型中证明了其安全性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
ISEkFT
Public-key encryption with keyword search (PEKS) is a well-known technique which allows searching on encrypted data using the public key system. However, this technique suffers from the keyword guessing attack (KGA). To address this problem, a modified version of PEKS called public key encryption with fuzzy keyword search (PEFKS) has been introduced where each keyword is associated with an exact search trapdoor (EST) and a fuzzy search trapdoor (FST) which is provided to the cloud server. PEFKS prevents KGA in such a way that two or maximum three keywords share the same FST. Hence, even if the cloud server knows the FST it cannot link it to the corresponding keyword. But, with a probability of 1/3 the malicious cloud server can still guess the keyword corresponding to FST. Therefore, in this article, the authors present an approach which can improve the security of the PEFKS technique by reducing the probability of guessing the keyword to 1/k where k is the number of keywords that share the same FST, thus enhancing the overall reliability. In addition, the authors have used an identity-based encryption (IBE) as an underlying technique to construct the searchable encryption scheme and proved its security in the standard model.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Information Technology Research
Journal of Information Technology Research COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-
自引率
0.00%
发文量
82
×
引用
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学术官方微信