Peer-to-Peer-Systeme und Sicherheit (IN2194)
Peer-to-Peer-Systeme und Sicherheit
Prof. Dr.-Ing. Georg Carle, Christian Grothoff Ph.D., Heiko Niedermayer, Ralph Holz, Nathan Evans
3V + 1Ü
Mondays 10-12 and Thursdays 14-16 in the room MI 00.13.009A
The lecture covers:
Chapter 1: Peer-to-Peer Systems (40 %)
Chapter 2: Security (30 %)
Chapter 3: Anonymity (30 %)
Peer-to-Peer Systems and Overlay Networks cause a major part of the traffic on the Internet. The lecture presents the mechanisms and protocols of such networks and explains a set of selected systems. BitTorrent allows an efficient and cooperative transfer of large files. Structured Peer-to-Peer Systems like Distributed Hash Tables allow an efficient lookup for index pointers or nodes in a scalable, efficient, and robust way. The security chapter focuses on advanced non-standard issues of network security. The primary focus is on security issues that are related to Peer-to-Peer Systems. The last chapter is about anonymity on the Internet and it discusses mixes and re-routers as well as systems like Tor and Gnunet.
Chapter / Section Name
P2P Unstructured Systems - Basics
P2P Structured Systems - part 1
P2P Structured Systems - part 2
P2P Unstructured Systems - Systems
P2P Other Issues
Security - Basics and Fundamental Issues
Security - P2P-specific
2 / 3
Talk on Freenet Routing and Tor
Security - Resistance
Please register (closed) for the course if you want to participate.
If you want to do the exam for the course you also have to register at TUMonline.
Please register (closed) for the practical exercises if you want to participate in them.
There will be theoretical excerses as well as a practical project exercise. The theoretical exercises are bi-weekly and prepare for the oral exam at the end. The practical exercises contribute to the exam.
Hand-in on paper in lecture or per mail to niedermayer -at- net.in.tum.de (please send as PDF or pure txt). Please note that the given solutions are often brief and only present the idea. Please also note that in some cases they sketch a variety of possible ideas that could have been taken. It would not have been required to find all of them.
Exercise 1 (hand-in on monday 10.05.) . Exercise course: Thursday 22.05.
Exercise 2 (hand-in on thursday 27.05., due to monday being holiday) Exercise course: Thursday 10.06.
Exercise 3 (hand-in on monday 14.06.) Exercise course: Thursday 17.06.
Exercise 4 (hand-in on monday 28.06.) Solution. Exercise course: 08.07.
Exercise 5 (hand-in on monday 12.07.) Exercise course: 15.07.
(Hint: Anonymity set = set of nodes that could be sender (or receiver) of a message)