| Efficient robust private set intersection D Dachman-Soled, T Malkin, M Raykova, M Yung International Journal of Applied Cryptography 2 (4), 289-303, 2012 | 269 | 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 | 142 | 2020 |
| Geometrical characteristics of regular polyhedra: application to EXAFS studies of nanoclusters D Glasner, AI Frenkel AIP Conference Proceedings 882 (1), 746-748, 2007 | 85 | 2007 |
| 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 | 84 | 2018 |
| Improved non-committing encryption with applications to adaptively secure protocols SG Choi, D Dachman-Soled, T Malkin, H Wee Advances in Cryptology–ASIACRYPT 2009: 15th International Conference on the …, 2009 | 83 | 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: 10th Theory of Cryptography Conference, TCC 2013 …, 2013 | 74 | 2013 |
| 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, 172-201, 2018 | 72* | 2018 |
| Simple, black-box constructions of adaptively secure protocols SG Choi, D Dachman-Soled, T Malkin, H Wee Theory of Cryptography: 6th Theory of Cryptography Conference, TCC 2009, San …, 2009 | 71 | 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 | 66 | 2011 |
| Adaptively secure, universally composable, multiparty computation in constant rounds D Dachman-Soled, J Katz, V Rao Theory of Cryptography: 12th Theory of Cryptography Conference, TCC 2015 …, 2015 | 64 | 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 | 60 | 2020 |
| Non-malleable codes for bounded depth, bounded fan-in circuits M Ball, D Dachman-Soled, M Kulkarni, T Malkin Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016 | 60 | 2016 |
| Efficient password authenticated key exchange via oblivious transfer R Canetti, D Dachman-Soled, V Vaikuntanathan, H Wee Public Key Cryptography–PKC 2012: 15th International Conference on Practice …, 2012 | 56 | 2012 |
| 10-round Feistel is indifferentiable from an ideal cipher D Dachman-Soled, J Katz, A Thiruvengadam Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016 | 46 | 2016 |
| Differentially-private multi-party sketching for large-scale statistics SG Choi, D Dachman-Soled, M Kulkarni, A Yerukhimovich Proceedings on Privacy Enhancing Technologies, 2020 | 45 | 2020 |
| 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 | 45 | 2018 |
| Secure efficient multiparty computing of multivariate polynomials and applications D Dachman-Soled, T Malkin, M Raykova, M Yung Applied Cryptography and Network Security: 9th International Conference …, 2011 | 45 | 2011 |
| 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 | 44 | 2018 |
| Distribution-free testing lower bound for basic boolean functions D Glasner, RA Servedio Theory of Computing 5 (1), 191-216, 2009 | 43 | 2009 |
| Adaptive and concurrent secure computation from new adaptive, non-malleable commitments D Dachman-Soled, T Malkin, M Raykova, M Venkitasubramaniam Advances in Cryptology-ASIACRYPT 2013: 19th International Conference on the …, 2013 | 40 | 2013 |
