Computing in Social Networks

Abstract : This paper defines the problem of Scalable Secure Computing in a Social network: we call it the S3 problem. In short, nodes, directly reflecting on associated users, need to compute a function f : V -> U of their inputs in a scalable and secure way. Scalability means that the message and computational complexity of the distributed computation is at most O(sqrt(n) · polylog n). Security encompasses (1) accuracy and (2) privacy: accuracy holds when the distance from the output to the ideal result is negligible with respect to the maximum distance between any two possible results; privacy is characterized by how the information disclosed by the computation helps faulty nodes infer inputs of non-faulty nodes. We present AG-S3, a protocol that S3-computes a class of aggregation functions, that is that can be expressed as a commutative monoid operation on U: f(x1, . . . , xn) = x1\oplus ...\oplus xn, assuming the number of faulty participants is at most sqrt(n) / log^2(n). We then extend our results to Lipshitz continuous functions. Key to our protocol is a dedicated overlay structure that enables secret sharing and distributed verifications which leverage the social aspect of the network: nodes care about their reputation and do not want to be tagged as misbehaving.
Type de document :
[Research Report] RR-7295, INRIA. 2010, pp.13
Liste complète des métadonnées
Contributeur : Kévin Huguenin <>
Soumis le : jeudi 15 juillet 2010 - 10:02:31
Dernière modification le : mercredi 16 mai 2018 - 11:23:13
Document(s) archivé(s) le : vendredi 22 octobre 2010 - 11:59:56


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00492201, version 2


Andrei Giurgiu, Rachid Guerraoui, Kévin Huguenin, Anne-Marie Kermarrec. Computing in Social Networks. [Research Report] RR-7295, INRIA. 2010, pp.13. 〈inria-00492201v2〉



Consultations de la notice


Téléchargements de fichiers