Eran Omri

Orcid: 0000-0001-8928-0587

According to our database1, Eran Omri authored at least 47 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions.
SIAM J. Comput., 2024

MYao: Multiparty "Yao" Garbled Circuits with Row Reduction, Half Gates, and Efficient Online Computation.
IACR Cryptol. ePrint Arch., 2024

New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs.
IACR Cryptol. ePrint Arch., 2024

PINE: Efficient Verification of a Euclidean Norm Bound of a Secret-Shared Vector.
Proceedings of the 33rd USENIX Security Symposium, 2024

2023
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious.
J. Cryptol., July, 2023

On the Power of an Honest Majority in Three-Party Computation Without Broadcast.
J. Cryptol., July, 2023

Can Alice and Bob Guarantee Output to Carol?
IACR Cryptol. ePrint Arch., 2023

Three Party Secure Computation with Friends and Foes.
IACR Cryptol. ePrint Arch., 2023

PINE: Efficient Norm-Bound Verification for Secret-Shared Vectors.
CoRR, 2023

2022
On the complexity of fair coin flipping.
Theor. Comput. Sci., 2022

Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.
SIAM J. Comput., 2022

From Fairness to Full Security in Multiparty Computation.
J. Cryptol., 2022

On Secure Computation of Solitary Output Functionalities With and Without Broadcast.
IACR Cryptol. ePrint Arch., 2022

MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably.
IACR Cryptol. ePrint Arch., 2022

On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness.
IACR Cryptol. ePrint Arch., 2022

2021
PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection.
IACR Cryptol. ePrint Arch., 2021

Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits.
IACR Cryptol. ePrint Arch., 2021

2020
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols.
SIAM J. Comput., 2020

1/p-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds.
J. Cryptol., 2020

MPC with Friends and Foes.
IACR Cryptol. ePrint Arch., 2020

2019
Turbospeedz: Double Your Online SPDZ! Improving SPDZ using Function Dependent Preprocessing.
IACR Cryptol. ePrint Arch., 2019

Turbospeedz: Double Your Online SPDZ! Improving SPDZ Using Function Dependent Preprocessing.
Proceedings of the Applied Cryptography and Network Security, 2019

2018
Completeness for Symmetric Two-Party Functionalities: Revisited.
J. Cryptol., 2018

Characterization of Secure Multiparty Computation Without Broadcast.
J. Cryptol., 2018

Computational Two-Party Correlation.
Electron. Colloquium Comput. Complex., 2018

Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filters.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Efficient Scalable Constant-Round MPC via Garbled Circuits.
IACR Cryptol. ePrint Arch., 2017

Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling.
Electron. Colloquium Comput. Complex., 2017

Concrete Efficiency Improvements for Multiparty Garbling with an Honest Majority.
Proceedings of the Progress in Cryptology - LATINCRYPT 2017, 2017

2016
Optimizing budget allocation for center and median points.
Theor. Comput. Sci., 2016

Limits on the Usefulness of Random Oracles.
J. Cryptol., 2016

Optimizing Semi-Honest Secure Multiparty Computation for the Internet.
IACR Cryptol. ePrint Arch., 2016

2015
Protocols for Multiparty Coin Toss with a Dishonest Majority.
J. Cryptol., 2015

Rainbow matchings and algebras of sets.
Electron. Notes Discret. Math., 2015

Parallel Hashing via List Recoverability.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
Coin Flipping with Constant Bias Implies One-Way Functions.
SIAM J. Comput., 2014

Optimizing Budget Allocation in Graphs.
CoRR, 2014

2012
On the Power of Random Oracles.
Electron. Colloquium Comput. Complex., 2012

2011
A Practical Application of Differential Privacy to Personalized Online Advertising.
IACR Cryptol. ePrint Arch., 2011

1/<i>p</i>-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Optimizing Budget Allocation in Graphs.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Secure Multiparty Computation with Partial Fairness.
IACR Cryptol. ePrint Arch., 2010

2009
Matrix columns allocation problems.
Theor. Comput. Sci., 2009

Classifying the phase transition threshold for Ackermannian functions.
Ann. Pure Appl. Log., 2009

2008
Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers.
J. Comb. Theory A, 2008

Distributed Private Data Analysis: Simultaneously Solving How and What.
Proceedings of the Advances in Cryptology, 2008


  Loading...