- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j8 |      | Jan Draisma, Eyal Kushilevitz, Enav Weinreb: Partition arguments in multiparty communication complexity. Theor. Comput. Sci. 412(24): 2611-2622 (2011) |
| 2010 | ||
| j7 | | Omer Barkol, Yuval Ishai, Enav Weinreb: On Locally Decodable Codes, Self-Correctable Codes, and t-Private PIR. Algorithmica 58(4): 831-859 (2010) |
| j6 | | Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb: How Should We Solve Search Problems Privately? J. Cryptology 23(2): 344-371 (2010) |
| j5 | | Omer Barkol, Yuval Ishai, Enav Weinreb: On d-Multiplicative Secret Sharing. J. Cryptology 23(4): 580-593 (2010) |
| c15 | | Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb: Choosing, Agreeing, and Eliminating in Communication Complexity. ICALP (1) 2010: 451-462 |
| 2009 | ||
| c14 | | Eyal Kushilevitz, Enav Weinreb: The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection. FOCS 2009: 63-72 |
| c13 | | Jan Draisma, Eyal Kushilevitz, Enav Weinreb: Partition Arguments in Multiparty Communication Complexity. ICALP (1) 2009: 390-402 |
| c12 | | |
| i3 | | Jan Draisma, Eyal Kushilevitz, Enav Weinreb: Partition Arguments in Multiparty Communication Complexity. CoRR abs/0909.5684 (2009) |
| 2008 | ||
| j4 | | Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private Approximation of Search Problems. SIAM J. Comput. 38(5): 1728-1760 (2008) |
| j3 | | Amos Beimel, Tamir Tassa, Enav Weinreb: Characterizing Ideal Weighted Threshold Secret Sharing. SIAM J. Discrete Math. 22(1): 360-397 (2008) |
| c11 | | Payman Mohassel, Enav Weinreb: Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries. CRYPTO 2008: 481-496 |
| c10 | | Omer Barkol, Yuval Ishai, Enav Weinreb: Communication in the presence of replication. STOC 2008: 661-670 |
| i2 | | Dennis Hofheinz, Enav Weinreb: Searchable encryption with decryption in the standard model. IACR Cryptology ePrint Archive 2008: 423 (2008) |
| 2007 | ||
| c9 | | Omer Barkol, Yuval Ishai, Enav Weinreb: On Locally Decodable Codes, Self-correctable Codes, and t -Private PIR. APPROX-RANDOM 2007: 311-325 |
| c8 | | Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb: How Should We Solve Search Problems Privately? CRYPTO 2007: 31-49 |
| c7 | | Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew K. Franklin: Secure Linear Algebra Using Linearly Recurrent Sequences. TCC 2007: 291-310 |
| 2006 | ||
| j2 | | Amos Beimel, Enav Weinreb: Monotone circuits for monotone weighted threshold functions. Inf. Process. Lett. 97(1): 12-18 (2006) |
| c6 | | Eike Kiltz, Enav Weinreb: Secure Linear Algebra Using Linearly Recurrent Sequences. Complexity of Boolean Functions 2006 |
| c5 | | Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private approximation of search problems. STOC 2006: 119-128 |
| c4 | | |
| 2005 | ||
| j1 | | Amos Beimel, Enav Weinreb: Separating the Power of Monotone Span Programs over Different Fields. SIAM J. Comput. 34(5): 1196-1215 (2005) |
| c3 | | Amos Beimel, Enav Weinreb: Monotone Circuits for Weighted Threshold Functions. IEEE Conference on Computational Complexity 2005: 67-75 |
| c2 | | Amos Beimel, Tamir Tassa, Enav Weinreb: Characterizing Ideal Weighted Threshold Secret Sharing. TCC 2005: 600-619 |
| i1 | | Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private Approximation of Search Problems. Electronic Colloquium on Computational Complexity (ECCC)(141) (2005) |
| 2003 | ||
| c1 | | Amos Beimel, Enav Weinreb: Separating the Power of Monotone Span Programs over Different Fields. FOCS 2003: 428-437 |
Data released under the ODC-BY 1.0 license — See also our legal information page