Homepage of David Cash

C. David Cash

I am a postdoc in the Cryptography Research Group at the IBM T.J. Watson Research Center in Hawthorne, NY.

I will join the Computer Science Department at Rutgers University as an Assistant Professor starting Fall 2012.

Previously, I was a Postdoc in the Mathematics Department at Ruhr-University Bochum, Germany, working with Eike Kiltz, and a Postdoctoral Scholar in the Department of Computer Science and Engineering at the University of California, San Diego, working with Mihir Bellare. Before that, I completed my Ph.D. in Computer Science at Georgia Tech under the superb direction of Alexandra Boldyreva.

Email: cdc [at] gatech.edu

Mailing address:
IBM T.J. Watson Research Center
19 Skyline Drive
Hawthorne, NY 10532

Research

Interests: Cryptography, Information Security, Theoretical Computer Science

I am serving on the following program committees:

ASIACRYPT 2012
EUROCRYPT 2012
AFRICACRYPT 2011
ProvSec 2010

Peer-Reviewed Conference Publications

New Definitions and Separations for Circular Security
David Cash, Matthew Green, Susan Hohenberger
PKC 2012 (to appear).

Cryptography Secure Against Related-Key Attack
Mihir Bellare, David Cash, Rachel Miller
ASIACRYPT 2011. [pdf]

Ciphers that Securely Encipher their own Keys
Mihir Bellare, David Cash, Sriram Keelveedhi
ACM CCS 2011. [pdf]

Efficient Authentication from Hard Learning Problems
Eike Kiltz, Krzysztof Pietrzak, David Cash, Abhishek Jain, Daniele Venturi
EUROCRYPT 2011. -- Best paper award

Pseudorandom Functions and Permutations Provably Secure Against Related-Key Attacks
Mihir Bellare, David Cash
CRYPTO 2010. [pdf]

Cryptographic Agility and Its Relation to Circular Encryption
Tolga Acar, Mira Belenkiy, Mihir Bellare, David Cash
EUROCRYPT 2010. [pdf]

Bonsai Trees, or How to Delegate a Lattice Basis
David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert
EUROCRYPT 2010. [pdf] -- Best paper award, Invited to J. Cryptology (one of 3 papers selected from Eurocrypt 2010)

Foundations of Non-Malleable Hash and One-Way Functions
Alexandra Boldyreva, David Cash, Marc Fischlin, Bogdan Warinschi
ASIACRYPT 2009. [pdf]

Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Benny Applebaum, David Cash, Chris Peikert, Amit Sahai
CRYPTO 2009. [pdf]

Minimal Information Disclosure with Efficiently Verifiable Credentials
David Bauer, Douglas Blough, David Cash
DIM 2008 (co-located with CCS 2008).

The Twin Diffie-Hellman Problem and Applications
David Cash, Eike Kiltz, Victor Shoup
EUROCRYPT 2008. [pdf] -- Invited to J. Cryptology (one of 4 papers selected from Eurocrypt 2008)

Intrusion-Resilient Authenticated Key Exchange in the Bounded Retrieval Model without Random Oracles
David Cash, Yan Zong Ding, Yevgeniy Dodis, Wenke Lee, Richard Lipton, Shabsi Walfish
TCC 2007. [pdf]

Journal Publications

Bonsai Trees, or How to Delegate a Lattice Basis
David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert
Journal of Cryptology (to a

The Twin Diffie-Hellman Problem and Applications
David Cash, Eike Kiltz, Victor Shoup
Journal of Cryptology 22(4):470-504, 2009. (Journal version of the Eurocrypt 2008 paper)

Manuscripts/Working Papers

How to Delegate a Lattice Basis
David Cash, Dennis Hofheinz, Eike Kiltz
[pdf] (Merged to form the Eurocrypt 2010 paper.)

wordpress analytics