Eran Omri
Eran Omri
Verified email at - Homepage
Cited by
Cited by
Distributed private data analysis: Simultaneously solving how and what
A Beimel, K Nissim, E Omri
Annual International Cryptology Conference, 451-468, 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
Protocols for multiparty coin toss with a dishonest majority
A Beimel, E Omri, I Orlov
Journal of Cryptology 28 (3), 551-600, 2015
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
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
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
Limits on the usefulness of random oracles
I Haitner, E Omri, H Zarosim
Journal of Cryptology 29 (2), 283-335, 2016
Turbospeedz: double your online SPDZ! improving SPDZ using function dependent preprocessing
A Ben-Efraim, M Nielsen, E Omri
International Conference on Applied Cryptography and Network Security, 530-549, 2019
A practical application of differential privacy to personalized online advertising
Y Lindell, E Omri
Cryptology ePrint Archive, 2011
Coin flipping with constant bias implies one-way functions
I Haitner, E Omri
SIAM Journal on Computing 43 (2), 389-409, 2014
Characterization of secure multiparty computation without broadcast
R Cohen, I Haitner, E Omri, L Rotem
Theory of Cryptography Conference, 596-616, 2016
Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
B Alon, E Omri
Theory of Cryptography Conference, 307-335, 2016
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
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
On the complexity of fair coin flipping
I Haitner, N Makriyannis, E Omri
Theory of Cryptography Conference, 539-562, 2018
Parallel hashing via list recoverability
I Haitner, Y Ishai, E Omri, R Shaltiel
Annual Cryptology Conference, 173-190, 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
Computational two-party correlation: A dichotomy for key-agreement protocols
I Haitner, K Nissim, E Omri, R Shaltiel, J Silbak
SIAM Journal on Computing 49 (6), 1041-1082, 2020
Completeness for symmetric two-party functionalities: Revisited
Y Lindell, E Omri, H Zarosim
Journal of Cryptology 31 (3), 671-697, 2018
Psimple: Practical multiparty maliciously-secure private set intersection
AB Efraim, O Nissenbaum, E Omri, A Paskin-Cherniavsky
Cryptology ePrint Archive, 2021
The system can't perform the operation now. Try again later.
Articles 1–20