Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Friday, June 29, 2007, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
Speaker: Jared Saia (Computer Science Department, Univ. of New Mexico)
How can we create a reliable system out of unreliable components? This question spans several disciplines including engineering, computer science, economics, political science, and mathematics. In this talk, we will describe new algorithms for building reliable peer-to-peer networks out of unreliable peers. In particular, we assume that up to a constant fraction of the peers in the network have been attacked and are under the control of an omniscient and computationally unbounded adversary. We present algorithms for leader election and Byzantine agreement that are provably reliable under this attack scenario, and describe a general framework that can be used to design similar algorithms for other types of problems. Our algorithms are scalable in the sense that for every peer, all major resource costs (e.g. latency, number of bits sent and received, number of links to other peers) are polylogarithmic in the number of peers in the network. Application areas include: collaborative worm and spam detection, collaborative filtering, auction and mechanism enforcement, reputation management, voting, web search, network tomography, and distributed data storage and retrieval. The work makes use of several interesting mathematical tools including: the probabilistic method; expander and extractor graphs to enable robust computation; and novel algorithmic techniques to harden against denial of service attacks. We also describe many areas for future work.
Joint work with Valerie King (U. Victoria), Vishal Sanwalani (UNM and MSR) and Erik Vee (IBM Labs and Yahoo).
Automatic MiSe System Software Version 1.4803M | admin login