Eran Omri

Orcid: 0000-0001-8928-0587

According to our database1, Eran Omri authored at least 48 papers between 2008 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
New Techniques for Analyzing Fully Secure Protocols: A Case Study of Solitary Output Secure Computation.
IACR Cryptol. ePrint Arch., 2025

2024
MYao: Multiparty "Yao" Garbled Circuits with Row Reduction, Half Gates, and Efficient Online Computation.
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

New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Can Alice and Bob Guarantee Output to Carol?
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

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

On Secure Computation of Solitary Output Functionalities with and Without Broadcast.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Three Party Secure Computation with Friends and Foes.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

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

On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection.
Proceedings of the ASIA CCS '22: ACM Asia Conference on Computer and Communications Security, Nagasaki, Japan, 30 May 2022, 2022

2021
Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

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

On the Power of an Honest Majority in Three-Party Computation Without Broadcast.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

MPC with Friends and Foes.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 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
Computational Two-Party Correlation.
Electron. Colloquium Comput. Complex., 2018

On the Complexity of Fair Coin Flipping.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

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

From Fairness to Full Security in Multiparty Computation.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 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
Rainbow Matchings and Algebras of Sets.
Graphs Comb., 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

Efficient Scalable Constant-Round MPC via Garbled Circuits.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

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

Characterization of Secure Multiparty Computation Without Broadcast.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Optimizing Semi-Honest Secure Multiparty Computation for the Internet.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

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

2014
Optimizing Budget Allocation in Graphs.
CoRR, 2014

2013
Limits on the Usefulness of Random Oracles.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

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

Completeness for Symmetric Two-Party Functionalities - Revisited.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

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

Coin Flipping with Constant Bias Implies One-Way Functions.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 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

Protocols for Multiparty Coin Toss with Dishonest Majority.
Proceedings of the Advances in Cryptology, 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...