Time-specific encrypted range query with minimum leakage disclosure

IET Inf. Secur. Pub Date : 2020-12-29 DOI:10.1049/ise2.12010
Ozgur Oksuz
{"title":"Time-specific encrypted range query with minimum leakage disclosure","authors":"Ozgur Oksuz","doi":"10.1049/ise2.12010","DOIUrl":null,"url":null,"abstract":"A time ‐ specific encrypted range query scheme that has the following properties is proposed. (1) The proposed scheme has trapdoor privacy and data privacy so that a semi ‐ honest cloud is not able to get any useful information from given ciphertexts and given tokens that are used for searching ranges. (2) Unlike most of the other studies which report that the cloud server stores single encrypted keyword/element in the database, in our solution, the cloud server stores encrypted multi ‐ keywords/ranges in the database. Therefore, the semi ‐ honest cloud compares ciphertexts to tokens as ranges based on a predefined threshold ϕ value. This approach decreases the cloud search time since the cloud compares ranges to ranges (multi ‐ keywords with multi ‐ keywords) not points to points (not a keyword with a keyword). Thus, the proposed scheme is efficient based on searching ranges on ciphertexts. (3) Moreover, the communication cost between users and the cloud is decreased from O ( n ) to O (log n ), where n is the size of a range. Users send logarithmic size information to the cloud server instead of sending linear size information.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Inf. Secur.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/ise2.12010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A time ‐ specific encrypted range query scheme that has the following properties is proposed. (1) The proposed scheme has trapdoor privacy and data privacy so that a semi ‐ honest cloud is not able to get any useful information from given ciphertexts and given tokens that are used for searching ranges. (2) Unlike most of the other studies which report that the cloud server stores single encrypted keyword/element in the database, in our solution, the cloud server stores encrypted multi ‐ keywords/ranges in the database. Therefore, the semi ‐ honest cloud compares ciphertexts to tokens as ranges based on a predefined threshold ϕ value. This approach decreases the cloud search time since the cloud compares ranges to ranges (multi ‐ keywords with multi ‐ keywords) not points to points (not a keyword with a keyword). Thus, the proposed scheme is efficient based on searching ranges on ciphertexts. (3) Moreover, the communication cost between users and the cloud is decreased from O ( n ) to O (log n ), where n is the size of a range. Users send logarithmic size information to the cloud server instead of sending linear size information.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有最小泄漏披露的特定时间加密范围查询
提出了一种具有以下特性的特定时间加密范围查询方案。(1)提出的方案具有陷门隐私和数据隐私,使得半诚实云无法从用于搜索范围的给定密文和给定令牌中获取任何有用的信息。(2)与大多数其他报告云服务器在数据库中存储单个加密关键字/元素的研究不同,在我们的解决方案中,云服务器在数据库中存储加密的多关键字/范围。因此,半诚实云将密文与令牌作为基于预定义阈值ϕ值的范围进行比较。这种方法减少了云搜索时间,因为云比较范围与范围(多关键字与多关键字),而不是点与点(不是关键字与关键字)。因此,该方案基于密文的搜索范围是有效的。(3)用户与云之间的通信成本从O (n)降低到O (log n),其中n为范围的大小。用户向云服务器发送对数大小信息,而不是发送线性大小信息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Revisit Two Memoryless State-Recovery Cryptanalysis Methods on A5/1 Improved Lattice-Based Mix-Nets for Electronic Voting Adaptive and survivable trust management for Internet of Things systems Comment on 'Targeted Ciphers for Format-Preserving Encryption' from Selected Areas in Cryptography 2018 Time-specific encrypted range query with minimum leakage disclosure
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1