Paper Info
Title
Secure Multiparty Construction of a Distributed Social Network.
Abstract
The advancement in technology has resulted in a better connected society. These connections foster social interactions that result in an emergent structure. This structure is popularly termed as a social network and is an integral component of study, in the field of network science. However, the study of these social networks is limited to the availability of data on the underlying social interactions. Privacy concerns restrict the access to network data with sensitive information. Networks that capture the relations such as trust, enmity, sexual contact, are a few examples of sensitive networks. A study of these sensitive networks is important in unraveling the behavioral aspects of the concerned individuals. The current paper proposes a multiparty computation algorithm that allows the construction of an unlabeled random isomorphic version of a distributedly held network. The protocol is proven to be secure in the presence of the extended arithmetic black-box, which supports the operations of addition, multiplication, comparison and equality checks.
Year
DOI
Venue
2017
10.1145/3007748.3007783
ICDCN
Keywords
Field
DocType
multiparty computation, social networks, distributed algorithms
Network science,Dynamic network analysis,Social network,Computer science,Computer security,Computer network,Evolving networks,Multiplication,Distributed algorithm,Information sensitivity,restrict,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
9
Authors
3
Name
Order
Citations
PageRank
Varsha Bhat Kukkala132.78
Jaspal Singh Saini254.58
S. R. S. Iyengar337.50