Date 
Time 
Discussion Leader 
Topic 
Slides and Relevant Papers 
05/04/16 
1:002:30pm Room 805

Dakshita Khurana 
TwoMessage NonMalleable Commitments


04/26/16 
1:002:30pm Room 412

Silas Richelson 
Three Round NonMalleable Commitment from NonMalleable Codes

Textbook NonMalleable Commitments

04/19/16 
1:002:30pm Room 412

Ari Juels 
The Ring of Gyges: Investigating the Future of Criminal Smart Contracts

The Ring of Gyges: Investigating the Future of Criminal Smart Contracts

04/12/16 
1:002:30pm Room 412

Yevgeniy Dodis 
Nonmalleable codes

Nonmalleable Reductions and Applications
Nonmalleable Codes from Additive Combinatorics

04/05/16 
1:002:30pm Room 412

Valerio Pastro 
Essentially Optimal Robust Secret Sharing with Maximal Corruptions

Essentially Optimal Robust Secret Sharing with Maximal Corruptions

03/29/16 
1:002:30pm Room 412

Abhrajit Sengupta 
Provably Robust SpongeBased PRNGs and KDFs

Provably Robust SpongeBased PRNGs and KDFs

03/22/16 
1:002:30pm Room 412

Alexander Golovnev 
Generalizations of the Gate Elimination Method

Slides

03/08/16 
1:002:30pm Room 412

Siyao Guo 
Threshold Secret Sharing Requires A Linear Size Alphabet


03/01/16 
1:002:30pm Room 412

Chaya Ganesh 
Privacy Preserving Credential Verification


02/23/16 
1:002:30pm Room 412

Noah StephensDavidowitz 
Cryptographic Reverse Firewalls

Slides
Message Transmission with Reverse FirewallsSecure Communication on Corrupted Machines

12/09/15 
3:154:45pm Room 505

Marshall Ball 
NonMalleable Codes for Bounded Depth Circuits


12/09/15 
11:30am1:00pm Room 1302

Daniel Genkin 
I Know What You Did Last Decryption: Physical Side Channel Attacks on PCs

Get Your Hands Off My Laptop:
Physical SideChannel KeyExtraction Attacks On PCs

09/11/15 
3:004:30pm Room 412

Hoeteck Wee 
Real Cryptographers Don't Use Obfuscation


04/08/15 
1:303:00pm Room 412

Tomasz Kazana 
LeakageResilient Cryptography with Key Derived from Sensitive Data


01/27/15 
1:303:00pm Room 412

Vanishree Rao 
Adaptive Multiparty NonInteractive Key Exchange without Setup
in the Standard Model

Adaptive Multiparty Noninteractive Key Exchange Without Setup In The Standard Model

12/10/14 
3:004:30pm Room 412

John Steinberger 
SubstitutionPermutation Networks


12/03/14 
3:305:00pm Room 412

Sergey Gorbunov 
Predicate Encryption for Circuits from Standard Lattices


05/27/14 
12:001:30pm Room 412

Mor Weiss 
Probabilistically Checkable Proofs With Zero Knowledge


04/14/14 
1:002:30pm Room 1314

Ari Juels 
The Password That Never Was


04/08/14 
1:002:30pm Room 412

Rafael Pass 
Indistinguishability Obfuscation from SemanticallySecure
Multilinear Encodings


03/11/14 
1:002:30pm Room 412

Aris Tentes 
Coin Flipping of Any Constant Bias Implies OneWay Functions

Coin Flipping of Any Constant Bias Implies OneWay Functions

02/18/14 
1:303:00pm Room 412

Gilad Asharov 
Towards Characterizing Complete Fairness in Secure TwoParty Computation


12/03/13 
1:303:00pm Room 1302

Kai Min Chung 
Interactive Coding, Revisited


11/26/13 
1:003:30pm Room 1302

Allison Lewko 
Interactive coding for multiparty protocols


11/20/13 
2:304:00pm Room 412

Mark Zhandry 
Multiparty Key Exchange, Efficient Traitor Tracing, and More
from Indistinguishability Obfuscation


11/13/13 
1:002:30pm Room 412

Mahdi Cheraghchi 
NonMalleable Coding Against Bitwise and SplitState Tampering

NonMalleable Coding Against Bitwise and SplitState Tampering

11/06/13 
1:002:30pm Room 412

Valerio Pastro 
Verifiable Computation over Encrypted Data in the Presence of
Verification Queries


10/25/13 
3:505:20pm Room 1302

Sergey Yekhanin 
Local erasure coding for data storage


10/24/13 
1:002:30pm Room 1302

Elette Boyle 
Extractability Obfuscation


10/23/13 
1:002:30pm Room 412

Nishanth Chandran 
Secure Delegation to the Cloud


10/09/13 
1:002:30pm Room 412

Jonathan Ullman 
Fingerprinting Codes and the Price of
Approximate Differential Privacy


10/03/13 
2:003:30pm Room 1314

Nathan Keller 
An overview on the security of the Advanced Encryption Standard


09/19/13 
1:002:30pm Room 1302

Sanjam Garg 
Candidate Multilinear Maps


09/19/13 
11:00am12:30pm Room 1314

Tom Ristenpart 
From Credit Cards to Censorship Circumvention:
Building Encryption Schemes with Specialized Ciphertext Formats


09/10/13 
2:153:15pm Room 412

Melissa Chase 
Algebraic MACs and KeyedVerification Credentials


12/05/12 
12:001:30pm Room 412

Divesh Aggarwal 
Does Privacy Require True Randomness?

BosleyDodis

11/27/12 
1:002:30pm Room 317

Chaya Ganesh 
Securing Circuits Against ConstantRate Tampering

DachmanSoledKalai

11/21/12 
12:001:30pm Room 412

Mike Walfish 
Making proofbased verified computation almost practical

SettyVuPanpaliaBraunBlumbergWalfish
SettyMcPhersonBlumbergWalfish

11/20/12 
1:002:30pm Room 317

Noah StephensDavidowitz 
Entangled Storage


10/24/12 
1:302:30pm Room 412

Zvika Brakerski 
Fully Homomorphic Encryption


10/10/12 
12:001:30pm Room 412

Adriana LopezAlt 
Cryptography and Differential Privacy with Imperfect Randomness

DodisLopezAltMironovVadhan

10/2/12 
1:002:30pm Room 317 
Valerio Pastro 
Multiparty Computation from Somewhat Homomorphic Encryption, also
known as SPDZ (Continued)

DamgardPastroSmartZakarias

09/25/12 
1:002:30pm Room 317 
Valerio Pastro 
Multiparty Computation from Somewhat Homomorphic Encryption, also known as SPDZ

DamgardPastroSmartZakarias

09/18/12 
1:303:00pm

Dario Fiore 
Verifiable Outsourcing of Computation

CatalanoGennaroFioreVamvourellis

09/13/12 
3:305:00pm Room 1314 
KaiMin Chung 
Recent Progress on Parallel Repetition


09/12/12 
12:001:30pm Room 412 
KaiMin Chung 
On the (Im)Possibility of TamperResilient Cryptography: Using
Fourier Analysis in Computer Viruses


09/11/12 
1:303:00pm

Stephen Finigan 
Latest on Fully Homomorphic Encryption from LWE


05/09/12 
12:001:30pm

Dario Fiore 
Vector Commitments and their Applications

CatalanoFiore

04/25/12 
12:001:30pm

Milinda Perera 
OutsiderAnonymous Broadcast Encryption

FazioPerera

04/11/12 
12:001:30pm CANCELLED 
Dario Fiore 
Vector Commitments and their Applications

CatalanoFiore

04/04/12 
12:001:30pm 
Victor Shoup 
GNUC: A New Universal Composability Framework

HofheinzShoup

03/28/12 
12:001:30pm 
Yevgeniy Dodis 
Randomness Condensers for Efficiently Samplable, SeedDependent Sources

DodisRistenpartVadhan

03/07/12 
12:001:30pm 
David Cash 
Security Against RelatedKey Attacks: Definitions, Relations & Constructions

BellareCash BellareCashMiller

02/29/12 
12:001:30pm 
Aris Tentes 
Hardness Preserving Constructions of Pseudorandom Functions

JainPietrzakTentes

02/15/12 
12:001:30pm CANCELLED 
Aris Tentes 
Hardness Preserving Constructions of Pseudorandom Functions

JainPietrzakTentes (To Appear)

02/08/12 
12:001:30pm 
Dario Fiore 
Adaptive PseudoFree Groups and Applications

CatalanoFioreWarinschi

02/01/12 
1:002:00pm 
David Cash 
A Survey of Oblivious RAMs


12/13/11 
1:302:30pm 
Yevgeniy Dodis 
The Leftover Hash Lemma, Revisited

BarakDodiset.al.

11/29/11 
1:152:30pm 
Adriana LópezAlt 
Efficient Fully Homomorphic Encryption from (Standard) LWE (Continued)

BrakerskiVaikuntanathan

11/22/11 
1:302:30pm 
Adriana LópezAlt 
Efficient Fully Homomorphic Encryption from (Standard) LWE

BrakerskiVaikuntanathan

11/15/11 
1:302:30pm 
Mariana Raykova 
How to Delegate and Verify in Public: Verifiable Computation from
Attributebased Encryption

ParnoRaykovaVaikuntanathan

11/08/11 
1:302:30pm 
FengHao
Liu 
Tamper and Leakage Resilience in the SplitState Model

LiuLysyanskaya

10/28/11 
2:303:30pm 
Melissa Chase 
Malleable Proof Systems and Applications

To Appear

10/28/11 
1:302:30pm 
Adam O'Neill 
Security Proofs for RSAOAEP in the Standard Model

KiltzO'NeillSmith

12/07/10 
1:002:30pm 
Ricky Rosen 
A Strong Parallel Repetition Theorem for Projection Games on Expanders

RazRosen

11/23/10 
1:002:30pm 
Muthu Venkitasubramaniam 
Private Coins versus Public Coins in ZeroKnowledge Proof Systems

PassVenkitasubramaniam 10

11/23/10 
1:002:30pm 
Yevgeniy Vahlis 
Two Is A Crowd? A BlackBox Separation Of OneWayness and Security Under Correlated Inputs

Vahlis 10

11/17/10 
11:0012:30pm WWH Rm. 312 
Dan Boneh 
Recent Developments in Identity Based Encryption: Lattices and Beyond

AgrawalBonehBoyen 10

11/02/10 
1:002:30pm 
Dana DachmanSoled 
On the BlackBox Complexity of OptimallyFair coin tossing

DachmanSoledLindellMahmoodyMalkin 11

10/18/10 
1:002:30pm 
Hoeteck Wee 
Efficient ChosenCiphertext Security via Extractable Hash Proofs

Wee 10

10/04/10 
1:002:30pm WWH Rm. 317 
Isamu Teranishi 
Signatures Resilient to Continual Leakage on Memory and Computation

MalkinTeranishiVahlisYung 10

10/01/10 
1:002:30pm WWH Rm. 1314 
Joël Alwen 
Efficient Lattice (H)IBE in the Standard Model continued

AgrawalBonehBoyen 10
Boyen 10

09/28/10 
1:002:30pm 
Joël Alwen 
Efficient Lattice (H)IBE in the Standard Model

AgrawalBonehBoyen 10

09/21/10 
1:002:30pm 
Adriana LópezAlt 
Bonsai Trees, or How to Delegate a Lattice Basis

CashHofeinzKiltzPeikert 10

05/04/10 
1:002:30pm 
Aristeidis Tentes 
On the (In)Security of RSA signatures

DodisTentesHaitner 10

04/27/10 
1:002:30pm 
Yevgeniy Vahlis 
Cryptography in The Presence of Continuous SideChannel Attacks

JumaVahlis 10

04/13/10 
1:002:30pm 
Shai Halevi 
iHop Homomorphic Encryption Schemes

GentryHaleviVaikuntanathan 10

04/06/10 
1:002:30pm 
Joël Alwen 
Short and Stateless Signatures from the RSA Assumption

HohenbergerWaters 09

03/23/10 
1:002:30pm 
Craig Gentry 
Fully Homomorphic Encryption over the Integers

DGHV 09

03/09/10 
1:002:30pm 
Aristeidis Tentes 
Compression from Collisions, or why CRHF Combiners have a Long Output

Pietrzak 08

03/02/10 
1:002:30pm 
Daniel Wichs 
NonMalleable Codes

DziembowskiPietrzakWichs 10

02/02/10 
1:002:30pm 
Dennis Shasha 
Secure Rural Banking On a Single Insecure Cellphone


01/26/10 
1:002:30pm 
Charanjit Jutla 
Almost Optimal Bounds for Direct Product Threshold Theorem

Jut'10

12/15/09 
4:005:30pm 
Itach Haitner 
A Parallel Repetition Theorem for Any Interactive Argument

Hai'09

12/08/09 
4:005:30pm 
Daniel Wichs 
PublicKey Encryption in the BoundedRetrieval Model

AlwenDodisNaor SegevWichsWalfish'09

12/01/09 
4:005:30pm 
Moni Naor 
Privacy of Dynamic Data: Continual Observation and Pan Privacy

Watch Online

11/24/09 
4:005:30pm 
Aristeidis Tentes 
Key Dependent Message Secure Schemes

BHHO'08
BHHI'09

11/17/09 
4:005:30pm 
Jung Hee Cheon 
Trapdoor DL groups and their Applications

Cheon 09

11/10/09 
4:005:30pm 
Vinod Vaikuntanathan 
Public key Encryption Schemes with Auxiliary Input

DodisGoldwasserKalai
PeikertVaikuntanathan 09

11/03/09 
4:005:30pm 
Kristiyan Haralambiev 
Dual System Encryption and Recent IBE/HIBE Constructions

Waters 09
LewkoWaters 09

10/22/09 
3:305:00pm 
Sherman Chow 
Improving Privacy and Security in MultiAuthority AttributeBased Encryption

ChaseChow 09

10/13/09 
4:005:30pm 
Yevgeniy Dodis 
Message Authentication Codes from Unpredictable Block Ciphers

DodisSteinberger 09

10/05/09 
4:005:30pm 
Joël Alwen 
CollusionFree Multiparty Computation in the Mediated Model

AlwenKatzLindell PersianoshelatVisconti 09

09/29/09 
4:005:30pm 
Claudio Orlandi 
On the Necessary and Sufficient Assumptions for UC Computation

DamgårdNielsenOrlandi 09

09/22/09 
4:005:30pm 
Adriana Lopez 
SpaceEfficient Identity Based Encryption Without Pairings

BonehGentryHamburg 07

09/15/09 
4:005:30pm 
Victor Shoup 
Efficient Noninteractive Proof Systems for Bilinear Groups

GrothSahai 08

05/11/09 
3:204:50pm 
Aristeidis Tentes 
Noninteractive Statistical ZeroKnowledge Proofs for Lattice Problems

PeikertVaikuntanathan 08

05/05/09 
3:204:50pm 
Carl Bosely 
Lossy Trapdoor Functions and Their Applications  Part II

PeikertWaters 08

04/28/09 
3:204:50pm 
Carl Bosely 
Lossy Trapdoor Functions and Their Applications  Part I 
PeikertWaters 08 
04/21/09 
3:204:50pm 
Craig Gentry 
Fully Homomorphic Encryption Using Ideal Lattices

To Appear

04/14/09 
3:204:50pm 
Daniel Wichs 
PublicKey Cryptosystems from the WorstCase Shortest Vector Problem

Peikert 09

04/7/09 
3:204:50pm 
Joël Alwen 
Trapdoors for Hard Lattices and New Cryptographic Constructions  Part II (IBE & LWE)

GentryPeikertVaikuntanathan 08

03/31/09 
3:204:50pm 
Joël Alwen 
Trapdoors for Hard Lattices and New Cryptographic Constructions

GentryPeikertVaikuntanathan 08

03/10/09 
3:204:50pm 
Vinod Vaikuntanathan 
Cryptography against Memory Attacks

AkaviaGoldwasserVaikuntanathan 09

03/02/09 
1:002:30pm WWH Rm. 201 
Aristeidis Tentes 
On Lattices, Learning with Errors, Random Linear Codes, and Cryptography

Regev 05

02/17/09 
3:204:50pm

Ragesh Jaiswal 
Security Amplification for Interactive Cryptographic Primitives

DodisImpagliazzoJaiswalKabanets 09

02/10/09 
3:204:50pm

Kristiyan Haralambiev 
Worstcase to averagecase reductions based on Gaussian measures

MicciancioRegev 07
GentryPeikertVaikuntanathan 08

01/27/09 
3:204:50pm

Carl Bosley 
Cryptographic functions from worstcase complexity assumptions

Micciancio 07

11/26/08 
1:503:25pm

Benny Applebaum

Basing LowerBounds
for Learning on WorstCase Assumptions

BarakApplebaumXiao 08

11/19/08 
1:503:25pm

Adi Akavia

Finding Significant Fourier Transform Coefficients
Deterministically and Locally


11/12/08 
1:503:25pm

Boaz Barak

Public Key Cryptography from Different
Assumptions

BarakWidgerson 08

11/05/08 
1:503:25pm

Alex Dent

Sufficient Conditions for Intractability over BlackBox Groups

(Asiacrypt 08)

10/29/08 
1:503:25pm

Dario Fiore

Zero Knowledge Sets with
Short Proofs

CatalanoFioreMessina (Eurocrypt 08)

10/22/08 
1:503:25pm

Joël Alwen

CollusionFree Protocols in the Mediated Model

AlwenshelatVisconti.

10/15/08 
1:503:25pm

Andrew Wan

Optimal Cryptographic Hardness of
Learning Monotone Functions

DacahmSoled et al.

10/08/08 
1:503:25pm

Juan Garay

Protocols and Open Problems in
Partially Connected Networks


10/01/08 
1:503:25pm

Anup Rao

Network Extractor Protocols

Kalai et al.

09/24/08 
1:503:25pm

Aristeidis Tentes

The unified theory of Pseudorandomness

Salil Vadhan

10/17/08 
1:503:25pm

Vinod Vaikuntanathan

Trapdoors for Hard Lattices and
New Cryptographic Constructions

GentryPeikertVaikuntanathan 08

09/11/08 
2:15 pm, room 1314

Yevgeniy Dodis

Extractors, ErrorCorrection and Hiding
All Partial Information

Dodis

09/10/08 
1:503:25pm

Daniel Wichs

Adding Robustness to Information Theoretic Primitives

Cramer et al 08

12/14/07 
2:003:45pm

Rosario Gennaro

Faster and Shorter PasswordAuthenticated Key Exchange

Gennaro 07

12/07/07 
9:30am4:10pm

Theory Day

New York Area Theory Day @ NYU

Program

11/30/07 
2:003:45pm

Daniel Wichs

Isolated Proofs of Knowledge and Isolated Zero Knowledge

DamgardNielsenWichs 07

11/16/07 
2:003:45pm

Carl Bosley

A framework for passwordbased authenticated key exchange

GennarroLindell 03

11/09/07 
2:003:45pm

Vladimir Kolesnikov

Password Mistyping in TwoFactorAuthenticated Key Exchange


11/02/07 
2:003:45pm

Brent Waters

Lossy Trapdoor Functions and Their Applications

PeikertWaters 07

10/26/07 
2:003:45pm

Kristiyan Haralambiev

Efficient PasswordAuthenticated Key Exchange Using HumanMemorizable Passwords

KatzOstrovskyYung 01

10/12/07 
2:003:45pm

Daniel Wichs

Provably Secure PasswordAuthenticated Key Exchange Using DiffieHellman

BoykoMacKenziePatel 00

10/05/07 
2:003:45pm

Sherman Chow

Authenticated Key Exchange Secure Against Dictionary Attacks

BellarePointchevalRogaway 00

09/28/07 
2:003:45pm

Victor Shoup

The Twin DiffieHellman Problem and Applications

CashKiltzShoup 07

09/21/07 
2:003:45pm

Antonio Nicolosi

Encrypted key exchange: passwordbased
protocols secure against dictionary attacks

BellovinMerritt 92

09/14/07 
2:003:45pm

Joël Alwen

On Formal Models for Secure Key Exchange

Shoup 99

09/07/07 
2:003:45pm

Victor Shoup

Authenticated Key Exchange

BonehShoup

05/03/07 
1:453:30pm

Emanuele Viola

Pseudorandomness: New Results and Applications


04/26/07 
1:453:30pm

Yevgeniy Dodis

Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets

DodisKatzReyzinSmit 06

04/19/07 
1:453:30pm

Sharon Goldberg

A Cryptographic Study of Secure Internet Measurement

BarakGoldbergRexfordXiao 07

04/05/07 
1:453:30pm

Kristiyan Haralambiev

Efficient Ring Signatures without Random Oracles

ShachamWaters 07

3/29/07 
1:453:30pm

Sherman Chow

FullDomain Subgruop Hiding and ConstantSize Group Signatures

BoyenWaters 07

3/22/07 
1:453:30pm

Daniel Wichs

From Weak to Strong Watermarking

HopperMolnarWagner 07

3/8/07 
1:453:30pm

Joël Alwen

Secure Linear Algebra Using Linearly Recurrent Sequences

KiltzMohasselWeinrebFranklin TCC 2007

3/1/07 
1:453:30pm

Prashant Puniya

Impossibility Results for various Signature and Encryption Schemes in the
Standard Model via MetaReductions

PaillierVergnaud 05
PaillierVillar 06
Paillier 07

2/15/07 
1:453:30pm

Carl Bosley

Does Privacy Require True Randomness?

BosleyDodis 07

2/8/07 
1:453:30pm

Shabsi Walfish

A Tutorial on the Universal Composability (UC) Framework (Part 2)

Canetti 06
CanettiDodisPassWalfish 06

2/1/07 
1:453:30pm

Prof. Michael BenOr

Secure Multipary Quantum Computation

BenOr et al, FOCS 06

1/25/07 
1:453:30pm

Shabsi Walfish

A Tutorial on the Universal Composability (UC) Framework

Canetti 06

12/14/06 
12:151:45pm

Kevin Lawler

On Robust Combiners for Private Information Retrieval and Other Primitives

MeierPrzydatek 06

12/7/06 
12:151:45pm

Robert Soule

Hiding Secret Points amidst Chaff

ChangLi 06

11/21/06 
12:302:00pm WWH Room 101 
Alex Dent

Indentitybased Traitor Tracing


11/09/06 
12:151:45pm

Kristiyan Haralambiev

Sequential Aggregate Signatures and Multisignatures Without Random
Oracles

LuOstrovskySahaiShachamWaters 06

11/02/06 
12:151:45pm 
Vladimir Kolesnikov

How to tell which of the encrypted numbers is greater?

BlakeKolesnikov 04
BlakeKolesnikov 06

10/24/06 
1:303:00pm WWH Room 1314 
Daniel Wichs

On the Impossibility of Efficiently Combining Collision Resistant Hash
Functions

BonehBoyen 06

10/19/06 
12:151:45pm 
Shai Halevi

Mitigating Dictionary Attacks on PasswordProtected Local Storage

CanettiHaleviSteiner 06

10/12/06 
12:151:45pm 
Petros Mol

Lattices and Cryptography:An Overview of Recent Results with
Emphasis on RSA and NTRU Cryptosystems
PDF Presentation

LenstraLenstraLovasz 82
Coppersmith 97
Hoffstein,Pipher,Silverman 98
Regev 06

10/05/06 
12:151:45pm 
Sherman Chow

Practical IdentityBased Encryption Without Random Oracles

Gentry 06

09/28/06 
12:151:45pm 
Yevgeniy Dodis

Cryptography and Game Theory 2

DodisHaleviRabin 00
ShohamTennenholtz 01
AbrahamDolevGonenHalpern 06
Dov GordonKatz 06

09/21/06 
11:451:15pm 
Joël Alwen

Rational Secure Function Evaluation and Ideal Mechanism Design

IzmalkovLepinksiMicali 05

09/14/06 
12:001:30pm 
Yevgeniy Dodis

Cryptography and Game Theory 1

LepinskiMicaliPeikertShelat 04
LepinskiMicaliShelat 05
IzmalkovLepinskiMicali 05

04/14/06 
1:002:30pm 
Giovanni Di Crescenzo

Asynchronous Perfectly Secure Communication over OneTime Pads

Di CrescenzoKiayias 05

04/07/06 
1:002:30pm 
Dan Boneh

Broadcast Encryption and Traitor Tracing

BonehGentry
SahaiWaters 06

03/31/06 
1:002:30pm 
Prashant Puniya

On the Relation Between the Ideal Cipher and the Random Oracle Models

DodisPuniya 06

03/24/06 
1:002:30pm 
Tal Rabin

InformationTheoretically Secure Protocols and
Security Under Composition

KushilevitzLindell
Rabin 06

03/03/06 
1:002:30pm 
Shabsi Walfish

Perfectly Secure Password Protocols in the Bounded Retrieval Model

Di CrescenzoLipton
Walfish 06

02/24/06 
1:002:30pm 
Andrej Bogdanov

Worstcase versus averagecase hardness for NP

BogdanovTrevisan '06

02/17/06 
1:002:30pm 
Kristiyan Haralambiev

HB and HB+: Authentication Protocols for LowCost Devices

Juels and Weis '05
Katz and Shin '06

02/03/06 
1:002:30pm 
Sherman Chow

Ring Signatures without Random Oracles

BenderKatzMorselli '05
ChowLiuWeiYuen '05

01/27/06 
2:003:30pm 
Antonio Nicolosi

NonInteractive ZeroKnowledge from Homomorphic Encryption

DamgårdFazioNicolosi '06

01/20/06 
2:003:00pm 
Kevin Lawler

Evaluating 2DNF Formulas on Ciphertexts

BonehGohNissim 05

12/13/05 
1:002:30pm 
Peter Ryan

PretaVoter: Practical, Voterverifiable Elections

Ryan 05

12/02/05 
1:002:30pm 
Stanislaw Jarecki

The Thin Line Between Secure and Insecure Protocols:
The case of Robust Multisignatures

CastelluciaJarecki
KimTsudik 04

11/18/05 
9:30am4:10pm 
Theory Day 
Theory Day @ NYU 
Program 
11/04/05 
1:002:30pm 
Aggelos Kiayias

Verifiable Anonymous Encryption: A New Privacy Primitive

KiayiasTsiounisYung 05

10/07/05 
1:002:30pm 
Yevgeniy Dodis

On the Generic Insecurity of the Full Domain Hash

DodisOliveiraPietrzak 05

09/30/05 
1:002:30pm 
Anna Lysyanskaya

A Formal Treatment of Onion Routing

CamenishLysyanskaya 05

09/23/05 
1:002:30pm 
Prashant Puniya 
MerkleDamgaard Revised: how to Construct a Hash Function

CoronDodis
MalinaudPuniya 05

09/16/05 
1:002:30pm 
Venkatesan Guruswami

Context, Constructions, Connections, and Challenges

ParvareshVardy 05
Guruswami 05

09/09/05 
1:002:30pm 
Eran Tromer

Reflexive SideChannel Cryptanalysis: Cache and Acoustic Attacks

Osvik Shamir Tromer 05

05/20/05 
1:002:30pm 
Hoeteck Wee 
On Obfuscating Point Functions

Wee 05

05/13/05 
1:002:30pm 
Carl Bosley 
CollusionFree Protocols

Lipinsky, Micali, Shelat 05

04/29/05 
1:002:30pm 
Prashant Puniya 
On Error Correction in the Exponent

Peikert 05

04/29/05 
1:002:30pm 
Guy Kindler 
New Explicit Constructions of Randomness Extractors
from Weak Sources, and of Bipartite Ramsey Graphs

BarakKindlerSudakov ShaltielWigderson 05

04/22/05 
1:002:30pm 
Tal Malkin 
Mercurial Commitments with Applications to ZeroKnowledge Sets

ChaseHealyLysyanskaya MalkinReyzin 05

04/20/05 
3:305:00pm 
Guy Rothblum 
The Complexity of Online Memory Checking 
NaorRothblum 05 
04/15/05 
9:30am4:10pm 
Theory Day 
Theory Day @ Columbia 
Program 
04/08/05 
1:002:30pm 
Nelly Fazio

Hierarchical Identity Based Encryption with Constant Size Ciphertext

BonehBoyenGoh '05

04/01/05 
1:002:30pm 
Aleksandr Yampolskiy

Spreading rumors quietly and the subgroup escape problem

AspnesDiamadiGjosteen PeraltaYampolskiy '05

03/11/05 
1:002:30pm 
Yael Tauman Kalai 
Concurrent General Composition of Secure Protocols in the Timing Model

KalaiLindellPrabhakaran '05

02/25/05 
1:002:30pm 
Adam Smith 
Toward Privacy in Public Databases

Chawla, Dwork, McSherry, Smith, Wee '05

02/17/05 
3:305:00pm 
Yevgeniy Dodis 
On the (non)Universality of the OneTime Pad

DodisSpencer '02

02/04/05 
1:002:30pm 
Michael Freedman 
Keyword Search and Oblivious Pseudorandom Functions

Freedman, Ishai, Pinkas, Reingold '05

01/28/05 
1:002:30pm 
Nenad Dedić 
Upper and Lower Bounds on BlackBox Steganography

DedićItkisReyzinRussell '05

01/14/05 
1:002:30pm 
Masayuki Abe 
TagKEM/DEM: A New Framework for Hybrid Encryption 
AbeGennaroKurosawa

12/10/04 
1:002:30pm 
Juan Garay 
Resource Fairness and Composability of Cryptographic Protocols 
GarayMacKenzie PrabhakaranYang '04

12/03/04 
1:002:30pm 
Shai Halevi 
Universally Composable PasswordBased Key Exchange 
CanettiHaleviKatz LindellMacKenzie '04

11/26/04 
1:002:30pm 
Stefan Wolf 
Oblivious Transfer Is Symmetric 
Wolf Wullschleger '04

11/19/04 
9:30am4:10pm 
Theory Day 
Theory Day @ NYU 
Program 
11/12/04 
1:303:00pm 
Zhiqiang Yang 
PrivacyPreserving Bayesian
Network Structure Computation on Distributed Heterogeneous Data 
Wright
Yang 04

11/05/04 
1:303:00pm 
Nelly Fazio 
ChosenCiphertext Security of
Multiple Encryption 
Dodis Katz 05

10/22/04 
2:153:30pm 
Giovanni Di Crescenzo 
ConstantRound Resettable
Zero Knowledge with Concurrent Soundness in the Bare PublicKey
Model 
Di Crescenzo
Persiano Visconti 04

10/08/04 
2:003:30pm 
Victor Shoup

A Note on an Encryption Scheme of Kurosawa and Desmedt 
Gennaro Shoup 04
Kurosawa
Desmedt 04

10/01/04 
1:303:00pm 
Alex
Dent 
Plaintext Awareness 
Bellare
Rogaway 94
Bellare et al. 98
Bellare Palacio 04

09/24/04 
2:003:30pm 
Carl Bosley 
Fuzzy
Identity Based Encryption 
Sahai Waters 04 
09/17/04 
11:30am12:30pm 
Yevgeniy Dodis 
Basing
Cryptography on Biometrics and Other Noisy Data 
Dodis et al. 04 
09/10/04 
1:002:30pm 
Prashant Puniya 
Exact security of LubyRackoff 
Patarin 04 
08/20/04 
1:302:30pm 
Arial Elbaz 
Improved Randomness Extraction from Two Random Sources 
Dodis et al 04 
08/8/04 
1:302:30pm 
Adi Gottlieb 
On WorstCase to AverageCase Reductions for NP Problems 
Bogdanov Trevisan 03 
07/30/04 
1:302:30pm 
Victor Shoup 
A survey of public key encryption 

07/24/04 
1:002:30pm 
Prashant Puniya 
BlackBox Composition Does Not Imply Adaptive Security

Myers 04 
07/16/04 
1:303:00pm 
Delaram Kahrobaei 
Polycyclic Groups: A new Platform for Cryptology?

Abstract

07/09/04 
1:303:00pm 
Shabsi Walfish 
Short Group Signatures

Boneh Boyen Shacham 04 
06/25/04 
1:303:00pm 
Danny Harnik 
ConstantRound Oblivious Transfer in the
Bounded Storage Model 
Abstract 
06/18/04 
1:303:00pm 
Victor Shoup 
Efficient SelectiveID Secure Identity Based
Encryption Without Random Oracles 
Boneh Boyen 04 
06/11/04 
2:003:00pm 
Alensandr Yampolsky 
Short Signatures Without Random Oracles

Boneh Boyen 04

05/11/04 
1:002:00pm 
Rafeal Pass 
Bounded Concurrent Secure MultiParty Computation with a Dishonest Majority

Pass 04

04/30/04 
1:303:00pm 
Antonio Nicolosi 
Anonymous Identification in AdHoc Groups 

04/23/04 
1:303:00pm 
Yuval Ishai 
Batch Codes and Amortized PIR 

04/16/04 
1:303:00pm 
Adi Akavia 
Proving HardCore Predicates Using List Decoding


04/09/04 
1:303:00pm 
Manoj Prabhakarn 
New Notions of Security: Universal Composability without Trusted Setup

Prabhakarn Sahai 04

04/02/04 
1:303:00pm 
Hugo Krawczyk 
Randomness Extraction via Common Pseudorandom Functions and
Its Application to the Hashed DiffieHellman Transform

Abstract 
03/26/04 
1:303:00pm 
Boaz Barak 
Extracting Randomness from Few Independent Sources

Abstract 
03/19/04 
1:303:00pm 
Stefan Wolf 
Quantum Entanglement from an InformationTheoretic Viewpoint

Abstract 
03/12/04 
1:002:30pm 
Aggelos Kiayias 
Group Signatures: Provable Security, Efficient Constructions
and Anonymity from TrapdoorHolders 
Kiayias Yung 04 
03/05/04 
1:303:00pm 
Silvio Micali 
ZeroKnowledge Sets 
Micali Rabin Kilian 04

02/27/04 
1:303:00pm 
Tal Malkin 
A Quantitative Approach to Reductions in Secure Computation 
Beimel Malkin 04

02/13/04 
1:303:00pm 
Birgit Pfitzman 
Justifying FormalMethod Abstractions of Cryptography: A provably secure DolevYao model 
Backes Pfitzmann Waidner 03,
Backes Pfitzmann 03

02/06/04 
1:002:30pm 
Roberto Oliveria 
Blackbox Separation Results among Cryptographic Primitives 
Simon 95,
ImpagliazzoRudich 95

01/30/04 
1:002:30pm 
Yehuda Lindell 
The Security of Protocols in Modern Network Settings 
Lindell 03 
01/23/04 
1:002:30pm 
Benny Pinkas 
Private analysis of data sets 
Abstract 
12/19/03 
1:002:30pm 
Ke Yang 
Secure MPC
with Faulty Majority and Complete Fairness 
Garay MacKenzie Yang 03 
12/17/03 
1:002:30pm 
Omer Reingold 
Simple Proof of the PCP Theorem 
Abstract 
12/12/03 
1:002:30pm 
Rosario Gennaro 
Multitrapdoor Commitments and their Applications 
Gennaro 03 
12/5/03 
1:002:30pm 
Phil MacKenzie 
SimulationSound Trapdoor Commitments 
MacKenzie Yang 03 
11/21/03 
1:002:30pm 
Yael Tauman 
On the insecurity of the FiatShamir Paradigm 
Goldwasser Tauman 03 
11/14/03 
9:30am4:10pm 
Theory Day 
Theory Day @ NYU 
Program 
11/7/03 
1:002:30pm 
Christian Cachin 
Secure Intrusiontolerant Replication on the Internet 
Web Site 
10/31/03 
1:002:30pm 
Jacques Stern 
When provable security meets number theory 
Abstract 
10/24/03 
1:002:30pm 
Misha Alekhnovich 
More on Average case vs. approximation complexity 
Alekhnovich 03 
10/17/03 
1:002:30pm 
Siddhartha Annapureddy 
On the (Im)possibility of Program Obfuscation 
Barak et al 01 
10/10/03 
1:002:30pm 
Rafael Pass 
BoundedConcurrent Secure TwoParty Computation
in a Constant Number of Rounds 
Pass Rosen 03 
10/3/03 
1:002:30pm 
Victor Shoup 
Proving Properties on Committed Integers 
Damgard Fujisaki 01,
Camenisch Shoup 02

9/26/03 
1:002:30pm 
Prashant Puniya 
Advances in the PRPs 
Ramzan Reyzin 00 
9/19/03 
1:002:30pm 
Leonid Reyzin 
Physical Observable Cryptography 
Reyzin Micali 03 
9/12/03 
1:002:30pm 
Nelly Fazio 
CertificateBased Encryption 
Gentry 03 
9/05/03 
1:002:30pm 
Roberto Oliveria 
On extracting private randomness over a public channel 
Dodis Oliviera 03

7/29/03 
2:003:30pm 
Boaz Barak 
ConstantRound CoinTossing With a Man in the
Middle or Realizing the Shared Random String Model 
Barak 02

7/23/03 
2:003:30pm 
Siddhartha Annapuredy 
ZeroKnowledge Simulation in QuasiPolynomial Time 
Pass 03

7/9/03 
2:003:30pm 
Victor Shoup 
Practical Verifiable Encryption and
Decryption of Discrete Logarithms 
Camenisch, Shoup 02

7/2/03 
1:453:15pm 
Rosario Gennaro 
A Framework for Passwordbased Authenticated Key Exchange 
Gennaro, Lindell 03

6/25/03 
2:003:30pm 
Carl Bosley 
Aggregate and Verifiably Encrypted Signatures from
Bilinear Maps 
Boneh, Gentry, Lynn, Shacham 02

6/18/03 
2:003:30pm 
Ke Yang 
Strengthening ZeroKnowledge Protocols using Signatures 
Garay, MacKenzie, Yang 03

6/11/03 
2:003:30pm 
Shabsi Walfish 
Plaintext Awareness via Key Registration 
Herzog, Liskov, Micali 03

6/05/03 
3:305:00pm 
David Chaum 
SecretBallot Receipts and Transparent Integrity 
VReceipt page

5/28/03 
2:003:30pm 
Marc Waldman 
Security Entanglements (Timeweave and Dagster) 
Maniatis, Baker 2002,
Stubblefield, Wallach, 2002

5/21/03 
1:002:30pm 
Siddhartha Annapureddy 
ConstantRound NonBlackbox ZeroKnowledge Proofs for NP 
Barak 2001

4/25/03 
1:002:30pm 
Roberto Oliveira 
On Constructing Locally Computable
Extractors and Cryptosystems in the Bounded Storage Model 
Vadhan 2002

4/18/03 
1:002:30pm 
Petar Maymounkov 
Online Codes 
Maymounkov 2002 PS

4/11/03 
1:002:30pm 
Jan Camenisch 
Protocols Based on the Strong RSA Assumption for Privacy 
Camenisch, Lysyanskaya 2002 PS
Camenisch, Lysyanskaya 2001

4/4/03 
1:002:30pm 
Victor Shoup 
Elementary PolyTime Primality Test 
Agrawal, Kayal, Saxena

4/28/03 
1:003:00pm 
Siddhartha Annapureddy 
Concurrent ZK 
Micciancio, Petrank 2002
Garay, MacKenzie, Yang 2003

3/12/03 
1:303:00pm 
Antonio Nicolosi 
Dynamic Accumulators 
Camenisch, Lysyanskaya 2001

3/7/03 
1:003:00pm 
Govind Jajoo 
Ring Signatures 
Rivest, Shamir, Tauman 2001
Bresson, Stern, Szydlo 2002
Naor 2001

2/28/03 
1:003:00pm 
Nelly Fazio 
An Efficient System for
Nontransferable Anonymous Credentials with Optional Anonymity
Revocation 
Camenisch, Lysyanskaya 2001

2/21/03 
1:00pm3:00pm 
Aggelos Kiayias 
Fair Group Signatures and their Applications 
Ateniese, Camenisch, Joye, Tsudik 2000
Kiayias, Tsiounis, Yung 2003

2/14/03 
1:003:00pm 
Yevgeniy Dodis 
Key Insulated Security 
Dodis, Katz, Xu, Yung 2002
Dodis, Katz, Xu, Yung 2003

2/7/03 
1:003:00pm 
Victor Shoup 
Generating random factored numbers, easily 
Kalai 2002

1/31/03 
1:303:30pm 
Anca Ivan 
Proxy Cryptography Revisited 
Ivan, Dodis 2003

1/24/03 
12:452:45pm 
Shabsi Walfish 
Universal padding schemes for RSA 
Coron, Joye, Naccache, Paillier 2002

12/6/02 
10:00am12:00pm 
Irit Dinur 
On the Privacy of Statistical Databases 
Dinur, Nissim 2002

11/22/02 
1:30pm3: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:30am1:30pm 
Nelly Fazio 
Public Key Broadcast Encryption for Stateless Receivers 
Dodis, Fazio 2002
Naor, Naor, Lotspiech

11/8/02 
1:30pm3:30pm 
Yevgeniy Dodis 
Efficient Construction of (Distributed) Verifiable Random Functions 
Dodis 2002

11/1/02 
1:30pm3:30pm 
Roberto Oliveira 
How to Fool an Unbounded Adversary with a Short Key 
Russell, Wang 2002 (PS)
(PDF)

10/25/02 
1:30pm3:30pm 
Markus Jakobsson 
Fractal Traversal of Merkle Trees 
Jakobsson 2002
Coppersmith, Jakobsson 2002

10/18/02 
10:00am12:00pm 
Aggelos Kiayias 
Evoting based on Homomorphic Encryption 
Cramer, Gennaro, Schoenmakers 1997
Damgard, Jurks 2001
Kiayias, Yung 2001

10/11/02 
10:00am12:00pm 
Nelly Fazio 
Provably Secure Steganography 
Hopper, Langford, Ahn 2002

10/4/02 
10:00am12:00pm 
Michael Freedman 
Tweakable Block Ciphers 
Liskov, Rivest, Wagner 2002
Rogaway 2002

9/27/02 
10:00am12:00pm 
Antonio Nicolosi 
TwoParty Generation Of Proactive Signature Schemes 
Nicolosi, Krohn, Dodis, Mazieres 2002

9/20/02 
10:00am12:00pm 
Anca Ivan 
Incremental Cryptography 
Bellare's incremental cryptography papers

9/13/02 
1:003:00pm 
Peter Sarnak 
Deterministic Polytime Primality Testing 
Agrawal, Kayal, Saxena 2002

9/6/02 
10:30am12:30pm 
Victor Shoup 
Optimal Asymmetric Encryption Padding 
Shoup 2000
Fujisaki, Okamoto, Pointcheval, Stern 2000
Jonsson 2002
Kobara, Imai 2002

8/28/02 
3:005:00pm 
Yevgeniy Dodis 
On the Power of ClawFree Permutations 
Dodis, Reyzin 2002

8/7/02 
3:005:00pm 
Markus Jakobsson 
Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking 
Jakobsson, Juels, Rivest 2002

7/31/02 
3:005:00pm 
David Molnar 
Homomorphic Cryptography and Homomorphic Signature Schemes 
Micali, Rivest 2002
Johnson, Molnar, Song, Wagner 2002

7/24/02 
3:005:00pm 
Shabsi Walfish 
Expanding Pseudorandom Functions; or: From KnownPlaintext Security to Chosen Plaintext Security 
Damgård, Nielsen 2002
Jutla 2000
Halevi 2001

7/17/02 
3:005:00pm 
Jonathan Katz 
Efficient and NonMalleable Proofs of Plaintext Knowledge and Applications 
Katz 2002

7/10/02 
3:005:00pm 
Aggelos Kiayias 
Noisy Polynomials And Their Use In Cryptography 
Guruswami, Sudan 1998
Kiayias, Yung 2002

7/3/02 
3:005:00pm 
Antonio Nicolosi 
SiBIR: SignerBase IntrusionResilient Signatures 
Itkis, Reyzin 2002
Itkis, Reyzin 2001

6/26/02 
3:005:00pm 
Ofer Gill 
Random oracle based signature schemes and their relation to FiatShamir type signature schemes 
Bellare, Palacio 2002
Abdalla, An, Bellare, Namprempre 2002

6/20/02 
3:005:00pm 
Yevgeniy Dodis 
Unique signatures and verifiable random
functions from the DHDDH separation

Lysyanskaya 2002
Micali, Rabin, Vadhan 1999
Naor, Reingold 1997

6/12/02 
3:005:00pm 
Antonio Nicolosi 
Forward Secure Public Key Encryption + Hierarchical
IDbased Encryption 
Katz 2002
Gentry, Silverberg 2002

6/5/02 
3:005:00pm 
Nelly Fazio 
Publickey Broadcast Encryption and Traitor Tracing 
Dodis, Fazio 2002
