节点文献

跨信任域的联邦k-支配Skyline查询算法

Cross trust domain federated k-dominant skyline query processing

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 史烨轩童咏昕周昊许可吕卫锋

【Author】 SHI Yexuan;TONG Yongxin;ZHOU Hao;XU Ke;LYU Weifeng;State Key Laboratory of Software Development Environment, Beihang University;School of Computer Science and Engineering, Beihang University;Beijing Advanced Innovation Center for Future Blockchain and Privacy Computing, Beihang University;

【机构】 北京航空航天大学软件开发环境国家重点实验室北京航空航天大学计算机学院北京航空航天大学未来区块链与隐私计算高精尖创新中心

【摘要】 k-支配Skyline查询是一种主流的Skyline查询变种,其在多目标决策与推荐领域有着广泛的应用。随着这些应用规模不断扩大,在由多个参与方组成的数据联邦中进行跨域k-支配Skyline查询的需求日益旺盛。然而,由于数据联邦中的参与方之间彼此不互信,进行跨信任域的查询计算需引入大量安全操作,效率较低。为此提出了一种基于跨域隐私向量聚合的算法,从而实现高效的联邦k-支配Skyline查询,并运用一种密文压缩技术进一步优化查询效率,最后通过充分的实验验证了所提方案的优越性。

【Abstract】 k-dominant skyline is a prevailing skyline query which has widespread applications in multi-criteria decision making and recommendation. As these applications continuously scale up, there is an increasing demand to support k-dominant skyline over a data federation which consists of multiple data silos, each holding disjoint columns of the entire dataset. Yet it is challenging to support k-dominant skyline over a data federation. This is because strict security constraints are often imposed to query processing over data federations, whereas naively adopting security techniques leads to unacceptably inefficient queries. In this paper, we presented an efficient and secure k-dominant skyline for a data federation. Specifically, we devised a novel private vector aggregation-based solution with ciphertext compressionbased optimization for efficient k-dominant skyline query processing while providing security guarantees. Extensive evaluations on both synthetic and real datasets showed the superiority of our method.

【基金】 国家自然科学基金资助项目(No.U21A20516,No.62076017);北航基础研究建设基金资助项目(No.YWF-22-L-531);微众学者计划~~
  • 【分类号】TP311.13
  • 【下载频次】6
节点文献中: 

本文链接的文献网络图示:

本文的引文网络