On the Power of the Adversary to Solve the Node Sampling Problem

Emmanuelle Anceaume (1, 2) , Yann Busnel (3) , Sébastien Gambs (2)

1 CIDER
2 CIDRE - Confidentialité, Intégrité, Disponibilité et Répartition
3 GDD - Gestion de Données Distribuées [Nantes]

We study the problem of achieving uniform and fresh peer sampling in large scale dynamic systems under adversarial behaviors. Briefly, uniform and fresh peer sampling guarantees that any node in the system is equally likely to appear as a sample at any non malicious node in the system and that infinitely often any node has a non-null probability to appear as a sample of honest nodes. This sample is built locally out of a stream of node identifiers received at each node. An important issue that seriously hampers the feasibility of node sampling in open and large scale systems is the unavoidable presence of malicious nodes. The objective of malicious nodes mainly consists in continuously and largely biasing the input data stream out of which samples are obtained, to prevent (honest) nodes from being selected as samples. First we demonstrate that restricting the number of requests that malicious nodes can issue and providing a full knowledge of the composition of the system is a necessary and sufficient condition to guarantee uniform and fresh sampling. We also define and study two types of adversary models: an omniscient adversary that has the capacity to eavesdrop on all the messages that are exchanged within the system, and a blind adversary that can only observe messages that have been sent or received by nodes it controls. The former model allows us to derive lower bounds on the impact that the adversary has on the sampling functionality while the latter one corresponds to a more realistic setting. Given any sampling strategy, we quantify the minimum effort exerted by both types of adversary on any input stream to prevent this sampling strategy from outputting a uniform and fresh sample.

Mots clés: Data Stream; Kullback-Leibler Divergence; Uniform sampling; Freshness; Byzantine adversary

Domaines: Algorithme et structure de données [cs.DS]

Emmanuelle Anceaume, Yann Busnel, Sébastien Gambs. On the Power of the Adversary to Solve the Node Sampling Problem. Transactions on Large-Scale Data- and Knowledge-Centered Systems, 2013, 8290, pp.102-126. ⟨10.1007/978-3-642-45269-7_5⟩. ⟨hal-00926485⟩