#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2003

2010

- This year (0)
- Last 5 years (0)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Amos Beimel, Tamir Tassa, Enav Weinreb
- TCC
- 2005

Weighted threshold secret sharing was introduced by Shamir in his seminal work on secret sharing. In such settings, there is a set of users where each user is assigned a positive weight. A dealerâ€¦ (More)

- Omer Barkol, Yuval Ishai, Enav Weinreb
- Algorithmica
- 2007

A k-query locally decodable code (LDC) allows to probabilistically decode any bit of an encoded message by probing only k bits of its corrupted encoding. AÂ stronger and desirable property is that ofâ€¦ (More)

- Amos Beimel, Enav Weinreb
- Inf. Process. Lett.
- 2006

Weighted threshold functions with positive weights are a na tural generalization of unweighted threshold functions. These functions are clearly monotone. Howev er, the naive way of computing them isâ€¦ (More)

- Kobbi Nissim, Enav Weinreb
- TCC
- 2006

We present communication efficient secure protocols for a variety of linear algebra problems. Our main building block is a protocol for computing Gaussian elimination on encrypted data. As input forâ€¦ (More)

- Amos Beimel, Enav Weinreb
- FOCS
- 2003

Monotone span programs are a linear-algebraic model of computation. They are equivalent to linear secret sharing schemes and have various applications in cryptography and complexity. A fundamentalâ€¦ (More)

- Omer Barkol, Yuval Ishai, Enav Weinreb
- Journal of Cryptology
- 2010

A multiplicative secret sharing scheme allows players to multiply two secret-shared field elements by locally converting their shares of the two secrets into an additive sharing of their product.â€¦ (More)

- Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
- Electronic Colloquium on Computational Complexity
- 2005

Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to design algorithmsâ€¦ (More)

- Eike Kiltz, Enav Weinreb
- Complexity of Boolean Functions
- 2006

In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matrix: Bob holds anâ€¦ (More)

- Amos Beimel, Enav Weinreb
- 20th Annual IEEE Conference on Computationalâ€¦
- 2005

Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of computing them isâ€¦ (More)

- Eyal Kushilevitz, Enav Weinreb
- STOC
- 2009

We consider the following question: given a two-argument boolean function f, represented as an N x N binary matrix, how hard is it to determine the (deterministic) communication complexity of f? Weâ€¦ (More)