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
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
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
Decentralized Polling with Respectable Participants
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
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
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
Highly dynamic distributed computing with byzantine failures
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Information and Computation
| Hi-index | 0.00 |
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(√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 √n/log2 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.