| Efficient robust private set intersection D Dachman-Soled, T Malkin, M Raykova, M Yung International Journal of Applied Cryptography 2 (4), 289-303, 2012 | 237 | 2012 |
| 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 | 80 | 2009 |
| Geometrical characteristics of regular polyhedra: application to EXAFS studies of nanoclusters D Glasner, AI Frenkel AIP Conference Proceedings 882 (1), 746-748, 2007 | 71 | 2007 |
| 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 | 68* | 2018 |
| Simple, black-box constructions of adaptively secure protocols SG Choi, D Dachman-Soled, T Malkin, H Wee Theory of Cryptography Conference, 387-402, 2009 | 67 | 2009 |
| 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 | 60 | 2011 |
| 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 | 57 | 2016 |
| Adaptively secure, universally composable, multiparty computation in constant rounds D Dachman-Soled, J Katz, V Rao Theory of Cryptography Conference, 586-613, 2015 | 56 | 2015 |
| 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 | 55 | 2020 |
| 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 | 55 | 2013 |
| 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 | 49 | 2018 |
| 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 | 48 | 2020 |
| 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 | 43 | 2012 |
| 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 | 40 | 2018 |
| 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 | 38 | 2018 |
| 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 | 36 | 2016 |
| Distribution-free testing lower bound for basic boolean functions D Glasner, RA Servedio Theory of Computing 5 (1), 191-216, 2009 | 35 | 2009 |
| Leakage-tolerant computation with input-independent preprocessing N Bitansky, D Dachman-Soled, H Lin Annual Cryptology Conference, 146-163, 2014 | 34 | 2014 |
| Can optimally-fair coin tossing be based on one-way functions? D Dachman-Soled, M Mahmoody, T Malkin Theory of Cryptography Conference, 217-239, 2014 | 34 | 2014 |
| 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 | 34 | 2013 |
