Winter 2010, Schedule: Mon-Wed 13:00-14:30; MC 320
Instructor:
Prof. Claude Crépeau
Office hours:
Friday 13h00 - 16h00 McConnell 110N
Grader: Simon Pierre Desrosiers
Description: (4 credits, 3 hours). In this course we study several topics of cryptography that have emerged recently. This year we will focus on "Zero-knowledge Interactive Proofs and two-party secure computations". Participants are expected to have a good background of cryptography (acquired through 308-547A or not).
HW #4. NOW AVAILABLE
Topic 0: Number Theory Material (pdf)
Topic 0: Interactive Zero-Knowledge Proofs and other Two-Party Cryptographic Protocols
Topic 1: Interactive Proofs vs Arthur-Merlin Games updated 7 Jan 2010 ; PS I left the quantum stuff for completeness but was not covered.
Topic 1: IP vs AM -- Useful Papers
Topic 2: Zero-Knowledge -- blackboard presentations.
Topic 3: Proofs of Knowledge -- blackboard presentations.
Topic 3: Proofs of Knowledge -- Useful Papers
Topic 4: Bit Commitment and BC with equality -- blackboard presentations.
Topic 4: BC and BC with equality -- Useful Papers
Topic 5: ZK power of BC -- blackboard presentations.
Topic 5: ZK power of BC -- Useful Papers
Topic 6: Interactive Arguments = Computationally Sound IP -- blackboard presentations.
Topic 6: Arguments -- Useful Papers
Topic 7: BCs from one-way permutations -- blackboard presentations. mostly hand waving inspired by NOVY
Topic 7: BCs from one-way permutations (Nguyen, Ong and Vadhan) not covered with that level of details
Topic 7: BCs from one-way permutations -- Useful Papers
Topic 8: Computationally Concealing BCs from one-way functions -- blackboard presentations.
Topic 8: PRBG from one-way functions (Hastad, Impagliazzo, Levin, Luby) updated 23 Mar 2010 11h00
Topic 8: Computationally Concealing BCs from one-way functions -- Useful Papers
Topic 10: Introduction to Oblivious Transfer and two-party computations -- blackboard presentations.
Topic 11: One-out-of-two Oblivious Transfer based on the Quadratic Residuosity assumption -- blackboard presentations.
Topic 12: One-out-of-two Oblivious Transfer based on any (enhanced) Trapdoor One-Way permutation -- blackboard presentations.
Topic 13: On the power of One-out-of-two Oblivious Transfer (Honest but curious) -- blackboard presentations.
Topic 9: Computationally Binding BCs from one-way functions -- blackboard presentations.
Topic 9: Computationally Binding BCs from one-way functions -- (Haiftner and Reingold)
Topic 9: Computationally Binding BCs from one-way functions -- Useful Papers (Check paper HR06B.pdf)
Topic 14: Security definition of One-out-of-two Oblivious Transfer -- blackboard presentations.
Topic 15: Committed One-out-of-two Oblivious Transfer and application to two-party computations -- blackboard presentations.
Topic 16: Fairness in two-party computations -- blackboard presentations.
Send comments/questions to cs647@cs.mcgill.ca
02/01/10
Intro course: COMP-547A Cryptography and Data Security