| year | title | booktitle | pages | |
|---|---|---|---|---|
| 1 | 2010 | On d-Multiplicative Secret Sharing | jofc | 580-593 |
| 2 | 2010 | How Should We Solve Search Problems Privately? | jofc | 344-371 |
| 3 | 2008 | Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries | crypto | 481-496 |
| 4 | 2007 | Secure Linear Algebra Using Linearly Recurrent Sequences | tcc | 291-310 |
| 5 | 2007 | How Should We Solve Search Problems Privately? | crypto | 31-49 |
| 6 | 2006 | Communication Efficient Secure Linear Algebra | tcc | online |
| 7 | 2005 | Characterizing Ideal Weighted Threshold Secret Sharing | tcc | online |
Coauthors of Enav Weinreb |