2022
DOI: 10.1109/tcc.2020.3012999
|View full text |Cite
|
Sign up to set email alerts
|

Privacy-Preserving Subgraph Matching Scheme With Authentication in Social Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2022
2022
2025
2025

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 31 publications
0
9
0
Order By: Relevance
“…Background of problems:Authenticated sub-graph matching scheme for social networks was presented in [39]. This work provides security to the data owners and Query users.…”
Section: Problem Definitionmentioning
confidence: 99%
“…Background of problems:Authenticated sub-graph matching scheme for social networks was presented in [39]. This work provides security to the data owners and Query users.…”
Section: Problem Definitionmentioning
confidence: 99%
“…Reference [15] uses a depth-first search code as a canonical tagging system, and on the basis of this code, a new graph similarity measure algorithm is proposed in combination with Levenshtein distance (i.e., string editing distance), which has a complexity of n 3 modulo exponential operation. Reference [16] designed secure graph isomorphism and similarity determination algorithms based on hash functions, which measure computational complexity by comparing the number of hash operations, and it has a complexity of 6h (h is the number of operations to perform one hash operation).…”
Section: Computational Complexitymentioning
confidence: 99%
“…Communication complexity is usually measured in terms of communication rounds. Reference [15] requires six rounds of interaction to complete the computation, Reference [16] requires four rounds, Algorithm 1 in this paper requires one round of communication, and Algorithm 2 requires three rounds of communication to complete the computation. Table 1 shows a comparison of the performance.…”
Section: Communication Complexitymentioning
confidence: 99%
See 1 more Smart Citation
“…Another line of work studies privacy-preserving subgraph matching, which is much more challenging because more complex operations are required in the ciphertext domain. Some works [31], [32] only consider structure matching and work on unattributed graphs. Others [19], [33]- [36] study privacy-aware attributed subgraph matching, which is more sophisticated as it additionally considers the matching against vertices' attributes and types.…”
Section: B Privacy-aware Graph Query Processingmentioning
confidence: 99%