#### Filter Results:

- Full text PDF available (17)

#### Publication Year

2006

2018

- This year (5)
- Last 5 years (14)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Amos Beimel, Kobbi Nissim, Eran Omri
- CRYPTO
- 2008

We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs â€“ secure function evaluation (SFE) and differential privacy. While in bothâ€¦ (More)

- Aner Ben-Efraim, Yehuda Lindell, Eran Omri
- ACM Conference on Computer and Communicationsâ€¦
- 2016

In the setting of secure multiparty computation, a set of parties with private inputs wish to compute some function of their inputs without revealing anything but their output. Over the last decade,â€¦ (More)

Fairness is a desirable property in secure computation; informally it means that if one party gets the output of the function, then all parties get the output. Alas, an implication of Cleveâ€™s resultâ€¦ (More)

- Amos Beimel, Eran Omri, Ilan Orlov
- CRYPTO
- 2010

Coin-tossing protocols are protocols that generate a random bit with uniform distribution. These protocols are used as a building block in many cryptographic protocols. Cleve [STOC 1986] has shownâ€¦ (More)

- Iftach Haitner, Eran Omri, Hila Zarosim
- Journal of Cryptology
- 2013

In their seminal work, Impagliazzo and Rudich (STOCâ€™89) showed that no key-agreement protocol exists in the random-oracle model, yielding that key agreement cannot be black-box reduced to one-wayâ€¦ (More)

- Amos Beimel, Kobbi Nissim, Eran Omri
- ArXiv
- 2009

We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs â€“ secure function evaluation (SFE) and differential privacy. While in bothâ€¦ (More)

An Î±-fair coin-tossing protocol allows a set of mutually distrustful parties to generate a uniform bit, such that no efficient adversary can bias the output bit by more than Î±. Cleve [STOC 1986] hasâ€¦ (More)

- Menachem Kojman, Gyesik Lee, Eran Omri, Andreas Weiermann
- J. Comb. Theory, Ser. A
- 2008

We compute the sharp thresholds on g at which g-large and g-regressive Ramsey numbers cease to be primitive recursive and become Ackermannian. We also identify the threshold below which g-regressiveâ€¦ (More)

- Boaz Ben-Moshe, Eran Omri, Michael Elkin
- CCCG
- 2011

In a classical facility location problem we consider a graph G with fixed weights on the edges of G. The goal is then to find an optimal positioning for a set of facilities on the graph with respectâ€¦ (More)

- Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov
- CRYPTO
- 2011

A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation, where parties give their inputs to a trusted party whichâ€¦ (More)