论文标题

ObLivGM:遗忘归因于云服务的子图匹配

OblivGM: Oblivious Attributed Subgraph Matching as a Cloud Service

论文作者

Wang, Songlei, Zheng, Yifeng, Jia, Xiaohua, Huang, Hejiao, Wang, Cong

论文摘要

近年来,利用云计算来存储和查询归因图的普及越来越普及,这些图被广泛用于在各种应用程序中对复杂的结构化数据进行建模。但是,这种外包图分析的趋势伴随着有关信息丰富和专有归因的图形数据的关键隐私问题。鉴于此,我们设计,实施和评估OblivGM,这是一个旨在将遗忘的图形分析服务外包到云到云的新系统。 OblivGM专注于对属性子图匹配的支持,一个流行的和基本的图形查询功能旨在从大型属性图子图中检索到小查询图。 OblivGM由归因图建模和高级轻质加密图的精致见解的协同作用,保护与属性图和查询相关的数据内容的机密性,在属性图中隐藏了顶点之间的连接,并隐藏了搜索访问模式。同时,Oblivgm灵活地支持对不同子图查询的遗忘评估,这可能包含平等和/或范围谓词。对现实世界中的图形数据集进行了广泛的实验表明,尽管提供了强大的安全保证,但OblivGM实际上实现了实现的实现(在几秒钟的订单上都具有查询延迟)。

In recent years there has been growing popularity of leveraging cloud computing for storing and querying attributed graphs, which have been widely used to model complex structured data in various applications. Such trend of outsourced graph analytics, however, is accompanied with critical privacy concerns regarding the information-rich and proprietary attributed graph data. In light of this, we design, implement, and evaluate OblivGM, a new system aimed at oblivious graph analytics services outsourced to the cloud. OblivGM focuses on the support for attributed subgraph matching, one popular and fundamental graph query functionality aiming to retrieve from a large attributed graph subgraphs isomorphic to a small query graph. Built from a delicate synergy of insights from attributed graph modelling and advanced lightweight cryptography, OblivGM protects the confidentiality of data content associated with attributed graphs and queries, conceals the connections among vertices in attributed graphs, and hides search access patterns. Meanwhile, OblivGM flexibly supports oblivious evaluation of varying subgraph queries, which may contain equality and/or range predicates. Extensive experiments over a real-world attributed graph dataset demonstrate that while providing strong security guarantees, OblivGM achieves practically affordable performance (with query latency on the order of a few seconds).

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源