Skip to content

everything.study

18.426

Advanced Topics in Cryptography

Graduate · Historical course

Spring 2003

Topics

Interactive Proofs and Zero-Knowledge Proofs
The Notion of Zero-Knowledgeness
Zero-Knowledge Proofs (cont.)
ZK Proofs and Proofs of Knowledge
ZK Proofs for all of NP
Power and Efficiency of ZK
Variations on ZK
Communication Efficiency for NP Arguments
A Bounded NIZK Proof System for a Special Language
Non-Interactive ZK Proofs for all of NP
Generalizing Non-Interactive Zero-Knowledge Proofs
Improved Non-Interactive Zero-Knowledge
NIZK and the Lunchtime Attack
Lunchtime and Chosen Ciphertext Security
A Practical CCA-2 PK Cryptosystem
Defining ZK Proofs of Knowledge
Mutually Independent Commitments
Concurrent Zero-Knowledge
Concurrent Zero-Knowledge in Polylogarithmic Rounds
Secure Multi-Party Computation in the HBC Model
Compiling an Honest but Curious Protocol
Multi-Party Computation with Perfect Channels

Readings

[GMR85] Goldwasser, S., S. Micali, and C. Rackoff. “ On the Knowledge Complexity of Interactive Proof Systems .” In Proceedings of the 17th ACM Symposium on the Theory of Computing STOC . Providence, Rhode Island, U.S.A.: ACM Press, 1985, pp. 291-304. ↗
Listed reading
The following paper was not handed out in class, but referred to.
Listed reading
[Sha90] Shamir, A. “ IP = PSPACE .” In Proceedings, 31st Annual IEEE Symposium on Foundations of Computer Science . St. Louis, Missouri: IEEE Press, 1990, pp. 11-15. ↗
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.