FU Math/Inf


Springe direkt zu: Inhalt


Service-Navigation


Hauptnavigation/Hauptmenü: Links auf direkt erreichbare, übergeordnete Webseiten


Secure Identity
Institut für Informatik

Suche auf der Website http://www.inf.fu-berlin.de

Schnellzugriff

Für Browser ohne JavaScript finden Sie hier eine Liste der Quick Links

Navigation/Menü: Links auf weitere Seiten dieser Website


Für diese Seite

Fachbereich »  Informatik »  Secure Identity »  Teaching »  Modern Cryptography and Networked Systems Security

Instructors

Description

This course gives a modern introduction to cryptography and cryptographic key management, followed by an introduction to cryptographic protocols and their applications in distributed systems security. Mathematical background is developed to the degree reasonable in an introductory class. In addition to the mathematical underpinnings of cryptographic primitives the course also touches on the importance of implementation for a secure system.

Time and Location

Lectures:

Tutorials:

Note: The tutorials commence in the second week of the semester.

Grading

The grade will be computed as a weighted sum as shown below. Passing the exam is necessary to pass the course.

Students will be admitted to the exam if they pass the mid-term exam or they earn at least 50% of the points in n-2 home work assignments (where n is the overall number of assignments).

Lectures

Wed Oct 14, 2009

Topics:

Reading assignments: [1, sect. 7.3]

Thu Oct 15, 2009

Topics:

Homework: 1 (due Friday, October 30, at 12h)

Reading assignments: [2, chap. 2]

Wed Oct 21, 2009

Topics:

Reading assignments: [2, chap. 2]

Thu Oct 22, 2009

Topic:

Reading assignments: [2, chap. 3] [3, read the anecdote]

Wed Oct 28, 2009

Topics:

Reading assignments: [2, chap. 3] [4]

Thu Oct 29, 2009

Topics:

Homework: 2 (due Friday, November 13, at 12h)

Reading assignments: [2, chap. 3]

Wed Nov 4, 2009

Topics:

Reading assignments: [2, chap. 4]

Thu Nov 5, 2009

Topics:

Reading assignments: [2, chap. 4]

Wed Nov 11, 2009

Topics:

Reading assignments: [2, chap. 4]

Thu Nov 12, 2009

Topics:

Homework: 3 (due Friday, November 27, at 12h)

Reading assignments: [2, chap. 5]

Wed Nov 18, 2009

Topics:

Reading assignments: [2, chap. 7]

Thu Nov 19, 2009

Topics:

Reading assignments: [2, chap. 7]

Wed Nov 25, 2009

Topics:

Reading assignments: [2, chap. 9]

Thu Nov 26, 2009

Topics:

Reading assignments: [2, chap. 10]

Wed Dec 2, 2009

Topics:

Reading assignments: [2, chap. 10]

Thu Dec 3, 2009

Topics:

Reading assignments: [2, chap. 10]

Wed Dec 9, 2009

Topics:

Reading assignments: [2, chap. 12]

Thu Dec 10, 2009

Topics:

Reading assignments: [2, chap. 13] [5]

Wed Dec 16, 2009

Topics:

Reading assignments: [2, chap. 11.3] [6] [7]

Thu Dec 17, 2009

Mid-term exam

Wed Jan 6, 2010

Guest speaker: Dr. Kim Nguyen, Bundesdruckerei GmbH

Topic:

Thu Jan 7, 2010

Topics:

Reading assignments: [8] [9]

Wed Jan 13, 2010

Topics:

Reading assignments: [10]

Thu Jan 14, 2010

Topics:

Reading assignments: [11] [12] [13] [14] [15]

Wed Jan 20, 2010

Topics:

Thu Jan 21, 2010

Topics:

Wed Jan 27, 2010

Topics:

Thu Jan 28, 2010

Guest speaker: Dr. Walter Fumy, Bundesdruckerei GmbH

Topics:

Wed Feb 3, 2010

Topics:

Thu Feb 4, 2010

Guest speaker: Carsten Schwarz, Bundesdruckerei GmbH

Topics:

Wed Feb 10, 2010

Class project presentations

Thu Feb 11, 2010

Final exam

Literature

  1. Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone. Handbook of Applied Cryptography. CRC Press, 2001.
  2. Jonathan Katz, Yehuda Lindell. Introduction to Modern Cryptography. Chapman & Hall/CRC, 2008.
  3. R. Morris and K. Thompson. Password security: a case history. Commun. ACM 22, 11 (Nov. 1979), 594-597.
  4. Hongjun Wu, The Misuse of RC4 in Microsoft Word and Excel. IACR e-print number 007, 2005.
  5. Mihir Bellare and Phillip Rogaway. Random Oracles are practical: a paradigm for designing efficient protocols. Proc. ACM Computer and Communications Security, November 1993.
  6. Caroline Fontaine and Fabien Galand. A Survey of Homomorphic Encryption for Nonspecialists. EURASIP Journal on Information Security, October 2007.
  7. Castelluccia, C., Chan, A. C., Mykletun, E., and Tsudik, G. 2009. Efficient and provably secure aggregation of encrypted data in wireless sensor networks. ACM Trans. Sen. Netw. 5, 3 (May. 2009), 1-36.
  8. Loren M. Kohnfelder. Towards a practical public-key cryptosystem. B.Sc. thesis, MIT, May 1978.
  9. Carl M. Ellison. Establishing Identity Without Certification Authorities. In Proc. USENIX Security Symposium, July 1996.
  10. Martin Abadi and Roger Needham. Prudent Engineering Practice for Cryptographic Protocols. Digital Equipment Corporation, November 1995.
  11. D. Brumley and D. Boneh. Remote timing attacks are practical. In Proc. 12th Usenix Security Symposium, 2003.
  12. Paul C. Kocher. Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems. In Proc. CRYPTO (1996). Lecture Notes In Computer Science, vol. 1109. Springer-Verlag, London, 104-113.
  13. T. Dierks and C. Allen. The TLS Protocol Version 1.0. Internet Engineering Task Force Request for Comments 2246, January 1999.
  14. Moxie Marlinspike. Null Prefix Attacks against SSL/TLS Certificates. Published online.
  15. Moxie Marlinspike. Defeating OCSP With the Character '3'. Published online.


©2007-2009  AG SI |  Feedback  |
Last Update: Dez 23, 2009

These Pictures are only displayed on print previews: