Sotabase

Career

· Associate Professor, University of Maryland2013–
· Postdoctoral Researcher, Microsoft Research New England2011–2013
· Research Assistant, Columbia University2010–2011
· Visiting Researcher, Bar-Ilan University2009–2009
· M.Phil. in Computer Science, Columbia University2008–2010
· MS in Computer Science, Columbia University2006–2008
· PhD in Computer Science, Columbia University2006–2011
· Intern, IBM Research2006–2006
· B.A. in Mathematics and Computer Science, Yeshiva University2002–2006

Publications (86)

Efficient robust private set intersection
International Journal of Applied Cryptography · 2009
211
cited
LWE with Side Information: Attacks and Concrete Security Estimation
IACR Cryptology ePrint Archive · 2020
167
cited
Security Analysis of Deep Neural Networks Operating in the Presence of Cache Side-Channel Attacks
arXiv.org · 2018
94
cited
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
International Conference on the Theory and Application of Cryptology and Information Security · 2009
70
cited
Simple, Black-Box Constructions of Adaptively Secure Protocols
Theory of Cryptography Conference · 2009
61
cited
When Frodo Flips: End-to-End Key Recovery on FrodoKEM via Rowhammer
IACR Cryptology ePrint Archive · 2022
61
cited
Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
International Conference on the Theory and Application of Cryptographic Techniques · 2016
55
cited
Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
Theory of Cryptography Conference · 2008
53
cited
On the Black-Box Complexity of Optimally-Fair Coin Tossing
Theory of Cryptography Conference · 2011
51
cited
Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
Theory of Cryptography Conference · 2015
48
cited
Efficient Password Authenticated Key Exchange via Oblivious Transfer
International Conference on Theory and Practice of Public Key Cryptography · 2012
44
cited
Locally Decodable and Updatable Non-malleable Codes and Their Applications
Journal of Cryptology · 2015
42
cited
Differentially-Private Multi-Party Sketching for Large-Scale Statistics
IACR Cryptology ePrint Archive · 2020
38
cited
Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering
IACR Cryptology ePrint Archive · 2018
37
cited
10-Round Feistel is Indifferentiable from an Ideal Cipher
IACR Cryptology ePrint Archive · 2016
36
cited
How to 0wn NAS in Your Spare Time
arXiv.org · 2020
35
cited
Non-Malleable Codes for Small-Depth Circuits
IEEE Annual Symposium on Foundations of Computer Science · 2018
35
cited
Approximate resilience, monotonicity, and the complexity of agnostic learning
ACM-SIAM Symposium on Discrete Algorithms · 2014
32
cited
Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications
International Conference on Applied Cryptography and Network Security · 2011
32
cited
Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments
International Conference on the Theory and Application of Cryptology and Information Security · 2013
31
cited
Sotabase
Dana Dachman-Soled | Researcher Profile | Sotabase | Sotabase