Eran Omri

Dept. of Computer Science, Bar Ilan University, Ramat Gan, Israel

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers43 papers

Sort

By YearBy Citation

MPC with Friends and Foes

Bar Alon,Eran Omri, Anat Paskin-Cherniavsky

IACR Cryptol. ePrint Arch., (2020): 701

Bibtex

On the Power of an Honest Majority in Three-Party Computation Without Broadcast

Bar Alon,Ran Cohen,Eran Omri, Tom Suad

IACR Cryptol. ePrint Arch., (2020): 1170

Bibtex

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols

Iftach Haitner,Kobbi Nissim,Eran Omri,Ronen Shaltiel, Jad Silbak

SIAM J. Comput., no. 6 (2020): 1041-1082

EIBibtex

${\varvec{1/p}}$1/p -Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds

Amos Beimel,Yehuda Lindell,Eran Omri,Ilan Orlov

Journal of Cryptology, pp.1-73, (2020)

Bibtex

Turbospeedz: Double Your Online SPDZ! Improving SPDZ using Function Dependent Preprocessing

Aner Ben-Efraim,Eran Omri

IACR Cryptology ePrint Archive, (2019): 80

Cited by2EIBibtex

Turbospeedz: Double Your Online SPDZ! Improving SPDZ Using Function Dependent Preprocessing

Aner Ben-Efraim, Michael Nielsen,Eran Omri

Lecture Notes in Computer Science, (2019): 530-549

Bibtex

From Fairness to Full Security in Multiparty Computation

Ran Cohen,Iftach Haitner,Eran Omri, Lior Rotem

IACR Cryptology ePrint Archive, (2019): 1344

EIBibtex

Computational Two-Party Correlation

Iftach Haitner,Kobbi Nissim,Eran Omri,Ronen Shaltiel, Jad Silbak

Electronic Colloquium on Computational Complexity (ECCC), (2018)

Cited by4EIBibtex

Characterization of Secure Multiparty Computation Without Broadcast

Ran Cohen,Iftach Haitner,Eran Omri, Lior Rotem

J. Cryptology, no. 2 (2018): 587-609

Cited by18EIBibtex

On the Complexity of Fair Coin Flipping

Iftach Haitner,Nikolaos Makriyannis,Eran Omri

Electronic Colloquium on Computational Complexity (ECCC), (2018)

Cited by4EIBibtex

From Fairness to Full Security in Multiparty Computation

Ran Cohen,Iftach Haitner,Eran Omri, Lior Rotem

SCN, pp.216-234, (2018)

Cited by3EIBibtex

Computational Two-Party Correlation - A Dichotomy for Key-Agreement Protocols

Iftach Haitner,Kobbi Nissim,Eran Omri,Ronen Shaltiel, Jad Silbak

2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), pp.136.0-147, (2018)

Cited by3EIBibtex

Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling

Amos Beimel,Iftach Haitner,Nikolaos Makriyannis,Eran Omri

2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), pp.838.0-849, (2018)

Cited by10EIBibtex

Completeness for symmetric two-party functionalities - revisited

Yehuda Lindell,Eran Omri,Hila Zarosim

J. Cryptology, no. 3 (2018): 671-697

Cited by1EIBibtex

Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filters

Roi Inbar,Eran Omri,Benny Pinkas

SCN, pp.235-252, (2018)

Cited by1EIBibtex

Concrete Efficiency Improvements for Multiparty Garbling with an Honest Majority

Aner Ben-Efraim,Eran Omri

LATINCRYPT, pp.289-308, (2017)

Cited by5EIBibtex

Efficient Scalable Constant-Round MPC via Garbled Circuits

Aner Ben-Efraim,Yehuda Lindell,Eran Omri

ASIACRYPT, (2017): 471-498

Cited by8EIBibtex

Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling

Amos Beimel,Iftach Haitner,Nikolaos Makriyannis,Eran Omri

Electronic Colloquium on Computational Complexity (ECCC), (2017): 168

EIBibtex

Rainbow Matchings and Algebras of Sets

Gabriel Nivasch,Eran Omri

Graphs and Combinatorics, no. 2 (2017): 473-484

Bibtex

Rainbow matchings and algebras of sets

Gabriel Nivasch,Eran Omri

Graphs and Combinatorics, no. 2 (2017): 473-484

Cited by3EIBibtex

View All

Base Info Papers Patents Projects