Secret sharing homomorphisms: keeping shares of a secret secret
Proceedings on Advances in cryptology---CRYPTO '86
Partitioned encryption and achieving simultaneity by partitioning
Information Processing Letters
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
Protecting Respondents' Identities in Microdata Release
IEEE Transactions on Knowledge and Data Engineering
Addressing cheating in distributed MMOGs
NetGames '05 Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Sybil-resilient online content voting
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Enabling Secure Secret Sharing in Distributed Online Social Networks
ACSAC '09 Proceedings of the 2009 Annual Computer Security Applications Conference
Secretive birds: privacy in population protocols
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Airavat: security and privacy for MapReduce
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Decentralized polling with respectable participants
Journal of Parallel and Distributed Computing
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
When birds die: making population protocols fault-tolerant
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Hi-index | 0.00 |
This paper defines the problem of Scalable Secure computing in a Social network: we call it the S^3 problem. In short, nodes, directly reflecting on associated users, need to compute a symmetric function f:V^n-U of their inputs in a set of constant size, in a scalable and secure way. Scalability means that the spatial, computational and message complexity of the distributed computation does not grow too fast with the number of nodes 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, which we capture in our context by the very notion of probabilistic anonymity. We first prove that under mild regularity conditions the problem of computing an arbitrary function can be reduced to that of component-wise addition of vectors of integers. More specifically, if the function f is Lipschitz-continuous and the maximum distance between two possible results is @W(n), any protocol that S^3-computes component-wise addition of vectors of integers S^3-computes f. We then present AG-S3, a protocol that S^3-computes a class of aggregation functions, that is that can be expressed as a commutative monoid operation on U: f(x"1,...,x"n)=x"1@?...@?x"n, assuming the number of faulty participants is at most n/log^2n. We further prove that AG-S3 S^3-computes component-wise addition of vectors of integers thus extending its application spectrum to regular 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.