| 2009 |
|---|
| 62 | EE | Amos Beimel,
Ilan Orlov:
Secret Sharing and Non-Shannon Information Inequalities.
TCC 2009: 539-557 |
| 61 | EE | Amos Beimel,
Boaz Ben-Moshe,
Yehuda Ben-Shimol,
Paz Carmi,
Eldad Chai,
Itzik Kitroser,
Eran Omri:
Matrix columns allocation problems.
Theor. Comput. Sci. 410(21-23): 2174-2183 (2009) |
| 2008 |
|---|
| 60 | EE | Amos Beimel,
Kobbi Nissim,
Eran Omri:
Distributed Private Data Analysis: Simultaneously Solving How and What.
CRYPTO 2008: 451-468 |
| 59 | EE | Amos Beimel,
Anat Paskin:
On Linear Secret Sharing for Connectivity in Directed Graphs.
SCN 2008: 172-184 |
| 58 | EE | Amos Beimel,
Noam Livne,
Carles Padró:
Matroids Can Be Far from Ideal Secret Sharing.
TCC 2008: 194-212 |
| 57 | EE | Amos Beimel,
Francesco Bergadano,
Nader H. Bshouty,
Eyal Kushilevitz,
Stefano Varricchio:
Learning Automata.
Encyclopedia of Algorithms 2008 |
| 56 | EE | Amos Beimel,
Noam Livne:
On Matroids and Nonideal Secret Sharing.
IEEE Transactions on Information Theory 54(6): 2626-2643 (2008) |
| 55 | EE | Amos Beimel,
Paz Carmi,
Kobbi Nissim,
Enav Weinreb:
Private Approximation of Search Problems.
SIAM J. Comput. 38(5): 1728-1760 (2008) |
| 54 | EE | Amos Beimel,
Tamir Tassa,
Enav Weinreb:
Characterizing Ideal Weighted Threshold Secret Sharing.
SIAM J. Discrete Math. 22(1): 360-397 (2008) |
| 2007 |
|---|
| 53 | EE | Amos Beimel,
Tal Malkin,
Kobbi Nissim,
Enav Weinreb:
How Should We Solve Search Problems Privately?
CRYPTO 2007: 31-49 |
| 52 | EE | Amos Beimel,
Matthew K. Franklin:
Weakly-Private Secret Sharing Schemes.
TCC 2007: 253-272 |
| 51 | EE | Amos Beimel,
Renen Hallak,
Kobbi Nissim:
Private Approximation of Clustering and Vertex Cover.
TCC 2007: 383-403 |
| 50 | EE | Amos Beimel:
On private computation in incomplete networks.
Distributed Computing 19(3): 237-252 (2007) |
| 49 | EE | Amos Beimel,
Shlomi Dolev,
Noam Singer:
RT oblivious erasure correcting.
IEEE/ACM Trans. Netw. 15(6): 1321-1332 (2007) |
| 48 | EE | Amos Beimel,
Yoav Stahl:
Robust Information-Theoretic Private Information Retrieval.
J. Cryptology 20(3): 295-321 (2007) |
| 2006 |
|---|
| 47 | EE | Amos Beimel,
Matthew K. Franklin:
Edge Eavesdropping Games.
SCN 2006: 1-17 |
| 46 | EE | Amos Beimel,
Paz Carmi,
Kobbi Nissim,
Enav Weinreb:
Private approximation of search problems.
STOC 2006: 119-128 |
| 45 | EE | Amos Beimel,
Noam Livne:
On Matroids and Non-ideal Secret Sharing.
TCC 2006: 482-501 |
| 44 | EE | Amos Beimel,
Enav Weinreb:
Monotone circuits for monotone weighted threshold functions.
Inf. Process. Lett. 97(1): 12-18 (2006) |
| 2005 |
|---|
| 43 | EE | Amos Beimel,
Enav Weinreb:
Monotone Circuits for Weighted Threshold Functions.
IEEE Conference on Computational Complexity 2005: 67-75 |
| 42 | EE | Amos Beimel:
On Private Computation in Incomplete Networks.
SIROCCO 2005: 18-33 |
| 41 | EE | Amos Beimel,
Tamir Tassa,
Enav Weinreb:
Characterizing Ideal Weighted Threshold Secret Sharing.
TCC 2005: 600-619 |
| 40 | EE | Amos Beimel,
Lior Malka:
Efficient reliable communication over partially authenticated networks.
Distributed Computing 18(1): 1-19 (2005) |
| 39 | EE | Amos Beimel,
Paz Carmi,
Kobbi Nissim,
Enav Weinreb:
Private Approximation of Search Problems
Electronic Colloquium on Computational Complexity (ECCC)(141): (2005) |
| 38 | EE | Amos Beimel,
Yuval Ishai,
Eyal Kushilevitz:
General constructions for information-theoretic private information retrieval.
J. Comput. Syst. Sci. 71(2): 213-247 (2005) |
| 37 | EE | Amos Beimel,
Enav Weinreb:
Separating the Power of Monotone Span Programs over Different Fields.
SIAM J. Comput. 34(5): 1196-1215 (2005) |
| 2004 |
|---|
| 36 | EE | Amos Beimel,
Shlomi Dolev,
Noam Singer:
Brief announcement: RT oblivious erasure correcting.
PODC 2004: 393 |
| 35 | EE | Amos Beimel,
Tal Malkin:
A Quantitative Approach to Reductions in Secure Computation.
TCC 2004: 238-257 |
| 34 | EE | Amos Beimel,
Yuval Ishai,
Tal Malkin:
Reducing the Servers' Computation in Private Information Retrieval: PIR with Preprocessing.
J. Cryptology 17(2): 125-151 (2004) |
| 2003 |
|---|
| 33 | EE | Amos Beimel,
Enav Weinreb:
Separating the Power of Monotone Span Programs over Different Fields.
FOCS 2003: 428-437 |
| 32 | EE | Amos Beimel,
Lior Malka:
Efficient reliable communication over partially authenticated networks.
PODC 2003: 233-242 |
| 31 | EE | Amos Beimel,
Tal Malkin:
A Quantitative Approach to Reductions in Secure Computation
Electronic Colloquium on Computational Complexity (ECCC)(086): (2003) |
| 30 | EE | Amos Beimel,
Shlomi Dolev:
Buses for Anonymous Message Delivery.
J. Cryptology 16(1): 25-39 (2003) |
| 2002 |
|---|
| 29 | EE | Amos Beimel,
Yuval Ishai,
Eyal Kushilevitz,
Jean-François Raymond:
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval.
FOCS 2002: 261-270 |
| 28 | EE | Amos Beimel,
Yoav Stahl:
Robust Information-Theoretic Private Information Retrieval.
SCN 2002: 326-341 |
| 2001 |
|---|
| 27 | EE | Amos Beimel,
Yuval Ishai:
Information-Theoretic Private Information Retrieval: A Unified Construction.
ICALP 2001: 912-926 |
| 26 | EE | Amos Beimel,
Yuval Ishai:
On the Power of Nonlinear Secrect-Sharing.
IEEE Conference on Computational Complexity 2001: 188-202 |
| 25 | EE | Amos Beimel,
Yuval Ishai:
Information-Theoretic Private Information Retrieval: A Unified Construction
Electronic Colloquium on Computational Complexity (ECCC) 8(15): (2001) |
| 24 | | Amos Beimel,
Felix Geller,
Eyal Kushilevitz:
The Query Complexity of Finding Local Minima in the Lattice.
Inf. Comput. 171(1): 69-83 (2001) |
| 2000 |
|---|
| 23 | EE | Amos Beimel,
Yuval Ishai,
Tal Malkin:
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing.
CRYPTO 2000: 55-73 |
| 22 | EE | Amos Beimel,
Eyal Kushilevitz:
Learning unions of high-dimensional boxes over the reals.
Inf. Process. Lett. 73(5-6): 213-220 (2000) |
| 21 | EE | Amos Beimel,
Francesco Bergadano,
Nader H. Bshouty,
Eyal Kushilevitz,
Stefano Varricchio:
Learning functions represented as multiplicity automata.
J. ACM 47(3): 506-530 (2000) |
| 20 | EE | Amos Beimel,
Mike Burmester,
Yvo Desmedt,
Eyal Kushilevitz:
Computing Functions of a Shared Secret.
SIAM J. Discrete Math. 13(3): 324-345 (2000) |
| 1999 |
|---|
| 19 | EE | Amos Beimel,
Tal Malkin,
Silvio Micali:
The All-or-Nothing Nature of Two-Party Secure Computation.
CRYPTO 1999: 80-97 |
| 18 | EE | Amos Beimel,
Yuval Ishai,
Eyal Kushilevitz,
Tal Malkin:
One-Way Functions Are Essential for Single-Server Private Information Retrieval.
STOC 1999: 89-98 |
| 17 | | Amos Beimel,
Anna Gál:
On Arithmetic Branching Programs.
J. Comput. Syst. Sci. 59(2): 195-220 (1999) |
| 16 | EE | Amos Beimel,
Matthew K. Franklin:
Reliable Communication over Partially Authenticated Networks.
Theor. Comput. Sci. 220(1): 185-210 (1999) |
| 1998 |
|---|
| 15 | EE | Amos Beimel,
Felix Geller,
Eyal Kushilevitz:
The Query Complexity of Finding Local Minima in the Lattice.
COLT 1998: 294-302 |
| 14 | EE | Amos Beimel,
Anna Gál:
On Arithmetic Branching Programs.
IEEE Conference on Computational Complexity 1998: 68-80 |
| 13 | | Amos Beimel,
Eyal Kushilevitz:
Learning Boxes in High Dimension.
Algorithmica 22(1/2): 76-90 (1998) |
| 12 | | Amos Beimel,
Benny Chor:
Secret Sharing with Public Reconstruction.
IEEE Transactions on Information Theory 44(5): 1887-1896 (1998) |
| 1997 |
|---|
| 11 | | Amos Beimel,
Eyal Kushilevitz:
Learning Boxes in High Dimension.
EuroCOLT 1997: 3-15 |
| 10 | | Amos Beimel,
Matthew K. Franklin:
Reliable Communication over Partially Authenticated Networks.
WDAG 1997: 245-259 |
| 9 | | Amos Beimel,
Anna Gál,
Mike Paterson:
Lower Bounds for Monotone Span Programs.
Computational Complexity 6(1): 29-45 (1997) |
| 1996 |
|---|
| 8 | | Amos Beimel,
Francesco Bergadano,
Nader H. Bshouty,
Eyal Kushilevitz,
Stefano Varricchio:
On the Applications of Multiplicity Automata in Learning.
FOCS 1996: 349-358 |
| 7 | | Amos Beimel,
Benny Chor:
Communication in key distribution schemes.
IEEE Transactions on Information Theory 42(1): 19-28 (1996) |
| 1995 |
|---|
| 6 | EE | Amos Beimel,
Benny Chor:
Secret Sharing with Public Reconstruction (Extended Abstract).
CRYPTO 1995: 353-366 |
| 5 | | Amos Beimel,
Anna Gál,
Mike Paterson:
Lower Bounds for Monotone Span Programs.
FOCS 1995: 674-681 |
| 4 | EE | Amos Beimel,
Anna Gál,
Mike Paterson:
Lower Bounds for Monotone Span Programs
Electronic Colloquium on Computational Complexity (ECCC) 2(1): (1995) |
| 1994 |
|---|
| 3 | | Amos Beimel,
Benny Chor:
Universally ideal secret-sharing schemes.
IEEE Transactions on Information Theory 40(3): 786-794 (1994) |
| 1993 |
|---|
| 2 | EE | Amos Beimel,
Benny Chor:
Interaction in Key Distribution Schemes (Extended Abstract).
CRYPTO 1993: 444-455 |
| 1992 |
|---|
| 1 | EE | Amos Beimel,
Benny Chor:
Universally Ideal Secret Sharing Schemes (Preliminary Version).
CRYPTO 1992: 183-195 |
