OblivGM: Oblivious Attributed Subgraph Matching as a Cloud Service-Reference-Cited by-同舟云学术

OblivGM: Oblivious Attributed Subgraph Matching as a Cloud Service

Published:2022 Issue: Volume:17 Page:3582-3596
ISSN:1556-6013
Container-title:IEEE Transactions on Information Forensics and Security
language:
Short-container-title:IEEE Trans.Inform.Forensic Secur.

Author:

Wang Songlei¹^ORCID,Zheng Yifeng¹^ORCID,Jia Xiaohua¹^ORCID,Huang Hejiao²^ORCID,Wang Cong³^ORCID

Affiliation:

1. School of Computer Science and Technology, Harbin Institute of Technology, Shenzhen, China

2. Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies, and the School of Computer Science and Technology, Harbin Institute of Technology, Shenzhen, China

3. Department of Computer Science, City University of Hong Kong, Hong Kong, China

Funder

Basic and Applied Basic Research Foundation of Guangdong Province

Shenzhen Science and Technology Program

National Natural Science Foundation of China

Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies

Research Grants Council of Hong Kong

Shenzhen Municipality Science and Technology Innovation Commission

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Computer Networks and Communications,Safety, Risk, Reliability and Quality

Link

http://xplorestaging.ieee.org/ielx7/10206/9652463/09905628.pdf?arnumber=9905628

Reference65 articles.

1. DORY: An encrypted search system with distributed trust;dauterman;Proc OSDI,2020

2. Function Secret Sharing

3. Privacy Preserving Subgraph Matching on Large Graphs in Cloud

4. Privacy-Preserving Subgraph Matching Scheme with Authentication in Social Networks

5. A Novel Privacy Preserving Framework for Large Scale Graph Data Publishing

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. NEMO: Practical Distributed Boolean Queries With Minimal Leakage;IEEE Transactions on Information Forensics and Security;2024

2. eGrass: An Encrypted Attributed Subgraph Matching System With Malicious Security;IEEE Transactions on Information Forensics and Security;2024

3. A Survey of Privacy Preserving Subgraph Matching Methods;Lecture Notes in Computer Science;2024

4. A Secure Multi-Party Computation Protocol for Graph Editing Distance against Malicious Attacks;Mathematics;2023-12-01

5. PrigSim: Towards Privacy-Preserving Graph Similarity Search as a Cloud Service;IEEE Transactions on Knowledge and Data Engineering;2023-10-01