Skip to Main content Skip to Navigation
Conference papers

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 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(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+...+xn, assuming the number of faulty participants is at most sqrt(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.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Kévin Huguenin Connect in order to contact the contributor
Submitted on : Thursday, March 14, 2013 - 3:56:11 PM
Last modification on : Thursday, January 20, 2022 - 4:20:36 PM
Long-term archiving on: : Saturday, June 15, 2013 - 4:05:39 AM


Files produced by the author(s)



Andrei Giurgiu, Rachid Guerraoui, Kévin Huguenin, Anne-Marie Kermarrec. Computing in Social Networks. 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Sep 2010, New York, NY, United States. ⟨10.1007/978-3-642-16023-3_28⟩. ⟨inria-00498132⟩



Record views


Files downloads