Dachman-Soled, Dana
Maryland Cybersecurity Center
UMIACS
EDUCATION
- B.A. in Math and Computer Science from Yeshiva University
- Ph.D. in Computer Science from Columbia University
BACKGROUND
Dana Dachman-Soled is an associate professor in the Department of Electrical and Computer Engineering with a joint appointment in the University of Maryland Institute for Advanced Computer Studies. She is a core faculty member in the Maryland Cybersecurity Center and is also affiliated with the Institute for Systems Research.
Dachman-Soled’s research interests are in cryptography, complexity theory and security. She has broad interests in cryptography including security against physical attacks, post-quantum cryptography, secure multiparty computation, and black-box complexity. Dachman-Soled is also interested in property testing of Boolean functions and cryptographic hardness of learning.
She is supported in part by an NSF CAREER award, a Ralph E. Powe Junior Faculty Enhancement award, a financial assistance award from the National Institute of Standards and Technology and a research partnership award from Cisco. Dachman-Soled is also the recipient of a Summer 2016 Research and Scholarship (RASA) award. Prior to joining University of Maryland, she spent two years as a postdoc at Microsoft Research New England.
Dachman-Soled completed her doctorate in computer science at Columbia University.
HONORS AND AWARDS
- George Corcoran Award for Faculty (2018)
- Summer Research and Scholarship Award (RASA) (2016)
- ORAU Ralph E. Powe Junior Faculty Enhancement Award (2015)
- NSF CAREER Award (2015)
- Recipient of the FF SEAS Presidential Fellowship (4-year fellowship)
- Cryptography
- Security
- Complexity Theory
- Towards Non-Black-Box Separations of Public Key Encryption and One Way Functioni
D. Dachman-Soled
TCC B-2016
- Non-Malleable Codes for Bounded Depth, Bounded Fan-in Circuits
M. Ball, D. Dachman-Soled, M. Kulkarni, T. Malkin
Eurocrypt 2016.
- 10-Round Feistel is Indifferentiable from an Ideal Cipher
D. Dachman-Soled, J. Katz, A. Thiruvengadam
Eurocrypt 2016
- Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness
D. Dachman-Soled, C. Liu, C. Papamanthou, E. Shi, U. Vishkin
Asiacrypt 2015
- Leakage-Resilient Circuits Revisited -- Optimal Number of Computing Components without Leak-free Hardware
D. Dachman-Soled, F. H. Liu, H. S. Zhou
Eurocrypt 2015
- Locally Decodable and Updatable Non-Malleable Codes and Their Applications
D. Dachman-Soled, F. H. Liu, E. Shi, H. S. Zhou
TCC 2015.
- Adaptively Secure, Universally Composable, Multi-Party Computation in Constant Rounds
D. Dachman-Soled, J. Katz, V. Rao
TCC 2015.
- Approximate resilience, monotonicity, and the complexity of agnostic learning
D. Dachman-Soled, V. Feldman, L.Y. Tang, A. Wan, K. Wimmer
SODA 2015.
- Feasibility and Infeasibility of Secure Computation with Malicious PUFs
D. Dachman-Soled, N. Fleischhacker, J. Katz, A. Lysyanskaya, D. Schröder
Crypto 2014.
- Leakage-Tolerant Computation with Input-Independent Preprocessing
N. Bitansky, D. Dachman-Soled, H. Lin
Crypto 2014.
- A Black-Box Construction of a CCA2 Encryption Scheme from a Plaintext Aware Encryption Scheme
D. Dachman-Soled
PKC 2014.
- On Minimal Assumptions for Sender-Deniable Public Key Encryption
D. Dachman-Soled
PKC 2014.
- Securing Circuits Against Constant-Rate Tampering
D. Dachman-Soled, Y. T. Kalai
CRYPTO 2012.
- Black-Box Construction a Non-Malleable Encryption Scheme from Any Semantically Secure One
S.G. Choi, D. Dachman-Soled, T. Malkin and H. Wee
TCC, 2008.