Dana Dachman-Soled
Dana Dachman-Soled
Associate Professor, Department of Electrical and Computer Engineering, University of Maryland
Verified email at umd.edu - Homepage
Title
Cited by
Cited by
Year
Efficient robust private set intersection
D Dachman-Soled, T Malkin, M Raykova, M Yung
International Journal of Applied Cryptography 2 (4), 289-303, 2012
2122012
Improved non-committing encryption with applications to adaptively secure protocols
SG Choi, D Dachman-Soled, T Malkin, H Wee
International Conference on the Theory and Application of Cryptology and …, 2009
702009
Geometrical characteristics of regular polyhedra: application to EXAFS studies of nanoclusters
D Glasner, AI Frenkel
AIP Conference Proceedings 882 (1), 746-748, 2007
702007
Simple, black-box constructions of adaptively secure protocols
SG Choi, D Dachman-Soled, T Malkin, H Wee
Theory of Cryptography Conference, 387-402, 2009
642009
A black-box construction of non-malleable encryption from semantically secure encryption
SG Choi, D Dachman-Soled, T Malkin, H Wee
Journal of Cryptology 31 (1), 172-201, 2018
63*2018
Why “fiat-shamir for proofs” lacks a proof
N Bitansky, D Dachman-Soled, S Garg, A Jain, YT Kalai, A López-Alt, ...
Theory of cryptography conference, 182-201, 2013
492013
On the black-box complexity of optimally-fair coin tossing
D Dachman-Soled, Y Lindell, M Mahmoody, T Malkin
Theory of Cryptography Conference, 450-467, 2011
482011
Locally decodable and updatable non-malleable codes and their applications
D Dachman-Soled, FH Liu, E Shi, HS Zhou
Journal of Cryptology 33 (1), 319-355, 2020
462020
Non-malleable codes for bounded depth, bounded fan-in circuits
M Ball, D Dachman-Soled, M Kulkarni, T Malkin
Annual International Conference on the Theory and Applications of …, 2016
442016
Adaptively secure, universally composable, multiparty computation in constant rounds
D Dachman-Soled, J Katz, V Rao
Theory of Cryptography Conference, 586-613, 2015
412015
Efficient password authenticated key exchange via oblivious transfer
R Canetti, D Dachman-Soled, V Vaikuntanathan, H Wee
International Workshop on Public Key Cryptography, 449-466, 2012
412012
Non-malleable Codes from Average-Case Hardness: , Decision Trees, and Streaming Space-Bounded Tampering
M Ball, D Dachman-Soled, M Kulkarni, T Malkin
Annual International Conference on the Theory and Applications of …, 2018
302018
Securing circuits against constant-rate tampering
D Dachman-Soled, YT Kalai
Annual Cryptology Conference, 533-551, 2012
302012
Distribution-free testing lower bound for basic boolean functions
D Glasner, RA Servedio
Theory of Computing 5 (1), 191-216, 2009
282009
10-round feistel is indifferentiable from an ideal cipher
D Dachman-Soled, J Katz, A Thiruvengadam
Annual International Conference on the Theory and Applications of …, 2016
272016
Adaptive and concurrent secure computation from new adaptive, non-malleable commitments
D Dachman-Soled, T Malkin, M Raykova, M Venkitasubramaniam
International Conference on the Theory and Application of Cryptology and …, 2013
272013
Leakage-tolerant computation with input-independent preprocessing
N Bitansky, D Dachman-Soled, H Lin
Annual Cryptology Conference, 146-163, 2014
262014
Computational extractors and pseudorandomness
D Dachman-Soled, R Gennaro, H Krawczyk, T Malkin
Theory of Cryptography Conference, 383-403, 2012
262012
Non-malleable codes for small-depth circuits
M Ball, D Dachman-Soled, S Guo, T Malkin, LY Tan
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
242018
Secure efficient multiparty computing of multivariate polynomials and applications
D Dachman-Soled, T Malkin, M Raykova, M Yung
International Conference on Applied Cryptography and Network Security, 130-146, 2011
242011
The system can't perform the operation now. Try again later.
Articles 1–20