q2d: Turning Questions into Dialogs to Teach Models How to Search.
Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, 2023
Choosing, Agreeing, and Eliminating in Communication Complexity.
Comput. Complex., 2014
Partition arguments in multiparty communication complexity.
Theor. Comput. Sci., 2011
How Should We Solve Search Problems Privately?
J. Cryptol., 2010
On <i>d</i>-Multiplicative Secret Sharing.
J. Cryptol., 2010
On Locally Decodable Codes, Self-Correctable Codes, and <i>t</i>-Private PIR.
Algorithmica, 2010
On the complexity of communication complexity.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009
The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
Characterizing Ideal Weighted Threshold Secret Sharing.
SIAM J. Discret. Math., 2008
Private Approximation of Search Problems.
SIAM J. Comput., 2008
Searchable encryption with decryption in the standard model.
IACR Cryptol. ePrint Arch., 2008
Communication in the presence of replication.
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.
Proceedings of the Advances in Cryptology, 2008
Secure Linear Algebra Using Linearly Recurrent Sequences.
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007
Monotone circuits for monotone weighted threshold functions.
Inf. Process. Lett., 2006
Communication Efficient Secure Linear Algebra.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006
Secure Linear Algebra Using Linearly Recurrent Sequences.
Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006
Separating the Power of Monotone Span Programs over Different Fields.
SIAM J. Comput., 2005
Monotone Circuits for Weighted Threshold Functions.
Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005