8 citations · 19 across the 10 of their papers we have counts for
12 papers
PINE: Efficient Norm-Bound Verification for Secret-Shared Vectors
Guy N. Rothblum, Eran Omri, Junye Chen +1
Secure aggregation of high-dimensional vectors is a fundamental primitive in federated statistics and learning. A two-server system such as PRIO allows for scalable aggregation of…
MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably
Bar Alon, Moni Naor, Eran Omri +1
In this work, we introduce the Gulliver multi-party computation model (GMPC). The GMPC model considers a single highly powerful party, called the server or Gulliver, that is connec…
From Fairness to Full Security in Multiparty Computation
Ran Cohen, Iftach Haitner, Eran Omri +1
In the setting of secure multiparty computation (MPC), a set of mutually distrusting parties wish to jointly compute a function, while guaranteeing the privacy of their inputs and…
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols
Iftach Haitner, Kobbi Nissim, Eran Omri +2
Let be an efficient two-party protocol that given security parameter , both parties output single bits and , respectively. We are interested in how "a…
Characterization of Secure Multiparty Computation Without Broadcast
Ran Cohen, Iftach Haitner, Eran Omri +1
A major challenge in the study of cryptography is characterizing the necessary and sufficient assumptions required to carry out a given cryptographic task. The focus of this work i…
On the Complexity of Fair Coin Flipping
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
A two-party coin-flipping protocol is -fair if no efficient adversary can bias the output of the honest party (who always outputs a bit, even if the other party aborts) by more…