| Efficient robust private set intersection D Dachman-Soled, T Malkin, M Raykova, M Yung International Journal of Applied Cryptography 2 (4), 289-303, 2012 | 293 | 2012 |
| LWE with side information: Attacks and concrete security estimation D Dachman-Soled, L Ducas, H Gong, M Rossi Annual international cryptology conference, 329-358, 2020 | 222 | 2020 |
| Security analysis of deep neural networks operating in the presence of cache side-channel attacks S Hong, M Davinroy, Y Kaya, SN Locke, I Rackow, K Kulda, ... arXiv preprint arXiv:1810.03487, 2018 | 118 | 2018 |
| Geometrical characteristics of regular polyhedra: application to EXAFS studies of nanoclusters D Glasner, AI Frenkel AIP Conference Proceedings 882 (1), 746-748, 2007 | 100 | 2007 |
| 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 | 89 | 2009 |
| 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 | 83 | 2013 |
| Simple, black-box constructions of adaptively secure protocols SG Choi, D Dachman-Soled, T Malkin, H Wee Theory of Cryptography Conference, 387-402, 2009 | 76 | 2009 |
| When frodo flips: End-to-end key recovery on frodokem via rowhammer M Fahr Jr, H Kippen, A Kwong, T Dang, J Lichtinger, D Dachman-Soled, ... Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications …, 2022 | 75 | 2022 |
| 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 | 74* | 2018 |
| Adaptively secure, universally composable, multiparty computation in constant rounds D Dachman-Soled, J Katz, V Rao Theory of Cryptography Conference, 586-613, 2015 | 70 | 2015 |
| 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 | 68 | 2011 |
| 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 | 64 | 2012 |
| 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 | 63 | 2016 |
| Locally decodable and updatable non-malleable codes and their applications D Dachman-Soled, FH Liu, E Shi, HS Zhou Theory of Cryptography Conference, 427-450, 2015 | 63 | 2015 |
| 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 | 56 | 2016 |
| 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 | 53 | 2011 |
| 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 | 51 | 2018 |
| Differentially-private multi-party sketching for large-scale statistics SG Choi, D Dachman-Soled, M Kulkarni, A Yerukhimovich Proceedings on Privacy Enhancing Technologies, 2020 | 50 | 2020 |
| 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 | 48 | 2018 |
| How to 0wn nas in your spare time S Hong, M Davinroy, Y Kaya, D Dachman-Soled, T Dumitraş International Conference on Learning Representations (ICLR), 2020 | 47 | 2020 |
