Monotone Circuits for Weighted Threshold Functions. - Amos Beimel; Enav Weinreb (CCC, 2005)

Separating the Power of Monotone Span Programs over Different Fields. - Amos Beimel; Enav Weinreb (SIAM J. Comput., 2005)

Secure Linear Algebra Using Linearly Recurrent Sequences. - Eike Kiltz; Enav Weinreb (Complexity of Boolean Functions, 2006)

Communication Efficient Secure Linear Algebra. - Kobbi Nissim; Enav Weinreb (TCC, 2006)

Monotone circuits for monotone weighted threshold functions. - Amos Beimel; Enav Weinreb (Inf. Process. Lett., 2006)

Secure Linear Algebra Using Linearly Recurrent Sequences. - Eike Kiltz; Payman Mohassel; Enav Weinreb; Matthew K. Franklin (TCC, 2007)

Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries. - Payman Mohassel; Enav Weinreb (CRYPTO, 2008)

Communication in the presence of replication. - Omer Barkol; Yuval Ishai; Enav Weinreb (STOC, 2008)

Searchable encryption with decryption in the standard model. - Dennis Hofheinz; Enav Weinreb (IACR Cryptol. ePrint Arch., 2008)

Private Approximation of Search Problems. - Amos Beimel; Paz Carmi; Kobbi Nissim; Enav Weinreb (SIAM J. Comput., 2008)

Characterizing Ideal Weighted Threshold Secret Sharing. - Amos Beimel; Tamir Tassa; Enav Weinreb (SIAM J. Discret. Math., 2008)

The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection. - Eyal Kushilevitz; Enav Weinreb (FOCS, 2009)

On the complexity of communication complexity. - Eyal Kushilevitz; Enav Weinreb (STOC, 2009)

On Locally Decodable Codes, Self-Correctable Codes, and t-Private PIR. - Omer Barkol; Yuval Ishai; Enav Weinreb (Algorithmica, 2010)

On d-Multiplicative Secret Sharing. - Omer Barkol; Yuval Ishai; Enav Weinreb (J. Cryptol., 2010)

How Should We Solve Search Problems Privately? - Amos Beimel; Tal Malkin; Kobbi Nissim; Enav Weinreb (J. Cryptol., 2010)

Partition arguments in multiparty communication complexity. - Jan Draisma; Eyal Kushilevitz; Enav Weinreb (Theor. Comput. Sci., 2011)

Choosing, Agreeing, and Eliminating in Communication Complexity. - Amos Beimel; Sebastian Ben Daniel; Eyal Kushilevitz; Enav Weinreb (Comput. Complex., 2014)

q2d: Turning Questions into Dialogs to Teach Models How to Search. - Yonatan Bitton; Shlomi Cohen-Ganor; Ido Hakimi; Yoad Lewenberg; Roee Aharoni; Enav Weinreb (EMNLP, 2023)