SecDiv: Privacy-Preserving Diversity-Constrained Top-$k$k Query Processing in the Cloud

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
IEEE Transactions on Services Computing Pub Date : 2026-07-01 Epub Date: 2026-06-04 DOI:10.1109/TSC.2026.3700282
Yinxing Zhang;Guang Tang;Qingwang Wang;Songlei Wang;Zhiquan Liu;Zhongyun Hua
{"title":"SecDiv: Privacy-Preserving Diversity-Constrained Top-$k$k Query Processing in the Cloud","authors":"Yinxing Zhang;Guang Tang;Qingwang Wang;Songlei Wang;Zhiquan Liu;Zhongyun Hua","doi":"10.1109/TSC.2026.3700282","DOIUrl":null,"url":null,"abstract":"With the proliferation of cloud computing, outsourcing databases has become a common strategy for reducing on premise storage and computation costs. However, this approach raises serious privacy concerns, as sensitive data and query information may be exposed to the cloud. While existing top-<inline-formula><tex-math>$k$</tex-math></inline-formula> query methods have made progress in performance and privacy protection, they offer limited support for the more advanced requirement of diversity-constrained queries. In light of this, we present SecDiv, the first privacy-preserving query system that supports diversity constraints over ciphertext in the cloud. SecDiv is built on a two-server distributed trust model and lightweight additive secret sharing, and hides data contents under an honest-but-curious, non-colluding adversary model to ensure that cloud servers learn no sensitive information. SecDiv comprises three customized secure components: SecDMap maps the structured database of the data owner into two secret-shared tables; SecQMap translates each SQL statement and its diversity constraints into vectors whose lengths match the database attributes, thereby hiding targeted attributes and literal values; and SecCQ performs secure filtering, ordering, and top-<inline-formula><tex-math>$k$</tex-math></inline-formula> selection in the cloud, centered on a secure most significant bit comparison implemented by a parallel-prefix adder. A formal security analysis is conducted to provide theoretical guarantees for the security of SecDiv. SecDiv is evaluated on three real datasets, with diversity constraints configured using top-<inline-formula><tex-math>$k$</tex-math></inline-formula> and category count conditions to emulate practical ranking scenarios. Compared with a plaintext baseline, SecDiv achieves identical results with 100% accuracy. Query latency remains practical, with second-level response times in typical settings, and communication overhead increases as expected. Overall, experimental results demonstrate that SecDiv attains a balanced trade-off among privacy, accuracy, and efficiency in real-world cloud service environments.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"19 4","pages":"3029-3041"},"PeriodicalIF":6.2000,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11551526/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/6/4 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

With the proliferation of cloud computing, outsourcing databases has become a common strategy for reducing on premise storage and computation costs. However, this approach raises serious privacy concerns, as sensitive data and query information may be exposed to the cloud. While existing top-$k$ query methods have made progress in performance and privacy protection, they offer limited support for the more advanced requirement of diversity-constrained queries. In light of this, we present SecDiv, the first privacy-preserving query system that supports diversity constraints over ciphertext in the cloud. SecDiv is built on a two-server distributed trust model and lightweight additive secret sharing, and hides data contents under an honest-but-curious, non-colluding adversary model to ensure that cloud servers learn no sensitive information. SecDiv comprises three customized secure components: SecDMap maps the structured database of the data owner into two secret-shared tables; SecQMap translates each SQL statement and its diversity constraints into vectors whose lengths match the database attributes, thereby hiding targeted attributes and literal values; and SecCQ performs secure filtering, ordering, and top-$k$ selection in the cloud, centered on a secure most significant bit comparison implemented by a parallel-prefix adder. A formal security analysis is conducted to provide theoretical guarantees for the security of SecDiv. SecDiv is evaluated on three real datasets, with diversity constraints configured using top-$k$ and category count conditions to emulate practical ranking scenarios. Compared with a plaintext baseline, SecDiv achieves identical results with 100% accuracy. Query latency remains practical, with second-level response times in typical settings, and communication overhead increases as expected. Overall, experimental results demonstrate that SecDiv attains a balanced trade-off among privacy, accuracy, and efficiency in real-world cloud service environments.
SecDiv:云中的隐私保护多样性约束Top-$k$查询处理
随着云计算的普及,外包数据库已成为降低本地存储和计算成本的常用策略。然而,这种方法引起了严重的隐私问题,因为敏感数据和查询信息可能会暴露在云中。虽然现有的top- k查询方法在性能和隐私保护方面取得了进展,但它们对多样性约束查询的更高级需求提供的支持有限。鉴于此,我们提出了SecDiv,这是第一个支持云中密文多样性约束的隐私保护查询系统。SecDiv建立在双服务器分布式信任模型和轻量级附加秘密共享的基础上,并将数据内容隐藏在诚实但好奇、非勾结的对手模型下,以确保云服务器不了解敏感信息。SecDiv包含三个自定义的安全组件:SecDMap将数据所有者的结构化数据库映射到两个秘密共享表;SecQMap将每个SQL语句及其多样性约束转换为长度与数据库属性匹配的向量,从而隐藏目标属性和文字值;SecCQ在云中执行安全过滤、排序和top- k选择,以并行前缀加法器实现的安全最高有效位比较为中心。进行了形式化的安全性分析,为SecDiv的安全性提供理论保障。SecDiv在三个真实数据集上进行评估,使用top- k和类别计数条件配置多样性约束,以模拟实际排名场景。与明文基线相比,SecDiv以100%的准确率获得相同的结果。查询延迟仍然是可行的,在典型设置中具有秒级响应时间,并且通信开销如预期的那样增加。总体而言,实验结果表明SecDiv在真实的云服务环境中实现了隐私、准确性和效率之间的平衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书