Amos Beimel |
|
|---|---|
Author's Web Page  | |
| 18 papers in database with 498 citations  H-number: 10 | |
Journal Papers |
|
| 1. Amos Beimel, Yoav Stahl, Robust Information-Theoretic Private Information Retrieval, Journal of Cryptology,
Volume 20(3), pp. 295 - 321,
Springer, 2007. [  Cited
24 times
] | |
| 2. Amos Beimel, Yuval Ishai, Tal Malkin, Reducing the Servers' Computation in Private Information Retrieval: PIR with Preprocessing, Journal of Cryptology,
Volume 17(2), pp. 125 - 151,
Springer, 2004. [ Cited
60 times
 ] | |
| 3. Amos Beimel, Shlomi Dolev, Buses for Anonymous Message Delivery, Journal of Cryptology,
Volume 16(1), pp. 25 - 39,
Springer, 2003. [ Cited
41 times
] | |
Conference Papers |
|
| 1. Amos Beimel, Ilan Orlov, Secret Sharing and Non-Shannon Information Inequalities, pp. 539 - 557, TCC 2009. [  Electronic
Edition][Cited
2 times
] | |
| 2. Amos Beimel, Kobbi Nissim, Eran Omri, Distributed Private Data Analysis: Simultaneously Solving How and What, pp. 451 - 468, CRYPTO 2008. [ Electronic
Edition][Cited
6 times
] | |
| 3. Amos Beimel, Noam Livne, Carles Padró, Matroids Can Be Far from Ideal Secret Sharing, pp. 194 - 212, TCC 2008. [ Electronic
Edition][Cited
9 times
] | |
| 4. Amos Beimel, Renen Hallak, Kobbi Nissim, Private Approximation of Clustering and Vertex Cover, pp. 383 - 403, TCC 2007. [ Electronic
Edition][Cited
8 times
] | |
| 5. Amos Beimel, Matthew K. Franklin, Weakly-Private Secret Sharing Schemes, pp. 253 - 272, TCC 2007. [ Electronic
Edition][Cited
3 times
] | |
| 6. Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb, How Should We Solve Search Problems Privately?, pp. 31 - 49, CRYPTO 2007. [ Electronic
Edition][Cited
6 times
] | |
| 7. Amos Beimel, Noam Livne, On Matroids and Non-ideal Secret Sharing, pp. 482 - 501, TCC 2006. [ Electronic
Edition][ IACR Online
Archive ][Cited
17 times
] | |
| 8. Amos Beimel, Tamir Tassa, Enav Weinreb, Characterizing Ideal Weighted Threshold Secret Sharing, pp. 600 - 619, TCC 2005. [ Electronic
Edition][IACR Online
Archive][Cited
29 times
] | |
| 9. Amos Beimel, Tal Malkin, A Quantitative Approach to Reductions in Secure Computation, pp. 238 - 257, TCC 2004. [ Electronic
Edition][Cited
8 times
] | |
| 10. Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Jean-François Raymond, Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval, pp. 261 - 270, FOCS 2002. [ Electronic
Edition][Cited
94 times
] | |
| 11. Amos Beimel, Yuval Ishai, Tal Malkin, Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing, pp. 55 - 73, CRYPTO 2000. [ Electronic
Edition][IACR Online
Archive][Cited
83 times
] | |
| 12. Amos Beimel, Tal Malkin, Silvio Micali, The All-or-Nothing Nature of Two-Party Secure Computation, pp. 80 - 97, CRYPTO 1999. [ Electronic
Edition][Cited
38 times
] | |
| 13. Amos Beimel, Benny Chor, Secret Sharing with Public Reconstruction (Extended Abstract), pp. 353 - 366, CRYPTO 1995. [ Electronic
Edition][Cited
36 times
] | |
| 14. Amos Beimel, Benny Chor, Interaction in Key Distribution Schemes (Extended Abstract), pp. 444 - 455, CRYPTO 1993. [ Electronic
Edition][Cited
32 times
] | |
| 15. Amos Beimel, Benny Chor, Universally Ideal Secret Sharing Schemes (Preliminary Version), pp. 183 - 195, CRYPTO 1992. [ Electronic
Edition][Cited
2 times
] | |
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals