Secure multiparty PageRank algorithm for collaborative fraud detection
Collaboration between financial institutions helps to improve detection of fraud. However, exchange of relevant data between these institutions is often not possible due to privacy constraints and data confidentiality. An important example of relevant data for fraud detection is given by a transaction graph, where the nodes represent bank accounts and the links consist of the transactions between these accounts. Previous works show that features derived from such graphs, like PageRank, can be used to improve fraud detection. However, each institution can only see a part of the whole transaction graph, corresponding to the accounts of its own customers. In this research a new method is described, making use of secure multiparty computation (MPC) techniques, allowing multiple parties to jointly compute the PageRank values of their combined transaction graphs securely, while guaranteeing that each party only learns the PageRank values of its own accounts and nothing about the other transaction graphs. In our experiments this method is applied to graphs containing up to tens of thousands of nodes. The execution time scales linearly with the number of nodes, and the method is highly parallelizable. Secure multiparty PageRank is feasible in a realistic setting with millions of nodes per party by extrapolating the results from our experiments.
|Multiparty computation, PageRank, Fraud detection, Collaborative computation|
|ABN AMRO, Amsterdam, The Netherlands , Rabobank Nederland, Utrecht, The Netherlands , ING Bank|
|Lecture Notes in Computer Science|
|International Conference on Financial Cryptography and Data Security|
|Organisation||Centrum Wiskunde & Informatica, Amsterdam, The Netherlands|
Sangers, A, van Heesch, M, Attema, T, Veugen, P.J.M, Wiggerman, M, Veldsink, J, … Worm, D.T.H. (2019). Secure multiparty PageRank algorithm for collaborative fraud detection. In Proceedings of International Conference on Financial Cryptography and Data Security (pp. 605–623). doi:10.1007/978-3-030-32101-7_35