Please use this identifier to cite or link to this item:
Distributed Anonymous Computation of Social Distance
|Title:||Distributed Anonymous Computation of Social Distance|
Ad hoc networks (Computer networks)
|LC Subject Headings:||Ad hoc networks|
|Issue Date:||10 Jan 2016|
|Citation:||Edoardo Biagioni, "Distributed Anonymous Computation of Social Distance", CCNC 2016, January 9-12, 2016, Las Vegas NV|
|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.|
|Appears in Collections:||Technical Reports|
Please contact email@example.com if you need this content in an alternative format.
This item is licensed under a Creative Commons License