Cryptography reading group

From Theory
Revision as of 12:01, 26 March 2010 by Virendra (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

The purpose of this reading group is to study some significant results in cryptography, identify possible ways in which they might be improved or extended, and help prepare students to work on original research problems. The contents will tend to be more advanced, and it is recommended that attendees have taken (or are taking) Applied Cryptography (CS 6260) and/or Theoretical Foundations of Cryptography (CS 8803 TFC).

The reading group is headed by professors Chris Peikert and Sasha Boldyreva. Please contact them with any questions.

Spring 2010

The group meets regularly from 12-2pm on Mondays in Klaus 2100, except for the first meeting on Wednesday, Jan 27 from 12-2pm.

The current schedule of speakers and topics is given below. Virendra Kumar is organizing this term's schedule. Please contact him with any questions or requests.

Date Speaker(s) Topic References
Apr 5 Adam O'Neill Fully Homomorphic Encryption over the Integers Dijk-Gentry-Halevi-Vaikuntanathan
Mar 29 Canceled due to prospective PhD students' visit
Mar 22 Canceled due to Spring Break
Mar 15 Canceled due to ARC3 ARC3
Mar 8 Nathan Chenette Mar 1 meeting contd. Barak-Chaudhuri-Dwork-Kale-McSherry-Talwar
Mar 1 Virendra Kumar Differential Privacy: A Survey of Results Dwork
Feb 22 Canceled due to Crypto 2010 submission deadline Crypto 2010
Feb 15 Adam O'Neill Adaptive Trapdoor Functions and Chosen-Ciphertext Security [Kiltz-Mohassel-O'Neill]
Feb 8 Virendra Kumar Bit Encryption is Complete Myers-Shelat
Feb 1 Sasha Boldyreva Jan 27 meeting contd. Cramer-Hofheinz-Kiltz
Jan 27 Sasha Boldyreva A Twist on the Naor-Yung Paradigm & Efficient CCA-Secure Encryption from Search Problems Cramer-Hofheinz-Kiltz

Fall 2009

The group meets regularly from 12-1:30pm on Wednesdays in Klaus 3100.

The focus this term is on cryptographic results that involve some significant algorithmic ideas (broadly construed).

The schedule of speakers and topics is as follows:

Date Speaker(s) Topic References
2 Dec Sasha Boldyreva Non-malleable hash functions Boldyreva-Cash-Fischlin-Warinschi
18 Nov Steven Ehrlich One-Time Programs Goldwasser-Kalai-Rothblum
11 Nov Daniel Dadush Thorp Shuffle Morris-Rogaway-Stegers
4 Nov Adam O'Neill Security of OAEP Kiltz-O'Neill-Smith
28 Oct Chris Peikert Bonsai Trees Peikert
21 Oct None (Eurocrypt deadline recovery)
14 Oct None (Eurocrypt deadline approaches)
7 Oct Prateek Bhakta Interactive Proofs for Lattice Problems Goldreich-Goldwasser, Micciancio-Vadhan
30 Sep Steven Ehrlich / Ying Xiao Random Selection with Adversarial Majority Gradwohl-Vadhan-Zuckerman
23 Sep Nathan Chenette Cryptanalysis of GGH and NTRU Signatures Nguyen-Regev
16 Sep Adam O'Neill IBEs Based on Quadratic Residuosity Cocks, Boneh-Gentry-Hamburg
9 Sep David Cash PhD Defense practice talk
2 Sep Vadim Lyubashevsky Encryption Based on Subset-Sum Lyubashevsky-Palacio-Segev
26 Aug Chris Peikert Learning Parities with Noise Blum-Kalai-Wasserman


Spring 2008 and earlier