Enav Weinreb

According to our database, Enav Weinreb authored at least 19 papers between 2003 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

q2d: Turning Questions into Dialogs to Teach Models How to Search.

Yonatan Bitton, Shlomi Cohen-Ganor, Ido Hakimi, Yoad Lewenberg, Roee Aharoni, Enav Weinreb

Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, 2023

2010

On <i>d</i>-Multiplicative Secret Sharing.

Omer Barkol, Yuval Ishai, Enav Weinreb

J. Cryptol., 2010

Choosing, Agreeing, and Eliminating in Communication Complexity.

Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

On the complexity of communication complexity.

Eyal Kushilevitz, Enav Weinreb

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Partition Arguments in Multiparty Communication Complexity.

Jan Draisma, Eyal Kushilevitz, Enav Weinreb

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection.

Eyal Kushilevitz, Enav Weinreb

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008

Searchable encryption with decryption in the standard model.

Dennis Hofheinz, Enav Weinreb

IACR Cryptol. ePrint Arch., 2008

Communication in the presence of replication.

Omer Barkol, Yuval Ishai, Enav Weinreb

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries.

Payman Mohassel, Enav Weinreb

Proceedings of the Advances in Cryptology, 2008

2007

Secure Linear Algebra Using Linearly Recurrent Sequences.

Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew K. Franklin

Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

How Should We Solve Search Problems Privately?

Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb

Proceedings of the Advances in Cryptology, 2007

On Locally Decodable Codes, Self-correctable Codes, and <i>t</i> -Private PIR.

Omer Barkol, Yuval Ishai, Enav Weinreb

Proceedings of the Approximation, 2007

2006

Monotone circuits for monotone weighted threshold functions.

Amos Beimel, Enav Weinreb

Inf. Process. Lett., 2006

Communication Efficient Secure Linear Algebra.

Kobbi Nissim, Enav Weinreb

Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Private approximation of search problems.

Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Secure Linear Algebra Using Linearly Recurrent Sequences.

Eike Kiltz, Enav Weinreb

Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006

2005

Characterizing Ideal Weighted Threshold Secret Sharing.

Amos Beimel, Tamir Tassa, Enav Weinreb

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Monotone Circuits for Weighted Threshold Functions.

Amos Beimel, Enav Weinreb

Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2003

Separating the Power of Monotone Span Programs over Different Fields.

Amos Beimel, Enav Weinreb

Proceedings of the 44th Symposium on Foundations of Computer Science, 2003