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.
↧
