Se­cure peer-to-peer sys­tems

Funded by: NSF-Projekt, 2003–2006

In this project, the aim is to develop algorithms for peer-to-peer systems that are provably robust against various attacks, including random and adversarial faults as well as join-leave attacks, Sybil attacks and DoS attacks.

Recent publications:

  • 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.