CIS RELATED COURSES AT MIT
Integer lattices are powerful mathematical objects that have found applications in many diverse facets of computer science, most notably in the areas of cryptography and combinational optimization. This course gives an introduction to the theory of integer lattices--algorithms and applications to combinatorial optimization, their recent use in cryptography culminating in the first construction of a fully homomorphic encryption scheme, and the fascinating complexity landscape associated with lattice problems.
We will study both classical and modern technologies for computing on encrypted data including, secure two-party and multi-party computation protocols, fully homomorphic encryption, functional encryption and program obfuscation. We will discuss the recent exciting developments in these areas, and discuss several open problems.
Techniques for achieving security in multi-user computer systems and distributed computer systems. Topics: physical security; discretionary and mandatory access control; biometrics; information-flow models of security; covert channels; elementary cryptography; public-key cryptography; logic of authentication; electronic cash; viruses; firewalls; electronic voting; risk assessment; secure web browsers.
6.875J Cryptography and Cryptanalysis (Same subject as 18.425J)
Professors: S. Goldwasser, S. Micali
A rigorous introduction to modern cryptography. Emphasis on the fundamental cryptographic primitives of public-key encryption, digital signatures, pseudo-random number generation, and basic protocols and their computational complexity requirements.
6.876J Advanced Topics in Cryptography (Same subject as18.426J)Professors: S. Goldwasser, S. Micali
Recent results in cryptography, interactive proofs, and cryptographic game theory. Lectures by instructor, invited speakers, and students.
6.S898 Evolution of a ProofProfessor: S. Goldwasser
This subject has been approved as either an AUS or as a Theoretical Computer Science concentration subject. Efficient proof systems in (1) complexity theory including interactive proofs, efficient arguments, cs-proofs, probabilistically checkable proofs and delegation systems with applications to checking correctness of untrusted computation and memory storage in the cloud and approximation hardness; (2) cryptography: zero knowledge interactive and non-interactive proofs; and (3) quantum computation: interactive proofs and multi-proven interactive proofs with classical and quantum verifiers. The emphasis will be on current state of the art as well as research directions.
6.889 New Developments in CryptographyProfessor: S. Goldwasser
The last few years have witnessed dramatic developments in the field of theoretical cryptography. Novel solutions to long standing open problems such as the existence Homomorphic Encryption have been found, new security concerns such as Leakage Resilience have been addressed, and a surge of new tools have been brought into the cryptographic arena. This development is motivated in part by technological advancement such as cloud computing platform and the abundant use of hand held peripheral devices.Please click here to view courses related to CIS at MIT.