Advanced Network Security 2017
This is the main web site for the Advanced Network Security (NWI-IMC050) of the TRU/e security master.
The Advanced Network Security course builds on the bachelor course on Network Security. Where the bachelor course is quite hands on, this master course is of a more theoretical nature. Moreover, instead of focusing on the traditional objectives of confidentiality, integrity and authenticity, the master course shows how to deal with faults to increase availability, and how to build privacy friendly network services. Finally, we study some proposals for future internet architectures to overcome the security problems found in the current Internet.
After the course the student will
- have knowledge of and understand some key advanced network security technologies, and their main advantaged, disadvantages, and consequences when applying them in practice,
- understand in particular how privacy and availability can be increased when designing networks and networking services,
- have a basic understanding of algorithmics: the theory and practice of modeling and designing (distributed) algorithms, and how to prove them correct.
TopicsThe course covers the following topics.
- A selection of fault-tolerant distributed algorithms (from byzantine agreement to self-stabilisation) as an alternative approach to availability.
- Designs for privacy preserving networks, like Tor, Mixnets, I2P, or DC nets.
Schedule (spring 2018)Lectures take place from 13:30 to 15:30 in room ????. Lectures start at 13:45. Slides of presentations that are available are linked from here. The links are released after the lecture.
Below you find a (tentative) schedule of the course.
|Date||Topic||Literature||Assignments and solutions|
|February 5||Introduction: slides / notes||Papers:|
- L. Lamport, "Time, Clocks, and the Ordering of Events in a Distributed System." Communications of the Association for Computing Machinery 21, no. 7 (July 1978): 558-565. (upto the section called "Physical clocks")
|February 12||Distributed Algorithms: Leader Election and Mutual Exclusion: slides / notes||Papers:|
- G.L. Peterson, "An O(n log n) unidirectional algorithm for the circular extrema problem". ACM TOPLAS 4 (1982), 758–762.
|February 19||Distributed Algorithms: Leader Election and Mutual Exclusion II: slides / notes||Papers:|
- L. Lamport, "A new solution of Dijkstra’s concurrent programming problem." Commun. ACM 18, 8 (1974), 453–455.
|February 26||(no lecture)|
|March 5||(no lecture)|
|March 12||Agreement and consensus I: concepts and protocols for crash failures: slides / notes||Papers:|
- M. Pease, R. Shostak, L. Lamport. "Reaching Agreement in the Presence of Faults" (PDF). Journal of the ACM. 27 (2): 228–234, April 1980.
|March 19||Agreement and consensus II: handling Byzantine failures: slides / notes||Papers:|
- L. Lamport, R. Shostak, M. Pease, "The Byzantine Generals Problem", ACM TOPLAS 4(3), pp. 382-401, July 1982.
|March 26||Self-Stabilisation: slides / notes||Papers:|
- E.W. Dijkstra, "Self-Stabilizing Systems in Spite of Distributed Control." Communications of the Association for Computing Machinery 17, no. 11 (November 1974): 643-644.
|April 2||(no lecture)|
|April 9||(no lecture)|
|April 30||(no lecture)|
|May 21||(no lecture)|
|June 11||Review of excercises, discussing the exam, Q&A.|
ExamsExams for 2017 are scheduled as follows.
- Exam: Monday June 26, 12:30-15:30 (LIN 6) (Exam with answers).
- Resit: Monday August 21, 12:30-15:30 (HG 02.032) (Exam with answers).
Additional informationThe course will consist of traditional lectures, supplemented with take home excercises. There is a final written exam.
Last Version -
(Note: changeover from CVS to dotless svn version numbers on Jan 19, 2008, and changeover to GIT versioning on May 30, 2013.)
Maintained by Jaap-Henk Hoepman