When scribing notes, you should use this preamble. The following sample file illustrates how to use it.
Multiple students will scribe each lecture. I prefer that you submit your scribed lectures in the following way (you can submit this in one email):
One scribed lecture for each student.
All students assigned to a given lecture should merge their notes into one "master" set of notes (by taking the best portions
of each of the individual notes).
Thus, if 3 students are assigned to a given lecture, I expect to receive 4 notes in total.
The individual notes are primarily for grading purposes (and also to make sure that each student scribes their own lecture notes), while the "master" copy will be of higher quality and will be posted here eventually, after being proofread and edited by me.
A first draft of the scribed notes (submitted to me as a tex file that compiles without errors) will be due 2 weeks after the lecture.
Although the students who originally scribed the lectures are listed, the notes below have been proofread by me and, in most cases, extensively edited and revised by me as well (often to the point of being completely re-written).
Please let me know if you spot any typos, errors, or inaccuracies in the notes below!
In addition to the notes by lecture (below), the notes for all lectures are available in one file (note that the individual lecture notes have corrected some errors that still remain in the large file).
Lecture 1 (Introduction, trapdoor permutations):
ps | pdf
Lecture 14 (The random oracle (RO) model, encryption schemes in the RO model): ps | pdf
Lecture 15 (CCA2-secure encryption schemes in the RO model; OAEP+): ps | pdf
Lecture 16 (One-time signature schemes, signature schemes in the RO model): ps | pdf
Lecture 17 (Interactive zero-knowledge (ZK) proofs): ps | pdf
Lecture 18 (Private information retrieval (PIR) --- guest lecture by Prof. Gasarch): ps | pdf
Lecture 19 (Commitment schemes, ZK proofs for all of NP): ps | pdf
Lecture 20 (PIR --- guest lecture by Prof. Gasarch): ps | pdf
Lecture 21 (Witness indistinguishability, parallel composition, perfect vs. standard commitment schemes): ps | pdf
Lecture 22 (Constructions of perfect/standard commitment schemes): ps | pdf
Lecture 23 (A constant-round ZK proof for NP, proofs of knowledge): ps | pdf
Lecture 24 (Arguments, a constant-round ZK argument of knowledge for NP, efficient proof of knowledge for discrete logarithms): ps | pdf
Lecture 25 (Applications of proof systems to identification protocols): ps | pdf
Lecture 26 (Byzantine agreement --- guest lecture by Chiu-Yuen Koo): ps | pdf
Lecture 27 (Byzantine agreement --- guest lecture by Chiu-Yuen Koo): ps | pdf
Lecture 28 (Identification protocols based on the discrete logarithm assumption; from identification schemes to digital signatures using the Fiat-Shamir transformation): ps | pdf
This material is based upon work supported by the National Science Foundation under Grant Numbers #0310751 and #0447075. Any opinions, findings and conclusions or recomendations expressed in this material are those of the author and do not necessarily reflect the views of the National Science Foundation (NSF).