This course is listed in Aachen Campus as The art of cryptography: secure internet & e-passports and in Bonn Basis as MA-INF 1312 - The art of cryptography: secure internet & e-passports.
This course is about various aspects of security in the internet. In the first part we deal with secure connections, whereas the second part considers electronic voting schemes involving further tasks.
- Who can read my email?
- How do I know that eBay is eBay, or amazon is amazon?
- What is the public key of Angela Merkel? Where do I get it and how do I verify that it's really hers?
In the internet a large variety of protocols ("chatting programs") are in use to make this or that `secure'. VPN, IPsec, SSL, PKI, PGP are just a few tokens that need explanations. We will try to understand a little of that and how things are used and made available. We aim at also considering their security relative to the used primitives.
Passports shall carry more and more sensitive information in a easily accessible way in the future. This information may, apart from name, origin and the like, contain fingerprints or retina scans. And it is stored in electronic form, and it can be accessed by wireless transmissions. This raises a lot of new problems:
- The passport holder cannot immediately control the contents of the stored information.
- Unauthorized eavesdroppers might be able to gather or actively read information from the passport unnoticed. So one could think that identifying a certain person passing at a certain place, or tracking her path through a department store might be possible.
- Personal rights of a person are touched when acquiring and storing biometric information.
The course will try to give an overview what and how things are implemented. We will discuss the concerns of and threats to holders, society and government. Biometrical information has long been used to identify persons. Already, in 1901 Scotland Yard started to use fingerprints to identify criminals. Since then various other methods have been introduced: iris scan, face recognition, retina scans, hand geometry to name just the most prominent. Since about 1965 people have tried to automate all these identification methods. This has shown many difficulties. It is still not clear which information identify a person: for example, though it is widely believed that fingerprints do, only few scientific studies are available. And it turns out to be pretty difficult to find a reliable automatic pattern matcher. Mind that it is not like searching a given fixed string in a dictionary. You have to find the template(s) that are most similar to a given one, or tell that there is none within given bounds.
- Monday, 1230-1400, b-it bitmax.
- Thursday, 1230-1400, b-it bitmax.
- Tutorial: Monday, 1415-1545, b-it bitmax.
First meeting: Monday, 24 April 2017, 1230.
Pre-exam meeting: 21 August 2017, 1300-1430, b-it 1.25.
Exam: Wednesday, 23 August 2017, 1000-1300, b-it bit-max.
Post-exam meeting: Monday, 28 August 2017, 1230-1330, b-it 1.25.
Exam2 (repetitions only): Wednesday, 27 September 2017, 1000-1300, b-it bit-max.
Exam review: Tuesday, 10 October 2017, 1230-1300, b-it 1.22.
The screen notes (PDF 8.6MB) contain all handwritten stuff (last updated 21 August 2017, 16:52).
- Sheet 1 (PDF, last updated 24 April 2017, 19:37).
- Sheet 2 (PDF, last updated 08 May 2017, 18:24).
- Sheet 3 (PDF, last updated 15 May 2017, 17:08).
- Sheet 4 (PDF, last updated 22 May 2017, 19:17).
- Sheet 5 (PDF, last updated 12 June 2017, 16:55).
- Sheet 6 (PDF, last updated 19 June 2017, 17:06).
- Sheet 7 (PDF, last updated 26 June 2017, 19:15).
- Sheet 8 (PDF, last updated 03 July 2017, 17:23).
- Sheet 9 (PDF, last updated 10 July 2017, 15:46).
- Sheet 10 (PDF, last updated 17 July 2017, 16:41).
- J. Klensin (Editor) (2008). Simple Mail Transfer Protocol. RFC 5321.
- N. Freed (Editor) (1995). SMTP service Extention. RFC 1869.
- heise (Monika Ermert & mho) (2015). E-Mail-Sicherheit: Gedächtnislücken und Darkmail-Ideen.
- Phong Nguyen (2004). Can We Trust Cryptographic Software? Cryptographic Flaws in GNU Privacy Guard v1.2.3. EUROCRYPT 2004.
- J.-J. Quisquater, L. Guillou and families, with T. Berson (1990). How to explain zero-knowledge protocols to your children . In G. Brassard, ed., Advances in Cryptology, CRYPTO 89, Lectures Notes in Computer Science 0435, Springer, Heidelberg. 628-631.
- Tibor Jager, Florian Kohlar, Sven Schäge & Jörg Schwenk (2011/2013). On the Security of TLS-DHE in the Standard Model. Preprint, ePrint 2011/219.
- Hugo Krawczyk, Kenny Paterson & Hoeteck Wee (2013). On the Security of the TLS Protocol: A Systematic Analysis. CRYPTO 2013, ePrint 2013/339.
Basic knowledge in cryptography is needed, as for example the course Cryptography held in the previous winter. Compare our programme.
We will put each member on the mailing list 17ss-taoc-at-lists.bit.uni-bonn.de. You can also subscribe yourself. The list is intented for all participants of the course as a platform for discussions around the topic. Furthermore, announcements regarding the course are made here.
- Master in Media Informatics: Computer and Communication Technology.
8 ECTS credits.
Optionally, 3+2 SWS, 6 ECTS credits. On request a breakpoint at about 3/4 of the teaching time will be defined, and only the course material up to that point will be relevant for their exams and grades.
- Master in Computer Science at University of Bonn: MA-INF 1312.
Students have to register this course with POS/BASIS.