Eran Omri
Eran Omri
Verifierad e-postadress på ariel.ac.il - Startsida
Titel
Citeras av
Citeras av
År
Distributed private data analysis: Simultaneously solving how and what
A Beimel, K Nissim, E Omri
Annual International Cryptology Conference, 451-468, 2008
1412008
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
582016
Protocols for multiparty coin toss with a dishonest majority
A Beimel, E Omri, I Orlov
Journal of Cryptology 28 (3), 551-600, 2015
57*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
512011
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
362015
A Practical Application of Differential Privacy to Personalized Online Advertising.
Y Lindell, E Omri
IACR Cryptol. ePrint Arch. 2011, 152, 2011
282011
Limits on the usefulness of random oracles
I Haitner, E Omri, H Zarosim
Journal of Cryptology 29 (2), 283-335, 2016
27*2016
Characterization of secure multiparty computation without broadcast
R Cohen, I Haitner, E Omri, L Rotem
Theory of Cryptography Conference, 596-616, 2016
202016
Coin flipping with constant bias implies one-way functions
I Haitner, E Omri
SIAM Journal on Computing 43 (2), 389-409, 2014
182014
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
182008
Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
B Alon, E Omri
Theory of Cryptography Conference, 307-335, 2016
172016
Tighter bounds on multi-party coin flipping via augmented weak martingales and differentially private sampling
A Beimel, I Haitner, N Makriyannis, E Omri
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
142018
Completeness for symmetric two-party functionalities: Revisited
Y Lindell, E Omri, H Zarosim
Journal of Cryptology 31 (3), 671-697, 2018
11*2018
Parallel hashing via list recoverability
I Haitner, Y Ishai, E Omri, R Shaltiel
Annual Cryptology Conference, 173-190, 2015
112015
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
102017
Classifying the phase transition threshold for Ackermannian functions
E Omri, A Weiermann
Annals of Pure and Applied Logic 158 (3), 156-162, 2009
72009
On the complexity of fair coin flipping
I Haitner, N Makriyannis, E Omri
Theory of Cryptography Conference, 539-562, 2018
62018
From fairness to full security in multiparty computation
R Cohen, I Haitner, E Omri, L Rotem
International Conference on Security and Cryptography for Networks, 216-234, 2018
62018
Concrete efficiency improvements for multiparty garbling with an honest majority
A Ben-Efraim, E Omri
International Conference on Cryptology and Information Security in Latin …, 2017
62017
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
52019
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20