NYU Crypto Reading Group

The Crypto Reading Group is under the auspices of the NYU Cryptography Group, which is part of the NYU Computer Science Department.

We conduct discussions on various topics in cryptography. We consist of faculty and students. Individuals are always welcome to attend. Please read the paper before the meeting.

To receive announcements of the group, send mail to Yevgeniy Dodis (dodis [at] cs [dot] nyu [dot] edu) or Daniel Wichs (wichs [at] cs [dot] nyu [dot] edu).

This fall (2008), we will meet on Wednesdays 1:50pm-3:25pm (check for exact time below) at WWH (directions, building 46), Room 101.

Also, see the NYU Systems Reading Group for additional reading.

Date	Time	Discussion Leader	Topic	Relevant Papers
12/14/07	2:00-3:45pm	Rosario Gennaro	Faster and Shorter Password-Authenticated Key Exchange	Gennaro 07
12/07/07	9:30am-4:10pm	Theory Day	New York Area Theory Day @ NYU	Program
11/30/07	2:00-3:45pm	Daniel Wichs	Isolated Proofs of Knowledge and Isolated Zero Knowledge	Damgard-Nielsen-Wichs 07
11/16/07	2:00-3:45pm	Carl Bosley	A framework for password-based authenticated key exchange	Gennarro-Lindell 03
11/09/07	2:00-3:45pm	Vladimir Kolesnikov	Password Mistyping in Two-Factor-Authenticated Key Exchange
11/02/07	2:00-3:45pm	Brent Waters	Lossy Trapdoor Functions and Their Applications	Peikert-Waters 07
10/26/07	2:00-3:45pm	Kristiyan Haralambiev	Efficient Password-Authenticated Key Exchange Using Human-Memorizable Passwords	Katz-Ostrovsky-Yung 01
10/12/07	2:00-3:45pm	Daniel Wichs	Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman	Boyko-MacKenzie-Patel 00
10/05/07	2:00-3:45pm	Sherman Chow	Authenticated Key Exchange Secure Against Dictionary Attacks	Bellare-Pointcheval-Rogaway 00
09/28/07	2:00-3:45pm	Victor Shoup	The Twin Diffie-Hellman Problem and Applications	Cash-Kiltz-Shoup 07
09/21/07	2:00-3:45pm	Antonio Nicolosi	Encrypted key exchange: password-based protocols secure against dictionary attacks	Bellovin-Merritt 92
09/14/07	2:00-3:45pm	Joel Alwen	On Formal Models for Secure Key Exchange	Shoup 99
09/07/07	2:00-3:45pm	Victor Shoup	Authenticated Key Exchange	Boneh-Shoup
05/03/07	1:45-3:30pm	Emanuele Viola	Pseudorandomness: New Results and Applications
04/26/07	1:45-3:30pm	Yevgeniy Dodis	Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets	Dodis-Katz-Reyzin-Smit 06
04/19/07	1:45-3:30pm	Sharon Goldberg	A Cryptographic Study of Secure Internet Measurement	Barak-Goldberg-Rexford-Xiao 07
04/05/07	1:45-3:30pm	Kristiyan Haralambiev	Efficient Ring Signatures without Random Oracles	Shacham-Waters 07
3/29/07	1:45-3:30pm	Sherman Chow	Full-Domain Subgruop Hiding and Constant-Size Group Signatures	Boyen-Waters 07
3/22/07	1:45-3:30pm	Daniel Wichs	From Weak to Strong Watermarking	Hopper-Molnar-Wagner 07
3/8/07	1:45-3:30pm	Joel Alwen	Secure Linear Algebra Using Linearly Recurrent Sequences	Kiltz-Mohassel-Weinreb-Franklin TCC 2007
3/1/07	1:45-3:30pm	Prashant Puniya	Impossibility Results for various Signature and Encryption Schemes in the Standard Model via Meta-Reductions	Paillier-Vergnaud 05 Paillier-Villar 06 Paillier 07
2/15/07	1:45-3:30pm	Carl Bosley	Does Privacy Require True Randomness?	Bosley-Dodis 07
2/8/07	1:45-3:30pm	Shabsi Walfish	A Tutorial on the Universal Composability (UC) Framework (Part 2)	Canetti 06 Canetti-Dodis-Pass-Walfish 06
2/1/07	1:45-3:30pm	Prof. Michael Ben-Or	Secure Multipary Quantum Computation	Ben-Or et al, FOCS 06
1/25/07	1:45-3:30pm	Shabsi Walfish	A Tutorial on the Universal Composability (UC) Framework	Canetti 06
12/14/06	12:15-1:45pm	Kevin Lawler	On Robust Combiners for Private Information Retrieval and Other Primitives	Meier-Przydatek 06
12/7/06	12:15-1:45pm	Robert Soule	Hiding Secret Points amidst Chaff	Chang-Li 06
11/21/06	12:30-2:00pm WWH Room 101	Alex Dent	Indentity-based Traitor Tracing
11/09/06	12:15-1:45pm	Kristiyan Haralambiev	Sequential Aggregate Signatures and Multisignatures Without Random Oracles	Lu-Ostrovsky-Sahai-Shacham-Waters 06
11/02/06	12:15-1:45pm	Vladimir Kolesnikov	How to tell which of the encrypted numbers is greater?	Blake-Kolesnikov 04 Blake-Kolesnikov 06
10/24/06	1:30-3:00pm WWH Room 1314	Daniel Wichs	On the Impossibility of Efficiently Combining Collision Resistant Hash Functions	Boneh-Boyen 06
10/19/06	12:15-1:45pm	Shai Halevi	Mitigating Dictionary Attacks on Password-Protected Local Storage	Canetti-Halevi-Steiner 06
10/12/06	12:15-1:45pm	Petros Mol	Lattices and Cryptography:An Overview of Recent Results with Emphasis on RSA and NTRU Cryptosystems PDF Presentation	Lenstra-Lenstra-Lovasz 82 Coppersmith 97 Hoffstein,Pipher,Silverman 98 Regev 06
10/05/06	12:15-1:45pm	Sherman Chow	Practical Identity-Based Encryption Without Random Oracles	Gentry 06
09/28/06	12:15-1:45pm	Yevgeniy Dodis	Cryptography and Game Theory 2	Dodis-Halevi-Rabin 00 Shoham-Tennenholtz 01 Abraham-Dolev-Gonen-Halpern 06 Dov Gordon-Katz 06
09/21/06	11:45-1:15pm	Joel Alwen	Rational Secure Function Evaluation and Ideal Mechanism Design	Izmalkov-Lepinksi-Micali 05
09/14/06	12:00-1:30pm	Yevgeniy Dodis	Cryptography and Game Theory 1	Lepinski-Micali-Peikert-Shelat 04 Lepinski-Micali-Shelat 05 Izmalkov-Lepinski-Micali 05
04/14/06	1:00-2:30pm	Giovanni Di Crescenzo	Asynchronous Perfectly Secure Communication over One-Time Pads	Di Crescenzo-Kiayias 05
04/07/06	1:00-2:30pm	Dan Boneh	Broadcast Encryption and Traitor Tracing	Boneh-Gentry Sahai-Waters 06
03/31/06	1:00-2:30pm	Prashant Puniya	On the Relation Between the Ideal Cipher and the Random Oracle Models	Dodis-Puniya 06
03/24/06	1:00-2:30pm	Tal Rabin	Information-Theoretically Secure Protocols and Security Under Composition	Kushilevitz-Lindell Rabin 06
03/03/06	1:00-2:30pm	Shabsi Walfish	Perfectly Secure Password Protocols in the Bounded Retrieval Model	Di Crescenzo-Lipton Walfish 06
02/24/06	1:00-2:30pm	Andrej Bogdanov	Worst-case versus average-case hardness for NP	Bogdanov-Trevisan '06
02/17/06	1:00-2:30pm	Kristiyan Haralambiev	HB and HB+: Authentication Protocols for Low-Cost Devices	Juels and Weis '05 Katz and Shin '06
02/03/06	1:00-2:30pm	Sherman Chow	Ring Signatures without Random Oracles	Bender-Katz-Morselli '05 Chow-Liu-Wei-Yuen '05
01/27/06	2:00-3:30pm	Antonio Nicolosi	Non-Interactive Zero-Knowledge from Homomorphic Encryption	Damgård-Fazio-Nicolosi '06
01/20/06	2:00-3:00pm	Kevin Lawler	Evaluating 2-DNF Formulas on Ciphertexts	Boneh-Goh-Nissim 05
12/13/05	1:00-2:30pm	Peter Ryan	Pret-a-Voter: Practical, Voter-verifiable Elections	Ryan 05
12/02/05	1:00-2:30pm	Stanislaw Jarecki	The Thin Line Between Secure and Insecure Protocols: The case of Robust Multisignatures	Castellucia-Jarecki Kim-Tsudik 04
11/18/05	9:30am-4:10pm	Theory Day	Theory Day @ NYU	Program
11/04/05	1:00-2:30pm	Aggelos Kiayias	Verifiable Anonymous Encryption: A New Privacy Primitive	Kiayias-Tsiounis-Yung 05
10/07/05	1:00-2:30pm	Yevgeniy Dodis	On the Generic Insecurity of the Full Domain Hash	Dodis-Oliveira-Pietrzak 05
09/30/05	1:00-2:30pm	Anna Lysyanskaya	A Formal Treatment of Onion Routing	Camenish-Lysyanskaya 05
09/23/05	1:00-2:30pm	Prashant Puniya	Merkle-Damgaard Revised: how to Construct a Hash Function	Coron-Dodis Malinaud-Puniya 05
09/16/05	1:00-2:30pm	Venkatesan Guruswami	Context, Constructions, Connections, and Challenges	Parvaresh-Vardy 05 Guruswami 05
09/09/05	1:00-2:30pm	Eran Tromer	Reflexive Side-Channel Cryptanalysis: Cache and Acoustic Attacks	Osvik Shamir Tromer 05
05/20/05	1:00-2:30pm	Hoeteck Wee	On Obfuscating Point Functions	Wee 05
05/13/05	1:00-2:30pm	Carl Bosley	Collusion-Free Protocols	Lipinsky, Micali, Shelat 05
04/29/05	1:00-2:30pm	Prashant Puniya	On Error Correction in the Exponent	Peikert 05
04/29/05	1:00-2:30pm	Guy Kindler	New Explicit Constructions of Randomness Extractors from Weak Sources, and of Bipartite Ramsey Graphs	Barak-Kindler-Sudakov Shaltiel-Wigderson 05
04/22/05	1:00-2:30pm	Tal Malkin	Mercurial Commitments with Applications to Zero-Knowledge Sets	Chase-Healy-Lysyanskaya Malkin-Reyzin 05
04/20/05	3:30-5:00pm	Guy Rothblum	The Complexity of Online Memory Checking	Naor-Rothblum 05
04/15/05	9:30am-4:10pm	Theory Day	Theory Day @ Columbia	Program
04/08/05	1:00-2:30pm	Nelly Fazio	Hierarchical Identity Based Encryption with Constant Size Ciphertext	Boneh-Boyen-Goh '05
04/01/05	1:00-2:30pm	Aleksandr Yampolskiy	Spreading rumors quietly and the subgroup escape problem	Aspnes-Diamadi-Gjosteen Peralta-Yampolskiy '05
03/11/05	1:00-2:30pm	Yael Tauman Kalai	Concurrent General Composition of Secure Protocols in the Timing Model	Kalai-Lindell-Prabhakaran '05
02/25/05	1:00-2:30pm	Adam Smith	Toward Privacy in Public Databases	Chawla, Dwork, McSherry, Smith, Wee '05
02/17/05	3:30-5:00pm	Yevgeniy Dodis	On the (non)Universality of the One-Time Pad	Dodis-Spencer '02
02/04/05	1:00-2:30pm	Michael Freedman	Keyword Search and Oblivious Pseudorandom Functions	Freedman, Ishai, Pinkas, Reingold '05
01/28/05	1:00-2:30pm	Nenad Dedić	Upper and Lower Bounds on Black-Box Steganography	Dedić-Itkis-Reyzin-Russell '05
01/14/05	1:00-2:30pm	Masayuki Abe	Tag-KEM/DEM: A New Framework for Hybrid Encryption	Abe-Gennaro-Kurosawa
12/10/04	1:00-2:30pm	Juan Garay	Resource Fairness and Composability of Cryptographic Protocols	Garay-MacKenzie Prabhakaran-Yang '04
12/03/04	1:00-2:30pm	Shai Halevi	Universally Composable Password-Based Key Exchange	Canetti-Halevi-Katz Lindell-MacKenzie '04
11/26/04	1:00-2:30pm	Stefan Wolf	Oblivious Transfer Is Symmetric	Wolf Wullschleger '04
11/19/04	9:30am-4:10pm	Theory Day	Theory Day @ NYU	Program
11/12/04	1:30-3:00pm	Zhiqiang Yang	Privacy-Preserving Bayesian Network Structure Computation on Distributed Heterogeneous Data	Wright Yang 04
11/05/04	1:30-3:00pm	Nelly Fazio	Chosen-Ciphertext Security of Multiple Encryption	Dodis Katz 05
10/22/04	2:15-3:30pm	Giovanni Di Crescenzo	Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model	Di Crescenzo Persiano Visconti 04
10/08/04	2:00-3:30pm	Victor Shoup	A Note on an Encryption Scheme of Kurosawa and Desmedt	Gennaro Shoup 04 Kurosawa Desmedt 04
10/01/04	1:30-3:00pm	Alex Dent	Plaintext Awareness	Bellare Rogaway 94 Bellare et al. 98 Bellare Palacio 04
09/24/04	2:00-3:30pm	Carl Bosley	Fuzzy Identity Based Encryption	Sahai Waters 04
09/17/04	11:30am-12:30pm	Yevgeniy Dodis	Basing Cryptography on Biometrics and Other Noisy Data	Dodis et al. 04
09/10/04	1:00-2:30pm	Prashant Puniya	Exact security of Luby-Rackoff	Patarin 04
08/20/04	1:30-2:30pm	Arial Elbaz	Improved Randomness Extraction from Two Random Sources	Dodis et al 04
08/8/04	1:30-2:30pm	Adi Gottlieb	On Worst-Case to Average-Case Reductions for NP Problems	Bogdanov Trevisan 03
07/30/04	1:30-2:30pm	Victor Shoup	A survey of public key encryption
07/24/04	1:00-2:30pm	Prashant Puniya	Black-Box Composition Does Not Imply Adaptive Security	Myers 04
07/16/04	1:30-3:00pm	Delaram Kahrobaei	Polycyclic Groups: A new Platform for Cryptology?	Abstract
07/09/04	1:30-3:00pm	Shabsi Walfish	Short Group Signatures	Boneh Boyen Shacham 04
06/25/04	1:30-3:00pm	Danny Harnik	Constant-Round Oblivious Transfer in the Bounded Storage Model	Abstract
06/18/04	1:30-3:00pm	Victor Shoup	Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles	Boneh Boyen 04
06/11/04	2:00-3:00pm	Alensandr Yampolsky	Short Signatures Without Random Oracles	Boneh Boyen 04
05/11/04	1:00-2:00pm	Rafeal Pass	Bounded Concurrent Secure MultiParty Computation with a Dishonest Majority	Pass 04
04/30/04	1:30-3:00pm	Antonio Nicolosi	Anonymous Identification in Ad-Hoc Groups
04/23/04	1:30-3:00pm	Yuval Ishai	Batch Codes and Amortized PIR
04/16/04	1:30-3:00pm	Adi Akavia	Proving Hard-Core Predicates Using List Decoding
04/09/04	1:30-3:00pm	Manoj Prabhakarn	New Notions of Security: Universal Composability without Trusted Setup	Prabhakarn Sahai 04
04/02/04	1:30-3:00pm	Hugo Krawczyk	Randomness Extraction via Common Pseudorandom Functions and Its Application to the Hashed Diffie-Hellman Transform	Abstract
03/26/04	1:30-3:00pm	Boaz Barak	Extracting Randomness from Few Independent Sources	Abstract
03/19/04	1:30-3:00pm	Stefan Wolf	Quantum Entanglement from an Information-Theoretic Viewpoint	Abstract
03/12/04	1:00-2:30pm	Aggelos Kiayias	Group Signatures: Provable Security, Efficient Constructions and Anonymity from Trapdoor-Holders	Kiayias Yung 04
03/05/04	1:30-3:00pm	Silvio Micali	Zero-Knowledge Sets	Micali Rabin Kilian 04
02/27/04	1:30-3:00pm	Tal Malkin	A Quantitative Approach to Reductions in Secure Computation	Beimel Malkin 04
02/13/04	1:30-3:00pm	Birgit Pfitzman	Justifying Formal-Method Abstractions of Cryptography: A provably secure Dolev-Yao model	Backes Pfitzmann Waidner 03, Backes Pfitzmann 03
02/06/04	1:00-2:30pm	Roberto Oliveria	Black-box Separation Results among Cryptographic Primitives	Simon 95, Impagliazzo-Rudich 95
01/30/04	1:00-2:30pm	Yehuda Lindell	The Security of Protocols in Modern Network Settings	Lindell 03
01/23/04	1:00-2:30pm	Benny Pinkas	Private analysis of data sets	Abstract
12/19/03	1:00-2:30pm	Ke Yang	Secure MPC with Faulty Majority and Complete Fairness	Garay MacKenzie Yang 03
12/17/03	1:00-2:30pm	Omer Reingold	Simple Proof of the PCP Theorem	Abstract
12/12/03	1:00-2:30pm	Rosario Gennaro	Multi-trapdoor Commitments and their Applications	Gennaro 03
12/5/03	1:00-2:30pm	Phil MacKenzie	Simulation-Sound Trapdoor Commitments	MacKenzie Yang 03
11/21/03	1:00-2:30pm	Yael Tauman	On the insecurity of the Fiat-Shamir Paradigm	Goldwasser Tauman 03
11/14/03	9:30am-4:10pm	Theory Day	Theory Day @ NYU	Program
11/7/03	1:00-2:30pm	Christian Cachin	Secure Intrusion-tolerant Replication on the Internet	Web Site
10/31/03	1:00-2:30pm	Jacques Stern	When provable security meets number theory	Abstract
10/24/03	1:00-2:30pm	Misha Alekhnovich	More on Average case vs. approximation complexity	Alekhnovich 03
10/17/03	1:00-2:30pm	Siddhartha Annapureddy	On the (Im)possibility of Program Obfuscation	Barak et al 01
10/10/03	1:00-2:30pm	Rafael Pass	Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds	Pass Rosen 03
10/3/03	1:00-2:30pm	Victor Shoup	Proving Properties on Committed Integers	Damgard Fujisaki 01, Camenisch Shoup 02
9/26/03	1:00-2:30pm	Prashant Puniya	Advances in the PRPs	Ramzan Reyzin 00
9/19/03	1:00-2:30pm	Leonid Reyzin	Physical Observable Cryptography	Reyzin Micali 03
9/12/03	1:00-2:30pm	Nelly Fazio	Certificate-Based Encryption	Gentry 03
9/05/03	1:00-2:30pm	Roberto Oliveria	On extracting private randomness over a public channel	Dodis Oliviera 03
7/29/03	2:00-3:30pm	Boaz Barak	Constant-Round Coin-Tossing With a Man in the Middle or Realizing the Shared Random String Model	Barak 02
7/23/03	2:00-3:30pm	Siddhartha Annapuredy	Zero-Knowledge Simulation in Quasi-Polynomial Time	Pass 03
7/9/03	2:00-3:30pm	Victor Shoup	Practical Verifiable Encryption and Decryption of Discrete Logarithms	Camenisch, Shoup 02
7/2/03	1:45-3:15pm	Rosario Gennaro	A Framework for Password-based Authenticated Key Exchange	Gennaro, Lindell 03
6/25/03	2:00-3:30pm	Carl Bosley	Aggregate and Verifiably Encrypted Signatures from Bilinear Maps	Boneh, Gentry, Lynn, Shacham 02
6/18/03	2:00-3:30pm	Ke Yang	Strengthening Zero-Knowledge Protocols using Signatures	Garay, MacKenzie, Yang 03
6/11/03	2:00-3:30pm	Shabsi Walfish	Plaintext Awareness via Key Registration	Herzog, Liskov, Micali 03
6/05/03	3:30-5:00pm	David Chaum	Secret-Ballot Receipts and Transparent Integrity	VReceipt page
5/28/03	2:00-3:30pm	Marc Waldman	Security Entanglements (Timeweave and Dagster)	Maniatis, Baker 2002, Stubblefield, Wallach, 2002
5/21/03	1:00-2:30pm	Siddhartha Annapureddy	Constant-Round Non-Blackbox Zero-Knowledge Proofs for NP	Barak 2001
4/25/03	1:00-2:30pm	Roberto Oliveira	On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model	Vadhan 2002
4/18/03	1:00-2:30pm	Petar Maymounkov	Online Codes	Maymounkov 2002 PS
4/11/03	1:00-2:30pm	Jan Camenisch	Protocols Based on the Strong RSA Assumption for Privacy	Camenisch, Lysyanskaya 2002 PS Camenisch, Lysyanskaya 2001
4/4/03	1:00-2:30pm	Victor Shoup	Elementary Poly-Time Primality Test	Agrawal, Kayal, Saxena
4/28/03	1:00-3:00pm	Siddhartha Annapureddy	Concurrent ZK	Micciancio, Petrank 2002 Garay, MacKenzie, Yang 2003
3/12/03	1:30-3:00pm	Antonio Nicolosi	Dynamic Accumulators	Camenisch, Lysyanskaya 2001
3/7/03	1:00-3:00pm	Govind Jajoo	Ring Signatures	Rivest, Shamir, Tauman 2001 Bresson, Stern, Szydlo 2002 Naor 2001
2/28/03	1:00-3:00pm	Nelly Fazio	An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation	Camenisch, Lysyanskaya 2001
2/21/03	1:00pm-3:00pm	Aggelos Kiayias	Fair Group Signatures and their Applications	Ateniese, Camenisch, Joye, Tsudik 2000 Kiayias, Tsiounis, Yung 2003
2/14/03	1:00-3:00pm	Yevgeniy Dodis	Key Insulated Security	Dodis, Katz, Xu, Yung 2002 Dodis, Katz, Xu, Yung 2003
2/7/03	1:00-3:00pm	Victor Shoup	Generating random factored numbers, easily	Kalai 2002
1/31/03	1:30-3:30pm	Anca Ivan	Proxy Cryptography Revisited	Ivan, Dodis 2003
1/24/03	12:45-2:45pm	Shabsi Walfish	Universal padding schemes for RSA	Coron, Joye, Naccache, Paillier 2002
12/6/02	10:00am-12:00pm	Irit Dinur	On the Privacy of Statistical Databases	Dinur, Nissim 2002
11/22/02	1:30pm-3:30pm	Alexander Barg	Digital fingerprinting codes: Problem statements, constructions, identification of traitors	Barg, Blakley, Kabatiansky 2001 Barg, Cohen, Encheva, Kavatiansky, Zemor 2000
11/15/02	11:30am-1:30pm	Nelly Fazio	Public Key Broadcast Encryption for Stateless Receivers	Dodis, Fazio 2002 Naor, Naor, Lotspiech
11/8/02	1:30pm-3:30pm	Yevgeniy Dodis	Efficient Construction of (Distributed) Verifiable Random Functions	Dodis 2002
11/1/02	1:30pm-3:30pm	Roberto Oliveira	How to Fool an Unbounded Adversary with a Short Key	Russell, Wang 2002 (PS) (PDF)
10/25/02	1:30pm-3:30pm	Markus Jakobsson	Fractal Traversal of Merkle Trees	Jakobsson 2002 Coppersmith, Jakobsson 2002
10/18/02	10:00am-12:00pm	Aggelos Kiayias	E-voting based on Homomorphic Encryption	Cramer, Gennaro, Schoenmakers 1997 Damgard, Jurks 2001 Kiayias, Yung 2001
10/11/02	10:00am-12:00pm	Nelly Fazio	Provably Secure Steganography	Hopper, Langford, Ahn 2002
10/4/02	10:00am-12:00pm	Michael Freedman	Tweakable Block Ciphers	Liskov, Rivest, Wagner 2002 Rogaway 2002
9/27/02	10:00am-12:00pm	Antonio Nicolosi	Two-Party Generation Of Proactive Signature Schemes	Nicolosi, Krohn, Dodis, Mazieres 2002
9/20/02	10:00am-12:00pm	Anca Ivan	Incremental Cryptography	Bellare's incremental cryptography papers
9/13/02	1:00-3:00pm	Peter Sarnak	Deterministic Poly-time Primality Testing	Agrawal, Kayal, Saxena 2002
9/6/02	10:30am-12:30pm	Victor Shoup	Optimal Asymmetric Encryption Padding	Shoup 2000 Fujisaki, Okamoto, Pointcheval, Stern 2000 Jonsson 2002 Kobara, Imai 2002
8/28/02	3:00-5:00pm	Yevgeniy Dodis	On the Power of Claw-Free Permutations	Dodis, Reyzin 2002
8/7/02	3:00-5:00pm	Markus Jakobsson	Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking	Jakobsson, Juels, Rivest 2002
7/31/02	3:00-5:00pm	David Molnar	Homomorphic Cryptography and Homomorphic Signature Schemes	Micali, Rivest 2002 Johnson, Molnar, Song, Wagner 2002
7/24/02	3:00-5:00pm	Shabsi Walfish	Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen Plaintext Security	Damgård, Nielsen 2002 Jutla 2000 Halevi 2001
7/17/02	3:00-5:00pm	Jonathan Katz	Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications	Katz 2002
7/10/02	3:00-5:00pm	Aggelos Kiayias	Noisy Polynomials And Their Use In Cryptography	Guruswami, Sudan 1998 Kiayias, Yung 2002
7/3/02	3:00-5:00pm	Antonio Nicolosi	SiBIR: Signer-Base Intrusion-Resilient Signatures	Itkis, Reyzin 2002 Itkis, Reyzin 2001
6/26/02	3:00-5:00pm	Ofer Gill	Random oracle based signature schemes and their relation to Fiat-Shamir type signature schemes	Bellare, Palacio 2002 Abdalla, An, Bellare, Namprempre 2002
6/20/02	3:00-5:00pm	Yevgeniy Dodis	Unique signatures and verifiable random functions from the DH-DDH separation	Lysyanskaya 2002 Micali, Rabin, Vadhan 1999 Naor, Reingold 1997
6/12/02	3:00-5:00pm	Antonio Nicolosi	Forward Secure Public Key Encryption + Hierarchical ID-based Encryption	Katz 2002 Gentry, Silverberg 2002
6/5/02	3:00-5:00pm	Nelly Fazio	Public-key Broadcast Encryption and Traitor Tracing	Dodis, Fazio 2002