University of Maryland Crypto Reading Group

The Crypto Reading Group holds regular discussions on various topics in cryptography and computer security. Everyone (regardless of background) is welcome to attend.

To be added to the mailing list for the crypto reading group, go here

During Fall, 2004 we will meet on Mondays from 2-3:30 pm in 3118 CSIC unless noted otherwise.
We will meet on alternate weeks, and the quantum reading group will meet the other weeks at the same time.

Date Time Topic Presented by References
11/15/04 2:00 On the (Im)possibility of Cryptography with Imperfect Randomness Adam Bender The paper by Dodis, et al. is available here

11/1/04 2:00 Reusable cryptographic fuzzy extractors Nan Wang The paper by X. Boyen is available here

10/18/04 2:00 Constructions of digital fingeprinting codes Prof. Alex Barg The paper by A. Barg, G.R. Blakley, and G. Kabatiansky: "Digital fingerprinting codes: Problem statements, construction, idenfitication of traitors" is available here

10/4/04 2:00 Can real-world hash functions be modeled as random oracles? Jonathan Katz (none yet)

9/20/04 2:00 Identity-Based Encryption Ruggero Morselli Ruggero will present the recent paper by Waters

7/29/04 2:00 Provable Security for Routing Protocols Alvaro Cardenas Alvaro will present the paper "Towards Provable Security for Ad Hoc Routing Protocols", by Buttyan and Vajda

7/22/04 2:00 Formal Methods vs. Cryptographic Security Ji Sun Shin Ji Sun will present the paper "Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)", by Abadi and Rogaway

7/15/04 2:00
In 3165 AV Williams Cryptography from Biometrics Alvaro Cardenas The paper by Dodis, et al. is available at the eprint archives

7/8/04 2:00
In 3165 AV Williams "Secret Handshakes" Gelareh Taban The papers by Balfanz, et al. and Castelluccia, et al. will be presented

7/1/04 2:00 Universally Composable Notions of Key Exchange Ji Sun Shin The paper by Canetti and Krawczyk is available here

6/24/04 2:00 Encryption in the Bounded Storage Model Nan Wang The paper by Dziembowski and Maurer appeared in the Journal of Cryptology, 2004

6/17/04 2:00 Obfuscation Omer Horvitz We will discuss the following papers:

On the Impossibility of Obfuscating Programs, by Barak, Goldreich, Impagliazzo, Rudich, Sahai, Vadhan, and Yang
Positive Techniques and Results for Obfuscation, By Lynn, Prabhakaran, and Sahai

6/10/04 2:00 Entity Authentication and Key Distribution Ruggero Morselli The paper by Bellare and Rogaway is available here

6/4/04 2:00 A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols Chiu-Yuen Koo The paper by Bellare, Canetti, and Krawczyk is available here

12/9/03 1:00 Secure Multi-Party Computation Jonathan Katz Goldreich's notes; see below

12/2/03 1:00
In 4185 AV Williams Private Information Retrieval (PIR) Prof. Bill Gasarch Prof. Gasarch maintains a web page with more information about PIR

11/11/03 1:15 Verifiable Secret Sharing (VSS) with Dishonest Minority Chiu-Yuen Koo Chiu will present the paper by Ben-Or and Rabin about VSS (with a broadcast channel) tolerating any dishonest minority

11/4/03 1:00 Secure Two-Party Computation in Constant Rounds Jonathan Katz We will cover Yao's "garbled circuit" technique, as well as the paper on constant-round coin tossing by Lindell

10/30/03
Note different day and time! 2:00 Privacy Preserving Data Mining Prof. Kevin Du, Syracuse University (invited lecturer) See the abstract here

10/21/03 1:00
In 4185 AV Williams! Concurrent Two-Party Computation: Definitions and Impossibility Results Omer Horvitz The talk is based on a paper by Lindell, available here

10/7/03 1:45 Secure Two-Party Computation for Malicious Adversaries II Jonathan Katz We will pick up where we left off on 10/7/03

10/14/03 1:00 Efficiency Improvements for Signature Schemes with Tight Security Reductions Nan Wang The relevant paper, by Katz and Wang, will appear at ACM CCCS '03 and is available here

10/7/03 1:00 Secure Two-Party Computation for Malicious Adversaries Jonathan Katz The talk will be based on Goldreich's notes; see 9/23/03

9/30/03 - NO SEMINAR - -

9/23/03 1:00 Secure Two-Party Computation for Honest-but-Curious Adversaries Jonathan Katz The talk will be based on Oded Goldreich's notes (i.e., Chapter 7 of his upcoming book), available here

9/15/03
Note special day 1:00 Impossibility Results for the Composition of Secure Two-Party Protocols Yehuda Lindell, IBM (invited lecturer) Yehuda's slides are available on-line. Some of the papers Yehuda talked about are available from his homepage

8/14/03 2:00 - 3:30pm Threshold Cryptography Prabha Ramachandran Ideal Threshold Schemes from MDS Codes, by Pieprzyk and Zhang (ISISC 2002)

8/7/03 2:00 - 3:30pm Perfectly-Secure Group Key Distribution Aram Khalili "Perfectly-Secure Key Distribution for Dynamic Conferences," by Blundo, et al. Available from CiteSeer

7/31/03 2:00 - 3:30pm Threshold Password-Based Authentication Ji Sun Shin "Provably-Secure Threshold Password-Authenticated Key Exchange," by Di Raimondo and Gennaro (appeared at Eurocrypt 2003):
proceedings version | full version

7/24/03 2:00 - 3:30pm Broadcast Chiu-Yuen Koo From Partial Consistency to Global Broadcast, by Fitzi and Maurer

7/17/03 2:00 - 3:30pm Group Signatures Xun Yuan Foundations of Group Signatures..., by Bellare, Micciancio, and Warinschi (appeared at Eurocrypt '03)

7/10/03 2:00 - 3:30pm Aggregate Signatures Jonathan Katz The relevant papers are:

Aggregate and Verifiably Encrypted Signatures from Bilinear Maps, by Boneh, Gentry, Lynn, and Shacham (appeared at Eurocrypt '03)
Sequential Aggregate Signatures from Trapdoor Homomorphic Permutations, by Shacham

6/26/03 2:00 - 3:30pm Public-Key Encryption Based on Polynomial Reconstruction: A Proposed Scheme and Some Attacks Austin Parker The relevant papers are:

A Public-Key Encryption Scheme Based on the Polynomial Reconstruction Problem, by Augot and Finiasz (appeared at Eurocrypt '03)
A cryptanalysis of the scheme, by Coron (see also here for an updated version)
Further cryptanalysis by Kiayias and Yung

6/19/03 2:00 - 3:30pm A Perfect Commitment Scheme Based on One-Way Permutations Omer Horvitz The paper by Naor, Ostrovsky, Venkatesan, and Yung is available here

6/12/03 2:00 - 3:30pm Signature Schemes Based on the Strong RSA Assumption (and no random oracles!) Ruggero Moreslli Representative papers include:
"Signature Schemes Based on the Strong RSA Assumption," by Cramer and Shoup.
"The Cramer-Shoup Signature Scheme, Revisited," by Fischlin.
"Secure Hash-and-Sign Signatures Without the Random Oracle," by Gennaro, Halevi, and Rabin.

4/30/03 2:00 - 3:30pm A Signature Scheme as Secure as the Diffie-Hellman Problem Nan Wang "A Signature Scheme as Secure as the Diffie-Hellman Problem," by E.-J. Goh and S. Jarecki (appeared at Eurocrypt '03)

4/16/03 2:00 - 3:30pm Identity-Based Encryption Aram Khalili "An Identity-Based Encryption Schemes Based on Quadratic Residues," by C. Cocks

4/9/03 2:00 - 3:30pm Security Flaws Induced by CBC Padding Ruggero Morselli "Security Flaws Induced by CBC Padding...," by S. Vaudenay

3/26/03 2:00 - 3:00pm Steganography Jonathan Katz "Provably Secure Steganography," by N. Hopper, J. Langford, and L. von Ahn

3/12/03 2:00 - 3:00pm Lower Bounds on the Efficiency of Generic Cryptographic Constructions Omer Horvitz "Lower Bounds on the Efficiency of Generic Cryptographic Constructions," by R. Gennaro and L. Trevisan

3/5/03 2:00 - 3:00pm Key Predistribution Schemes for Distributed Sensor Networks Prof. Virgil Gligor "A Key Management Scheme for Distributed Sensor Networks," by L. Eschenauer and V. Gligor

2/27/03 2:00 - 3:00pm Key Predistribution Schemes for Distributed Sensor Networks Aram Khalili "A Key Management Scheme for Distributed Sensor Networks," by L. Eschenauer and V. Gligor

2/14/03 10:00 - 11:00am Blockwise-Adaptive Security Greg Bard "Blockwise-Adaptive Attackers: Revisiting the (In)security of Some Provably Secure Encryption Modes," by A. Joux, G. Martinet, and F. Valette

12/3/02 2:00 - 3:15pm Network Cryptographic Devices Resilient to Capture Gelareh Taban "Networked Cryptographic Devices Resilient to Capture," by P. MacKenzie and M. Reiter
(full version)

11/26/02 2:00 - 3:30pm Verifiable Secret Sharing Aram Khalili
Aram's notes
"How to Share a Secret," by A. Shamir. Communications of the ACM 22(11): 612-613 (1979)
"A Practical Scheme for Non-Interactive Verifiable Secret Sharing," by P. Feldman. FOCS '87
"Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing," by T. Pedersen. Crypto '91

11/19/02 2:00 - 3:15pm Forward-Secure Signatures, continued Radostina Koleva See 11/12/02

11/12/02 2:00 - 3:15pm Forward-Secure Signatures Radostina Koleva "A Forward-Secure Digital Signature Scheme," by M. Bellare and S. Miner

11/5/02 2:00 - 3:15pm Transitive Signatures Jonathan Katz "Transitive Signatures Based on Factoring and RSA," by M. Bellare and G. Neven
"Transitive Signature Schemes," by S. Micali and R. Rivest

10/29/02 9:45 - 11:00am Security of SSH Greg Bard "Authenticated Encryption in SSH: Provably Fixing the SSH Binary Packet Protocol," by M. Bellare, T. Kohno, and C. Namprempre

10/22/02 9:45 - 11:00am Introduction to elliptic curves, part 2 Justin Brody

Introductory notes from CCR, Princeton.
Tutorial, by Certicom.
Justin's notes

10/15/02 2:00 - 3:00pm Introduction to elliptic curves, part 1 Justin Brody See 10/22/02

10/8/02 10:00 - 11:00am ID-based Encryption from the Weil Pairing, part 2 Aram Khalili See 10/1/02

10/1/02 10:00 - 11:00am ID-based Encryption from the Weil Pairing, part 1 Aram Khalili "Identity Based Encryption from the Weil Pairing," by D. Boneh and M. Franklin
Aram's notes

9/24/02 10:00 - 11:00am Short Signatures from the Weil Pairing Aram Khalili "Short Signatures from the Weil Pairing," by D. Boneh, B. Lynn, and H. Shacham
Aram's notes

Date	Time	Topic	Presented by	References
11/15/04	2:00	On the (Im)possibility of Cryptography with Imperfect Randomness	Adam Bender	The paper by Dodis, et al. is available here
11/1/04	2:00	Reusable cryptographic fuzzy extractors	Nan Wang	The paper by X. Boyen is available here
10/18/04	2:00	Constructions of digital fingeprinting codes	Prof. Alex Barg	The paper by A. Barg, G.R. Blakley, and G. Kabatiansky: "Digital fingerprinting codes: Problem statements, construction, idenfitication of traitors" is available here
10/4/04	2:00	Can real-world hash functions be modeled as random oracles?	Jonathan Katz	(none yet)
9/20/04	2:00	Identity-Based Encryption	Ruggero Morselli	Ruggero will present the recent paper by Waters
7/29/04	2:00	Provable Security for Routing Protocols	Alvaro Cardenas	Alvaro will present the paper "Towards Provable Security for Ad Hoc Routing Protocols", by Buttyan and Vajda
7/22/04	2:00	Formal Methods vs. Cryptographic Security	Ji Sun Shin	Ji Sun will present the paper "Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)", by Abadi and Rogaway
7/15/04	2:00 In 3165 AV Williams	Cryptography from Biometrics	Alvaro Cardenas	The paper by Dodis, et al. is available at the eprint archives
7/8/04	2:00 In 3165 AV Williams	"Secret Handshakes"	Gelareh Taban	The papers by Balfanz, et al. and Castelluccia, et al. will be presented
7/1/04	2:00	Universally Composable Notions of Key Exchange	Ji Sun Shin	The paper by Canetti and Krawczyk is available here
6/24/04	2:00	Encryption in the Bounded Storage Model	Nan Wang	The paper by Dziembowski and Maurer appeared in the Journal of Cryptology, 2004
6/17/04	2:00	Obfuscation	Omer Horvitz	We will discuss the following papers: On the Impossibility of Obfuscating Programs, by Barak, Goldreich, Impagliazzo, Rudich, Sahai, Vadhan, and Yang Positive Techniques and Results for Obfuscation, By Lynn, Prabhakaran, and Sahai
6/10/04	2:00	Entity Authentication and Key Distribution	Ruggero Morselli	The paper by Bellare and Rogaway is available here
6/4/04	2:00	A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols	Chiu-Yuen Koo	The paper by Bellare, Canetti, and Krawczyk is available here
12/9/03	1:00	Secure Multi-Party Computation	Jonathan Katz	Goldreich's notes; see below
12/2/03	1:00 In 4185 AV Williams	Private Information Retrieval (PIR)	Prof. Bill Gasarch	Prof. Gasarch maintains a web page with more information about PIR
11/11/03	1:15	Verifiable Secret Sharing (VSS) with Dishonest Minority	Chiu-Yuen Koo	Chiu will present the paper by Ben-Or and Rabin about VSS (with a broadcast channel) tolerating any dishonest minority
11/4/03	1:00	Secure Two-Party Computation in Constant Rounds	Jonathan Katz	We will cover Yao's "garbled circuit" technique, as well as the paper on constant-round coin tossing by Lindell
10/30/03 Note different day and time!	2:00	Privacy Preserving Data Mining	Prof. Kevin Du, Syracuse University (invited lecturer)	See the abstract here
10/21/03	1:00 In 4185 AV Williams!	Concurrent Two-Party Computation: Definitions and Impossibility Results	Omer Horvitz	The talk is based on a paper by Lindell, available here
10/7/03	1:45	Secure Two-Party Computation for Malicious Adversaries II	Jonathan Katz	We will pick up where we left off on 10/7/03
10/14/03	1:00	Efficiency Improvements for Signature Schemes with Tight Security Reductions	Nan Wang	The relevant paper, by Katz and Wang, will appear at ACM CCCS '03 and is available here
10/7/03	1:00	Secure Two-Party Computation for Malicious Adversaries	Jonathan Katz	The talk will be based on Goldreich's notes; see 9/23/03
9/30/03	-	NO SEMINAR	-	-
9/23/03	1:00	Secure Two-Party Computation for Honest-but-Curious Adversaries	Jonathan Katz	The talk will be based on Oded Goldreich's notes (i.e., Chapter 7 of his upcoming book), available here
9/15/03 Note special day	1:00	Impossibility Results for the Composition of Secure Two-Party Protocols	Yehuda Lindell, IBM (invited lecturer)	Yehuda's slides are available on-line. Some of the papers Yehuda talked about are available from his homepage
8/14/03	2:00 - 3:30pm	Threshold Cryptography	Prabha Ramachandran	Ideal Threshold Schemes from MDS Codes, by Pieprzyk and Zhang (ISISC 2002)
8/7/03	2:00 - 3:30pm	Perfectly-Secure Group Key Distribution	Aram Khalili	"Perfectly-Secure Key Distribution for Dynamic Conferences," by Blundo, et al. Available from CiteSeer
7/31/03	2:00 - 3:30pm	Threshold Password-Based Authentication	Ji Sun Shin	"Provably-Secure Threshold Password-Authenticated Key Exchange," by Di Raimondo and Gennaro (appeared at Eurocrypt 2003): proceedings version \| full version
7/24/03	2:00 - 3:30pm	Broadcast	Chiu-Yuen Koo	From Partial Consistency to Global Broadcast, by Fitzi and Maurer
7/17/03	2:00 - 3:30pm	Group Signatures	Xun Yuan	Foundations of Group Signatures..., by Bellare, Micciancio, and Warinschi (appeared at Eurocrypt '03)
7/10/03	2:00 - 3:30pm	Aggregate Signatures	Jonathan Katz	The relevant papers are: Aggregate and Verifiably Encrypted Signatures from Bilinear Maps, by Boneh, Gentry, Lynn, and Shacham (appeared at Eurocrypt '03) Sequential Aggregate Signatures from Trapdoor Homomorphic Permutations, by Shacham
6/26/03	2:00 - 3:30pm	Public-Key Encryption Based on Polynomial Reconstruction: A Proposed Scheme and Some Attacks	Austin Parker	The relevant papers are: A Public-Key Encryption Scheme Based on the Polynomial Reconstruction Problem, by Augot and Finiasz (appeared at Eurocrypt '03) A cryptanalysis of the scheme, by Coron (see also here for an updated version) Further cryptanalysis by Kiayias and Yung
6/19/03	2:00 - 3:30pm	A Perfect Commitment Scheme Based on One-Way Permutations	Omer Horvitz	The paper by Naor, Ostrovsky, Venkatesan, and Yung is available here
6/12/03	2:00 - 3:30pm	Signature Schemes Based on the Strong RSA Assumption (and no random oracles!)	Ruggero Moreslli	Representative papers include: "Signature Schemes Based on the Strong RSA Assumption," by Cramer and Shoup. "The Cramer-Shoup Signature Scheme, Revisited," by Fischlin. "Secure Hash-and-Sign Signatures Without the Random Oracle," by Gennaro, Halevi, and Rabin.
4/30/03	2:00 - 3:30pm	A Signature Scheme as Secure as the Diffie-Hellman Problem	Nan Wang	"A Signature Scheme as Secure as the Diffie-Hellman Problem," by E.-J. Goh and S. Jarecki (appeared at Eurocrypt '03)
4/16/03	2:00 - 3:30pm	Identity-Based Encryption	Aram Khalili	"An Identity-Based Encryption Schemes Based on Quadratic Residues," by C. Cocks
4/9/03	2:00 - 3:30pm	Security Flaws Induced by CBC Padding	Ruggero Morselli	"Security Flaws Induced by CBC Padding...," by S. Vaudenay
3/26/03	2:00 - 3:00pm	Steganography	Jonathan Katz	"Provably Secure Steganography," by N. Hopper, J. Langford, and L. von Ahn
3/12/03	2:00 - 3:00pm	Lower Bounds on the Efficiency of Generic Cryptographic Constructions	Omer Horvitz	"Lower Bounds on the Efficiency of Generic Cryptographic Constructions," by R. Gennaro and L. Trevisan
3/5/03	2:00 - 3:00pm	Key Predistribution Schemes for Distributed Sensor Networks	Prof. Virgil Gligor	"A Key Management Scheme for Distributed Sensor Networks," by L. Eschenauer and V. Gligor
2/27/03	2:00 - 3:00pm	Key Predistribution Schemes for Distributed Sensor Networks	Aram Khalili	"A Key Management Scheme for Distributed Sensor Networks," by L. Eschenauer and V. Gligor
2/14/03	10:00 - 11:00am	Blockwise-Adaptive Security	Greg Bard	"Blockwise-Adaptive Attackers: Revisiting the (In)security of Some Provably Secure Encryption Modes," by A. Joux, G. Martinet, and F. Valette
12/3/02	2:00 - 3:15pm	Network Cryptographic Devices Resilient to Capture	Gelareh Taban	"Networked Cryptographic Devices Resilient to Capture," by P. MacKenzie and M. Reiter (full version)
11/26/02	2:00 - 3:30pm	Verifiable Secret Sharing	Aram Khalili	Aram's notes "How to Share a Secret," by A. Shamir. Communications of the ACM 22(11): 612-613 (1979) "A Practical Scheme for Non-Interactive Verifiable Secret Sharing," by P. Feldman. FOCS '87 "Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing," by T. Pedersen. Crypto '91
11/19/02	2:00 - 3:15pm	Forward-Secure Signatures, continued	Radostina Koleva	See 11/12/02
11/12/02	2:00 - 3:15pm	Forward-Secure Signatures	Radostina Koleva	"A Forward-Secure Digital Signature Scheme," by M. Bellare and S. Miner
11/5/02	2:00 - 3:15pm	Transitive Signatures	Jonathan Katz	"Transitive Signatures Based on Factoring and RSA," by M. Bellare and G. Neven "Transitive Signature Schemes," by S. Micali and R. Rivest
10/29/02	9:45 - 11:00am	Security of SSH	Greg Bard	"Authenticated Encryption in SSH: Provably Fixing the SSH Binary Packet Protocol," by M. Bellare, T. Kohno, and C. Namprempre
10/22/02	9:45 - 11:00am	Introduction to elliptic curves, part 2	Justin Brody	Introductory notes from CCR, Princeton. Tutorial, by Certicom. Justin's notes
10/15/02	2:00 - 3:00pm	Introduction to elliptic curves, part 1	Justin Brody	See 10/22/02
10/8/02	10:00 - 11:00am	ID-based Encryption from the Weil Pairing, part 2	Aram Khalili	See 10/1/02
10/1/02	10:00 - 11:00am	ID-based Encryption from the Weil Pairing, part 1	Aram Khalili	"Identity Based Encryption from the Weil Pairing," by D. Boneh and M. Franklin Aram's notes
9/24/02	10:00 - 11:00am	Short Signatures from the Weil Pairing	Aram Khalili	"Short Signatures from the Weil Pairing," by D. Boneh, B. Lynn, and H. Shacham Aram's notes