HSSCOA: Constant-Round Secure Collaborative Analytics on Secret-Shared Database

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
IEEE Transactions on Services Computing Pub Date : 2026-09-01 Epub Date: 2026-04-17 DOI:10.1109/TSC.2026.3685314
Jiehang Zhuang;Zoe Lin Jiang;Jianting Ning;Peng Yang;Siu-Ming Yiu;Chuanyi Liu;Junbin Fang;Xuan Wang
{"title":"HSSCOA: Constant-Round Secure Collaborative Analytics on Secret-Shared Database","authors":"Jiehang Zhuang;Zoe Lin Jiang;Jianting Ning;Peng Yang;Siu-Ming Yiu;Chuanyi Liu;Junbin Fang;Xuan Wang","doi":"10.1109/TSC.2026.3685314","DOIUrl":null,"url":null,"abstract":"Secure collaborative analytics enables multiple data owners to contribute their data to perform query analytics without learning each other’s data. Although current systems are well-optimized for horizontal scenarios, they are not as effective in vertical scenarios. The join operator is the key performance bottleneck of vertically collaborative data analysis. The existing secure nested-loop two-way join approach results in <inline-formula><tex-math>$O(n^{2})$</tex-math></inline-formula> computation and communication complexity, where <inline-formula><tex-math>$n$</tex-math></inline-formula> represents table size. In this paper, we propose HSSCOA, a secure collaborative analytics system to execute join-aggregation queries on secret-shared database. particularly, we propose a simplified homomorphic secret sharing (HSS) supporting just single multiplication, called one-time multiplication HSS. Combined with secret-shared sorting protocol, we then design a secure and efficient two-way join protocol that achieves constant rounds of interaction and <inline-formula><tex-math>$O(n \\log n)$</tex-math></inline-formula> communication. We further extend our framework to support multi-way joins and various join variants. Comprehensive experiments implemented on MP-SPDZ demonstrate that HSSCOA significantly outperforms existing sort-based protocols in WAN settings due to its constant-round design.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"19 5","pages":"3184-3197"},"PeriodicalIF":6.2000,"publicationDate":"2026-09-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/11483295/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/4/17 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Secure collaborative analytics enables multiple data owners to contribute their data to perform query analytics without learning each other’s data. Although current systems are well-optimized for horizontal scenarios, they are not as effective in vertical scenarios. The join operator is the key performance bottleneck of vertically collaborative data analysis. The existing secure nested-loop two-way join approach results in $O(n^{2})$ computation and communication complexity, where $n$ represents table size. In this paper, we propose HSSCOA, a secure collaborative analytics system to execute join-aggregation queries on secret-shared database. particularly, we propose a simplified homomorphic secret sharing (HSS) supporting just single multiplication, called one-time multiplication HSS. Combined with secret-shared sorting protocol, we then design a secure and efficient two-way join protocol that achieves constant rounds of interaction and $O(n \log n)$ communication. We further extend our framework to support multi-way joins and various join variants. Comprehensive experiments implemented on MP-SPDZ demonstrate that HSSCOA significantly outperforms existing sort-based protocols in WAN settings due to its constant-round design.
秘密共享数据库的恒轮安全协同分析
安全协作分析使多个数据所有者能够贡献他们的数据来执行查询分析,而无需了解彼此的数据。虽然目前的系统已经很好地针对水平场景进行了优化,但它们在垂直场景中并不那么有效。连接算子是垂直协同数据分析的关键性能瓶颈。现有的安全嵌套循环双向连接方法导致$O(n^{2})$计算和通信复杂度,其中$n$表示表大小。本文提出了一种安全的协同分析系统HSSCOA,用于在秘密共享数据库上执行连接聚合查询。特别地,我们提出了一种简化的只支持单次乘法的同态秘密共享(HSS),称为一次性乘法HSS。结合保密共享排序协议,设计了一种安全高效的双向连接协议,实现了恒轮交互和$O(n \log n)$通信。我们进一步扩展了框架,以支持多路连接和各种连接变体。在MP-SPDZ上实施的综合实验表明,由于其恒轮设计,HSSCOA在广域网环境下显著优于现有的基于排序的协议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书