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

Achieving Efficient and Privacy-Preserving (,)-Core Query over Bipartite Graphs in Cloud

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 29 publications
0
1
0
Order By: Relevance
“…Nevertheless, they may possess an interest in the information pertaining to other entities and have the capability to compromise data privacy through the utilization of their knowledge. Additionally, it is assumed that the two cloud servers are non-colluding, a common and reasonable assumption in numerous application scenarios [34][35][36][37]. Furthermore, it is further assumed that neither the owner nor the suspect will engage in collusion with the cloud servers.…”
Section: Data Privacymentioning
confidence: 99%
“…Nevertheless, they may possess an interest in the information pertaining to other entities and have the capability to compromise data privacy through the utilization of their knowledge. Additionally, it is assumed that the two cloud servers are non-colluding, a common and reasonable assumption in numerous application scenarios [34][35][36][37]. Furthermore, it is further assumed that neither the owner nor the suspect will engage in collusion with the cloud servers.…”
Section: Data Privacymentioning
confidence: 99%