| 2008 |
|---|
| 13 | EE | Omer Barkol,
Yuval Ishai,
Enav Weinreb:
Communication in the presence of replication.
STOC 2008: 661-670 |
| 2007 |
|---|
| 12 | EE | Omer Barkol,
Yuval Ishai,
Enav Weinreb:
On Locally Decodable Codes, Self-correctable Codes, and t -Private PIR.
APPROX-RANDOM 2007: 311-325 |
| 11 | EE | Amos Beimel,
Tal Malkin,
Kobbi Nissim,
Enav Weinreb:
How Should We Solve Search Problems Privately?
CRYPTO 2007: 31-49 |
| 10 | EE | Eike Kiltz,
Payman Mohassel,
Enav Weinreb,
Matthew K. Franklin:
Secure Linear Algebra Using Linearly Recurrent Sequences.
TCC 2007: 291-310 |
| 2006 |
|---|
| 9 | EE | Eike Kiltz,
Enav Weinreb:
Secure Linear Algebra Using Linearly Recurrent Sequences.
Complexity of Boolean Functions 2006 |
| 8 | EE | Amos Beimel,
Paz Carmi,
Kobbi Nissim,
Enav Weinreb:
Private approximation of search problems.
STOC 2006: 119-128 |
| 7 | EE | Kobbi Nissim,
Enav Weinreb:
Communication Efficient Secure Linear Algebra.
TCC 2006: 522-541 |
| 6 | EE | Amos Beimel,
Enav Weinreb:
Monotone circuits for monotone weighted threshold functions.
Inf. Process. Lett. 97(1): 12-18 (2006) |
| 2005 |
|---|
| 5 | EE | Amos Beimel,
Enav Weinreb:
Monotone Circuits for Weighted Threshold Functions.
IEEE Conference on Computational Complexity 2005: 67-75 |
| 4 | EE | Amos Beimel,
Tamir Tassa,
Enav Weinreb:
Characterizing Ideal Weighted Threshold Secret Sharing.
TCC 2005: 600-619 |
| 3 | EE | Amos Beimel,
Paz Carmi,
Kobbi Nissim,
Enav Weinreb:
Private Approximation of Search Problems
Electronic Colloquium on Computational Complexity (ECCC)(141): (2005) |
| 2 | EE | Amos Beimel,
Enav Weinreb:
Separating the Power of Monotone Span Programs over Different Fields.
SIAM J. Comput. 34(5): 1196-1215 (2005) |
| 2003 |
|---|
| 1 | EE | Amos Beimel,
Enav Weinreb:
Separating the Power of Monotone Span Programs over Different Fields.
FOCS 2003: 428-437 |
