×
Mar 27, 2023 · In this paper, we propose the first efficient and privacy-preserving graph similarity query (PGSim) scheme in the filter and verification framework.
Graph similarity query is one critical query type, in which the similarity between two graphs is usually measured by graph edit distance (GED). Although many ...
Apr 5, 2023 · After authorization, users can send graph similarity query requests to cloud servers. Same as the data owner, query users will encrypt their ...
Dec 9, 2024 · Graph similarity query is one critical query type, in which the similarity between two graphs is usually measured by graph edit distance (GED).
Oct 1, 2023 · We design, implement, and evaluate PrigSim, a novel system allowing the cloud to host an outsourced encrypted graph database and support secure ...
People also ask
This paper defines and solves the problem of privacy-preserving query over encrypted graph-structured data in cloud computing (PPGQ), and establishes a set ...
Similarity query over time series data plays a significant role in various applications, such as signal processing, speech recognition, and disease ...
In this paper, we focus on implementing an efficient and privacy-preserving subgraph isomorphic query over graphs, and give a practical scheme.
PGSim: Efficient and Privacy-Preserving Graph Similarity Query Over Encrypted Data in Cloud. IEEE Transactions on Information Forensics and Security. 2023 ...
We design several efficient and privacy-preserving similarity query schemes for encrypted eHealthcare data with the distance measure of Euclidean distance.