English

Privacy Preserving PageRank Algorithm By Using Secure Multi-Party Computation

Cryptography and Security 2016-11-08 v1

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.

Keywords

Cite

@article{arxiv.1611.01907,
  title  = {Privacy Preserving PageRank Algorithm By Using Secure Multi-Party Computation},
  author = {Ferhat Ozgur Catak},
  journal= {arXiv preprint arXiv:1611.01907},
  year   = {2016}
}

Comments

8 Pages

R2 v1 2026-06-22T16:43:45.542Z