| Publication | Date of Publication | Type |
|---|
On the complexity of communication complexity
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Private approximation of search problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Choosing, agreeing, and eliminating in communication complexity
Computational Complexity | 2014-09-25 | Paper |
The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Partition arguments in multiparty communication complexity
Theoretical Computer Science | 2011-06-07 | Paper |
On \(d\)-multiplicative secret sharing
Journal of Cryptology | 2010-11-12 | Paper |
On locally decodable codes, self-correctable codes, and \(t\)-private PIR
Algorithmica | 2010-11-08 | Paper |
Choosing, agreeing, and eliminating in communication complexity
Automata, Languages and Programming | 2010-09-07 | Paper |
How should we solve search problems privately?
Journal of Cryptology | 2010-03-01 | Paper |
Monotone circuits for monotone weighted threshold functions
Information Processing Letters | 2009-12-18 | Paper |
Private Approximation of Search Problems
SIAM Journal on Computing | 2009-11-06 | Paper |
Partition Arguments in Multiparty Communication Complexity
Automata, Languages and Programming | 2009-07-14 | Paper |
Characterizing Ideal Weighted Threshold Secret Sharing
SIAM Journal on Discrete Mathematics | 2009-03-16 | Paper |
How Should We Solve Search Problems Privately?
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
Lecture Notes in Computer Science | 2009-02-10 | Paper |
| scientific article; zbMATH DE number 5485580 (Why is no real title available?) | 2009-01-05 | Paper |
Secure Linear Algebra Using Linearly Recurrent Sequences
Theory of Cryptography | 2007-08-30 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Separating the Power of Monotone Span Programs over Different Fields
SIAM Journal on Computing | 2005-09-16 | Paper |
