Computing in Social Networks

Détails

Ressource 1Télécharger: BIB_1D09FA0D4AFD.P001.pdf (310.45 [Ko])
Etat: Serval
Version: de l'auteur
ID Serval
serval:BIB_1D09FA0D4AFD
Type
Actes de conférence (partie): contribution originale à la littérature scientifique, publiée à l'occasion de conférences scientifiques, dans un ouvrage de compte-rendu (proceedings), ou dans l'édition spéciale d'un journal reconnu (conference proceedings).
Collection
Publications
Titre
Computing in Social Networks
Titre de la conférence
Proceedings of the 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
Auteur(s)
Giurgiu A., Guerraoui R., Huguenin K., Kermarrec A.-M.
Editeur
Springer
Adresse
New York, NY, USA
ISBN
978-3-642-16022-6
978-3-642-16023-3
ISSN
0302-9743
1611-3349
Statut éditorial
Publié
Date de publication
2010
Peer-reviewed
Oui
Volume
6366
Série
Lecture Notes in Computer Science
Pages
332-346
Langue
anglais
Résumé
This paper defines the problem of Scalable Secure Computing in a Social network: we call it the S³ problem. In short, nodes, directly reflecting on associated users, need to compute a function f : V → U of their inputs in a set of constant size, in a scalable and secure way. Scalability means that the message and computational complexity of the distributed computation is at most O(√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 S³-computes a class of aggregation functions, that is that can be expressed as a commutative monoid operation on U: f(x1, . . ., xn) = x1 ⊕ . . . ⊕ xn, assuming the number of faulty participants is at most √n/log²n. 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.
Création de la notice
01/12/2016 12:01
Dernière modification de la notice
03/03/2018 14:33
Données d'usage