Distributed Anonymous Computation of Social Distance

Date
2016-01-10
Authors
Biagioni, Edoardo
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
Volume
Number/Issue
Starting Page
Ending Page
Alternative Title
Abstract
In a distributed social network, no single system holds information about all the individuals in the network, and no single system is trusted by all the individuals in the network. It is nonetheless desirable to reliably compute the social distance among individuals. This must be done anonymously, without giving away any identifying information about individuals in the social network, and reliably, without allowing anyone to pretend to be socially closer to someone else than they actually are. The Social Network Connectivity Algorithm, or SoNCA, ac- complishes these goals in a distributed manner. This paper describes both the high-level algorithm and a concrete design that is intended for future use with a network, AllNet, designed to provide secure interpersonal communication utilizing all avail- able means, including Internet, cellular communications, ad-hoc networking and delay-tolerant networking.
Description
This is a paper describing how to compute social distance among participants in a social network, when the social network is stored in a distributed fashion and there is no central point of coordination.
Keywords
Computer science, social network, Computer science, Ad hoc networks (Computer networks)
Citation
Edoardo Biagioni, "Distributed Anonymous Computation of Social Distance", CCNC 2016, January 9-12, 2016, Las Vegas NV
Extent
4
Format
Geographic Location
Time Period
Related To
Rights
CC-BY-SA
Rights Holder
Email libraryada-l@lists.hawaii.edu if you need this content in ADA-compliant format.