Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Robust Random Number Generation for Peer-to-Peer Systems
 

Summary: Robust Random Number Generation for
Peer-to-Peer Systems
Baruch Awerbuch 1
and Christian Scheideler 2
1
Dept. of Computer Science, Johns Hopkins University, Baltimore, MD 21218, USA
2
Institute for Computer Science, TU Munich, 85748 Garching, Germany
Abstract. 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 adver-
sarial 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.
1 Introduction
Due to their many applications, peer-to-peer systems have recently received a
lot of attention both inside and outside of the research community. Most of the

  

Source: Awerbuch, Baruch - Department of Computer Science, Johns Hopkins University

 

Collections: Computer Technologies and Information Sciences