Selected Topics in Cryptography

Graduate · Historical course

Spring 2004

Topics

L1: Overview of the Course. The “Classic” Definitional Framework of Multiparty Function Evaluation (along the lines of [C00]): Motivation for the Ideal-Model Paradigm.
L3: The Non-Concurrent Composition Theorem. Example: Casting Zero-Knowledge within the Basic Definitional Framework. The Blum Protocol for Graph Hamiltonicity.
L5: Theory of Cryptography Conference (TCC)
L7: The Universally Composable (UC) Security Framework: Motivation and the Basic Definition (based on [C01]).
L9: UC Commitments: Motivation. The Ideal Commitment Functionality. Impossibility of Realizations in the Plain Model.
L11: UC Zero Knowledge from UC Commitments. Secure Realization of any Multi-Party Functionality with any Number of Faults: The Semi-Honest Case. (Static, Adaptive, Two-Party, Multi-Party.)
L13: Universal Composition with Joint State.
L15: Authenticated Key Exchange and Secure-Session Protocols.
L17: Electronic Voting/Introduction
L19: Verifiable Mix-Nets
L21: Verifiable Mix-Nets (cont.)
L23: Chaum’s Voting Scheme
L25: Pairing-Based Cryptography

Readings

Papers to Study
Listed reading
Jakobsson, M., A. Juels, and R. L. Rivest. “ Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking .” Proceedings of the 11th USENIX Security Symposium, USENIX Association, 2003, pp. 339-353. ↗
Listed reading
Boneh, D., and P. Golle. “ Almost entirely correct mixing with applications to voting .” ACM Conference on Computer and Communications Security. New York, NY: ACM Press, 2002, pp. 68-77. ↗
Listed reading
Chaum, D. “ Secret-Ballot Receipts: True Voter Verifiable Elections .” IEEE Security and Privacy , Vol. 2, no. 1. Piscataway, NJ: IEEE Press, 2004, pp. 38-47. ↗
Listed reading
Neff, A. “ A verifiable secret shuffle and its applications to e-voting .” ACM Conference on Computer and Communications Security. New York, NY: ACM Press, 2001, pp. 116-125. ↗
Listed reading
Neff, A. “Verifiable Mixing (Shuffling) of ElGamal Pairs.” VHTi Technical Document. VoteHere, Inc., 2003.
Listed reading
Cramer, R., I. B. Damgård, and B. Schoenmakers. “ Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols .” Advances in Cryptology - CRYPTO ‘94. Lecture Notes on Computer Science 839. Germany: Springer-Verlag, 1994, pp. 174-187. ↗
Listed reading
Jakobsson, M., and A. Juels. “ Millimix: Mixing is Small Batches .” DIMACS Technical Report 99-33. Piscataway, NJ: Center for Discrete Mathematics and Theoretical Computer Science, 1999. ↗
Listed reading
Feige, U., and A. Shamir. “ Witness Indistinguishable and Witness Hiding Protocols .” Annual ACM Symposium on Theory of Computing. New York, NY: ACM Press, 1990, pp. 416-426. ↗
Listed reading
Relevant Readings
Listed reading
Shnayerson, M. “Hack the Vote.” Vanity Fair, April 2004, p. 179.
Listed reading
Wikstrom, D. “ A Universally Composable Mix-Net .” Theory of Cryptography Conference - TCC ‘04. Lecture Notes on Computer Science 2951. Germany: Springer-Verlag, 2004, pp. 317-335. ↗
Listed reading
Bellare, M., J. A. Garay, and T. Rabin. “ Batch Verification with Applications to Cryptography and Checking .” Proceedings of the Third Latin American Symposium on Theoretical Informatics - LATIN ‘98. Lecture Notes on Computer Science 1380. Germany: Springer-Verlag, 1998, pp. 170-191. ↗
Listed reading
Naor, M., and A. Shamir. “ Visual Cryptography .” Advances in Cryptology - CRYPTO ‘94. Lecture Notes on Computer Science 950. Germany: Springer-Verlag, 1995, p. 1. ↗
Listed reading
Bryans, J., and P. Ryan. “A Dependability Analysis of the Chaum Voting Scheme.” (PDF) Technical Report CS-TR-809. United Kingdom: Newcastle University School of Computing Science, 2003. ↗
Listed reading
Relevant Links and Readings
Listed reading
Dutta, R., R. Barua, and P. Sarkar. “ Pairing-Based Cryptography: A Survey .” Report 2004/064. Cryptology ePrint Archive. ↗
Listed reading
Boneh, D., and M. Franklin. “ Identity-based encryption from the Weil pairing .” Advances in Cryptology - CRYPTO ‘01. Lecture Notes on Computer Science 2139. Germany: Springer-Verlag, 2001, pp. 213-229. ↗
Listed reading
Barreto, P. S. L. M., H. Y. Kim, B. Lynn, and M. Scott. “ Efficient Algorithms for Pairing-Based Cryptosystems .” Advances in Cryptology - CRYPTO ‘02. Lecture Notes on Computer Science 2442. Germany: Springer-Verlag, 2002, pp. 354-368. The Pairing-Based Crypto Lounge ↗
Listed reading

Sources

Course catalogue ↗Historical OpenCourseWare
MIT OCW calendar ↗
MIT OCW readings ↗
MIT OCW syllabus ↗
Historical MIT OpenCourseWare offering. Named reading entries and schedule topics are automatically extracted from the linked source pages.