{"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.
期刊介绍:
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.