We consider the problem of designing an efficient and robust distributed random number generator for peer-to-peer systems that is easy to implement and works even if all communication channels are public. A robust random number generator is crucial for avoiding adversarial join-leave attacks on peer-to-peer overlay networks. We show that our new generator together with a light-weight rule recently proposed in [4] for keeping peers well-distributed can keep various structured overlay networks in a robust state even under a constant fraction of adversarial peers
In this paper we consider the problem of targeted attacks in large scale peer-to-peer overlays. Targ...
International audienceAwerbuch and Scheideler have shown that peer-to-peer overlays networks can onl...
We treat the number of random bits as a computational resource in distributed computations. We give ...
AbstractWe consider the problem of designing an efficient and robust distributed random number gener...
There exists several applications where it is desirable to produce random numbers such that adding t...
Performance of many P2P systems depends on the ability to construct a ran- dom overlay network amon...
Consider the problem of reliable multicast over a network in the presence of adversarial errors. In ...
Motivated by the need for robust and fast distributed computation in highly dynamic Peer-to-Peer (P2...
Performance of many P2P systems depends on the ability to construct a ran-dom overlay network among ...
AbstractWe describe a randomized algorithm for assigning neighbours to vertices joining a dynamic di...
AbstractRandomness is a useful computation resource due to its ability to enhance the capabilities o...
We consider broadcasting in random d-regular graphs by using a simple modification of the random pho...
International audienceA pseudo-random number generator (PRNG) is a deterministic algorithm that prod...
International audienceWeak adversaries are a way to model the uncertainty due to asynchrony in rando...
Reliable random number generation is crucial for many available security algorithms, and some of the...
In this paper we consider the problem of targeted attacks in large scale peer-to-peer overlays. Targ...
International audienceAwerbuch and Scheideler have shown that peer-to-peer overlays networks can onl...
We treat the number of random bits as a computational resource in distributed computations. We give ...
AbstractWe consider the problem of designing an efficient and robust distributed random number gener...
There exists several applications where it is desirable to produce random numbers such that adding t...
Performance of many P2P systems depends on the ability to construct a ran- dom overlay network amon...
Consider the problem of reliable multicast over a network in the presence of adversarial errors. In ...
Motivated by the need for robust and fast distributed computation in highly dynamic Peer-to-Peer (P2...
Performance of many P2P systems depends on the ability to construct a ran-dom overlay network among ...
AbstractWe describe a randomized algorithm for assigning neighbours to vertices joining a dynamic di...
AbstractRandomness is a useful computation resource due to its ability to enhance the capabilities o...
We consider broadcasting in random d-regular graphs by using a simple modification of the random pho...
International audienceA pseudo-random number generator (PRNG) is a deterministic algorithm that prod...
International audienceWeak adversaries are a way to model the uncertainty due to asynchrony in rando...
Reliable random number generation is crucial for many available security algorithms, and some of the...
In this paper we consider the problem of targeted attacks in large scale peer-to-peer overlays. Targ...
International audienceAwerbuch and Scheideler have shown that peer-to-peer overlays networks can onl...
We treat the number of random bits as a computational resource in distributed computations. We give ...