Privacy Preserving PageRank Algorithm By Using Secure Multi-Party Computation
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:ZEOZUGLOrecord.jsonopen to challenge →
classification
cs.CR
keywords
computationalgorithmdatapagerankencryptionpartiespartypreserving
read the original abstract
In this work, we study the problem of privacy preserving computation on PageRank algorithm. The idea is to enforce the secure multi party computation of the algorithm iteratively using homomorphic encryption based on Paillier scheme. In the proposed PageRank computation, a user encrypt its own graph data using asymmetric encryption method, sends the data set into different parties in a privacy-preserving manner. Each party computes its own encrypted entity, but learns nothing about the data at other parties.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.