Cryptographic Protocols

Schedule 2016-2017 3rd Quarter

• Wednesdays from 10.45-12.30h (3^rd+4^th hour) at auditorium 12
• Fridays from 13.45-15.30h (5^th+6^th hour) at auditorium 12

Lecture 1	February 8. Homework: study Preface, Sections 1.1-2, 2.1.1. Exercises 1.3*, 1.7, 1.8, 1.12(a). No hand-in.
Lecture 2	February 10. Homework: study Sections 1.3.1-2. Exercises 1.12(b)(i-iii), 1.12(b)(iv)*, 1.13, 1.15, 1.16, 1.18*, 1.24, 1.25*. Hand in before Wednesday February 15, 10.45am.
Lecture 3	February 15. Homework: study Sections 1.3.3-4. Exercises 1.31, 1.33(a,b), 1.34. No hand-in.
Lecture 4	February 17. Homework: study Section 2.1.2. Exercises 1.32(a)*, 1.33(e,f,h), 1.38, 1.39, 1.40*. Hand in before Wednesday February 22, 10.45am.
Lecture 5	February 22. Homework: study Sections 2.1.3-4, 2.2, 3.1, 3.2.1. Exercises 2.1, 2.3, 2.4, 2.6. No hand-in.
Lecture 6	February 24. Homework: study Sections 3.2.2-3, 3.3, 4.1-3. Exercises 2.5, 2.7, 3.2, 3.3, 3.4, 3.5*. Hand in before Wednesday March 8, 10.45am.
Lecture 7	March 8. Homework: study Sections 4.4, 4.5.1, and Python generators (see below). Exercise 4.2. No hand-in.
Lecture 8	March 10. Homework: study Section 4.5.2, Figure 4.5, Sections 5.1, 5.2.1-2. Exercises 5.9, 5.17(a), 5.18. Hand in before Wednesday March 15, 10.45am.
Lecture 9	March 15. Homework: study Sections 4.5.3, 4.6, 5.2.3-4, 5.3. Exercises 5.4*, 5.10, 5.13, 5.16. No hand-in.
Lecture 10	March 17. Homework: study Sections 5.2.5, 5.4. Exercises 5.17(b,d,f), 5.17(i)*. Hand in before Wednesday March 22, 10.45am.
Lecture 11	March 22. Homework: study Chapter 6. Exercises 5.20*, 5.25, 5.27, 5.28(ii), 6.2. No hand-in.
Lecture 12	March 24. Homework: study Chapter 7. Exercises 6.4*, 6.5, 7.1, 7.2. Hand in before Wednesday March 29, 10.45am.
Lecture 13	March 29. Homework: study Chapter 8. Exercises 8.1, 8.2. No hand-in.

Basic knowledge of Python generators (which, in turn, build on the more basic notion of Python iterators) will be relevant for the TUeVIFF programming assignment later on. To this end, take a look at the basic example in the Python tutorial, and at the advanced use of Python generators in the Python program for binary pebbling and in the accompanying Python program showing the time and space utilization per round for binary pebbling.

Written exam: Tuesday April 18, 2017, 9.00-12.00h; resit: Friday June 30, 2017, 18.00-21.00h.

Lecture notes

Further reading

• A Computational Introduction to Number Theory and Algebra (Version 2) by Victor Shoup, Cambridge University Press, 2008. Great textbook providing extensive background, and beyond. Free download available.
• Secure Multiparty Computation and Secret Sharing by Ronald Cramer, Ivan Damgård, and Jesper Buus Nielsen, Cambridge University Press, 2015. Great expository text on information-theoretic secure multiparty computation and supporting techniques. See online information.
• Cryptography: An Introduction by Nigel Smart, McGraw-Hill, 2003. Modern introduction at a reasonable level of detail. Currently available in its 3rd edition, which can be downloaded for free.
• Introduction to Modern Cryptography by Jonathan Katz and Yehuda Lindell, Chapman & Hall/CRC Press, 2007. An extensive, rigorous, yet accessible treatment of modern cryptography, based on formal security definitions and with security proofs; mostly covering basic encryption and authentication techniques though. See online information.
• Foundations of Cryptography by Oded Goldreich, 2001 (Vol. 1), 2004 (Vol. 2). Thorough treatment of theoretical results in cryptography, with an extensive treatment of zero-knowledge protocols and general two/multi-party protocols. See online information.
• Fundamentals of Cryptology: A Professional Reference and Interactive Tutorial by Henk van Tilborg, Kluwer Academic Publishers, 2000. See online information. Classic text with many worked examples in Mathematica (PDF and Mathematica notebook).
• Cryptography: Theory and Practice by Douglas Stinson, 3rd edition, CRC Press, 2005. See online information.
• Complexity and Cryptography: An Introduction by John Talbot and Dominic Welsh, Cambridge University Press, 2006. Accessible treatment mainly of cryptographic algorithms, but also of some cryptographic protocols, combined with the relevant notions and ideas of computational complexity. See online information.
• Handbook of Applied Cryptography by Alfred Menezes, Paul C. van Oorschot, and Scott Vanstone, 1997. Download for free at http://www.cacr.math.uwaterloo.ca/hac/.