Cryptology ePrint Archive: Report 2015/817

Secure Multi-party Graph Computation

Varsha Bhat and Harsimran Singh and S.R.S. Iyengar

Abstract: In this paper, we present a protocol to compute a friendship network of n people without revealing the identities of the people involved. The final result is an unlabelled graph which doesn’t disclose the identity of the parties. As part of the protocol, we present and make use of a technique to compute a random assignment of the numbers {1, 2, ..., n} to n people. Our work has direct applications in the data collection stage of Social Network Analysis, where, it is of vital importance to compute the underlying network without compromising on the personal information or identity of the parties involved.

Category / Keywords: Multiparty computation, social network analysis.

Date: received 17 Aug 2015, last revised 20 Aug 2015

Contact author: varsha bhat at iitrpr ac in, sudarshan@iitrpr ac in , sharsimran@iitrpr ac in

Available format(s): PDF | BibTeX Citation

Version: 20150820:184331 (All versions of this report)

Short URL: ia.cr/2015/817

Discussion forum: Show discussion | Start new discussion