Si­che­re Peer-to-Peer Sys­te­me

Förderung: NSF-Projekt, 2003–2006

In diesem Projekt geht es darum, Overlay-Netzwerke zu finden, die robust gegenüber verschiedenen Attacken sind, angefangen von zufälligen und gegnerischen Ausfällen bis hin zu Join-Leave-Attacken, Sybil-Attacken und DoS-Attacken.

Aktuelle Forschungsberichte:

  • C. Scheideler and S. Schmid.
    A distributed and oblivious heap.
    In 36th Intl. Colloquium on Automata, Languages and Programming (ICALP), 2009.
  • B. Awerbuch and C. Scheideler.
    Towards scalable and robust overlay networks.
    In 6th Intl. Workshop on Peer-to-Peer Systems (IPTPS), 2007.
  • B. Awerbuch and C. Scheideler.
    Robust random number generation for peer-to-peer systems.
    In 10th Intl. Conf. on Principles of Distributed Systems (OPODIS), 2006.
  • B. Awerbuch and C. Scheideler.
    Towards a scalable and robust DHT.
    In 18th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), 2006.
  • C. Scheideler.
    How to spread adversarial nodes? Rotate!
    In 37th ACM Symp. on Theory of Computing (STOC), 2005.
  • B. Awerbuch and C. Scheideler.
    Group Spreading: A protocol for provably secure distributed name service.
    In 31st Itl. Colloquium on Automata, Languages and Programming (ICALP), 2004.
  • B. Awerbuch and C. Scheideler.
    Robust distributed name service.
    In 3rd Intl. Workshop on Peer-to-Peer Systems (IPTPS), 2004.