| Distributed private data analysis: Simultaneously solving how and what A Beimel, K Nissim, E Omri Advances in Cryptology–CRYPTO 2008: 28th Annual International Cryptology …, 2008 | 234 | 2008 |
| Optimizing semi-honest secure multiparty computation for the internet A Ben-Efraim, Y Lindell, E Omri Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016 | 112 | 2016 |
| Protocols for multiparty coin toss with a dishonest majority A Beimel, E Omri, I Orlov Journal of Cryptology 28 (3), 551-600, 2015 | 85 | 2015 |
| Efficient scalable multiparty private set-intersection via garbled bloom filters R Inbar, E Omri, B Pinkas International conference on security and cryptography for networks, 235-252, 2018 | 84 | 2018 |
| 1/p-secure multiparty computation without honest majority and the best of both worlds A Beimel, Y Lindell, E Omri, I Orlov Advances in Cryptology–CRYPTO 2011, 277-296, 2011 | 66 | 2011 |
| Turbospeedz: Double your online SPDZ! Improving SPDZ using function dependent preprocessing A Ben-Efraim, M Nielsen, E Omri Applied Cryptography and Network Security: 17th International Conference …, 2019 | 58 | 2019 |
| Complete characterization of fairness in secure two-party computation of boolean functions G Asharov, A Beimel, N Makriyannis, E Omri Theory of Cryptography Conference, 199-228, 2015 | 56 | 2015 |
| Psimple: Practical multiparty maliciously-secure private set intersection A Ben-Efraim, O Nissenbaum, E Omri, A Paskin-Cherniavsky Proceedings of the 2022 ACM on Asia Conference on Computer and …, 2022 | 43 | 2022 |
| Limits on the usefulness of random oracles I Haitner, E Omri, H Zarosim Journal of Cryptology 29 (2), 283-335, 2016 | 42 | 2016 |
| A practical application of differential privacy to personalized online advertising Y Lindell, E Omri Cryptology ePrint Archive, 2011 | 37 | 2011 |
| Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious B Alon, E Omri Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016 | 34 | 2016 |
| Coin flipping with constant bias implies one-way functions I Haitner, E Omri SIAM Journal on Computing 43 (2), 389-409, 2014 | 34 | 2014 |
| Efficient scalable constant-round MPC via garbled circuits A Ben-Efraim, Y Lindell, E Omri International Conference on the Theory and Application of Cryptology and …, 2017 | 31 | 2017 |
| Characterization of secure multiparty computation without broadcast R Cohen, I Haitner, E Omri, L Rotem Journal of Cryptology 31, 587-609, 2018 | 30 | 2018 |
| Tighter bounds on multiparty coin flipping via augmented weak martingales and differentially private sampling A Beimel, I Haitner, N Makriyannis, E Omri SIAM Journal on Computing 51 (4), 1126-1171, 2022 | 29 | 2022 |
| MPC with friends and foes B Alon, E Omri, A Paskin-Cherniavsky Annual International Cryptology Conference, 677-706, 2020 | 23 | 2020 |
| Parallel hashing via list recoverability I Haitner, Y Ishai, E Omri, R Shaltiel Advances in Cryptology--CRYPTO 2015: 35th Annual Cryptology Conference …, 2015 | 22 | 2015 |
| Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers M Kojman, G Lee, E Omri, A Weiermann Journal of Combinatorial Theory, Series A 115 (6), 1036-1055, 2008 | 21 | 2008 |
| From fairness to full security in multiparty computation R Cohen, I Haitner, E Omri, L Rotem Journal of Cryptology 35 (1), 4, 2022 | 20* | 2022 |
| On the complexity of fair coin flipping I Haitner, N Makriyannis, E Omri Theory of Cryptography: 16th International Conference, TCC 2018, Panaji …, 2018 | 19 | 2018 |
Amos BeimelBen Gurion UniversityVerified email at bgu.ac.il
