An attacker given only the common-neighbors matrix of a graph can rebuild the graph up to co-square equivalence, and knowing a few edges makes the rebuild more accurate.
Crypto’graph: Leveraging privacy-preserving distributed link prediction for robust graph learn- 20 ing
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CR 1years
2024 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data
An attacker given only the common-neighbors matrix of a graph can rebuild the graph up to co-square equivalence, and knowing a few edges makes the rebuild more accurate.