Abstract—The recent explosion of online networked data and the discovery of universal topological characteristics in real world networks has led to the emergence of a new domain of research, namely, social networks. However, much research in this domain remains unexplored due to the unavailability of sensitive networks, which include hate networks, trust net-works and sexual relationship networks. This paper proposes a secure multiparty protocol which allows a set of parties to compute the underlying network on them. The proposed protocol is information theoretic secure, and its security is further enhanced by a list of security tests, which include, k-anonymity test, check for self loops and weighted edges. Although some solutions have been proposed for this problem earlier, the practicality of each one of those is questionable. Index Terms—Multiparty computation, Social networks, Anonymization