Amos Beimel

	2012
76		Amos Beimel, Yeow Meng Chee, Huaxiong Wang, Liang Feng Zhang: Communication-efficient distributed oblivious transfer. J. Comput. Syst. Sci. 78(4): 1142-1157 (2012)
	2011
75		Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov: 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds. CRYPTO 2011: 277-296
74		Amos Beimel: Secret-Sharing Schemes: A Survey. IWCC 2011: 11-46
73		Amos Beimel, Kobbi Nissim, Eran Omri: Distributed Private Data Analysis: On Simultaneously Solving How and What CoRR abs/1103.2626: (2011)
72		Amos Beimel, Ilan Orlov: Secret Sharing and Non-Shannon Information Inequalities. IEEE Transactions on Information Theory 57(9): 5634-5649 (2011)
	2010
71		Amos Beimel, Eran Omri, Ilan Orlov: Protocols for Multiparty Coin Toss with Dishonest Majority. CRYPTO 2010: 538-557
70		Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb: Choosing, Agreeing, and Eliminating in Communication Complexity. ICALP (1) 2010: 451-462
69		Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi Nissim: Bounds on the Sample Complexity for Private Learning and Private Data Release. TCC 2010: 437-454
68		Amos Beimel, Eran Omri, Ilan Orlov: Secure Multiparty Computation with Partial Fairness CoRR abs/1011.5567: (2010)
67		Amos Beimel, Eran Omri, Ilan Orlov: Secure Multiparty Computation with Partial Fairness. IACR Cryptology ePrint Archive 2010: 599 (2010)
66		Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb: How Should We Solve Search Problems Privately? J. Cryptology 23(2): 344-371 (2010)
	2009
65		Amos Beimel, Ilan Orlov: Secret Sharing and Non-Shannon Information Inequalities. TCC 2009: 539-557
64		Erez Karpas, Solomon Eyal Shimony, Amos Beimel: Approximate belief updating in max-2-connected Bayes networks is NP-hard. Artif. Intell. 173(12-13): 1150-1153 (2009)
63		Amos Beimel, Renen Hallak, Kobbi Nissim: Private Approximation of Clustering and Vertex Cover. Computational Complexity 18(3): 435-494 (2009)
62		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
61		Amos Beimel, Kobbi Nissim, Eran Omri: Distributed Private Data Analysis: Simultaneously Solving How and What. CRYPTO 2008: 451-468
60		Amos Beimel, Anat Paskin: On Linear Secret Sharing for Connectivity in Directed Graphs. SCN 2008: 172-184
59		Amos Beimel, Noam Livne, Carles Padró: Matroids Can Be Far from Ideal Secret Sharing. TCC 2008: 194-212
58		Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio: Learning Automata. Encyclopedia of Algorithms 2008
57		Amos Beimel, Noam Livne: On Matroids and Nonideal Secret Sharing. IEEE Transactions on Information Theory 54(6): 2626-2643 (2008)
56		Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private Approximation of Search Problems. SIAM J. Comput. 38(5): 1728-1760 (2008)
55		Amos Beimel, Tamir Tassa, Enav Weinreb: Characterizing Ideal Weighted Threshold Secret Sharing. SIAM J. Discrete Math. 22(1): 360-397 (2008)
	2007
54		Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb: How Should We Solve Search Problems Privately? CRYPTO 2007: 31-49
53		Amos Beimel, Matthew K. Franklin: Weakly-Private Secret Sharing Schemes. TCC 2007: 253-272
52		Amos Beimel, Renen Hallak, Kobbi Nissim: Private Approximation of Clustering and Vertex Cover. TCC 2007: 383-403
51		Amos Beimel: On private computation in incomplete networks. Distributed Computing 19(3): 237-252 (2007)
50		Amos Beimel, Shlomi Dolev, Noam Singer: RT oblivious erasure correcting. IEEE/ACM Trans. Netw. 15(6): 1321-1332 (2007)
49		Amos Beimel, Yoav Stahl: Robust Information-Theoretic Private Information Retrieval. J. Cryptology 20(3): 295-321 (2007)
	2006
48		Amos Beimel, Matthew K. Franklin: Edge Eavesdropping Games. SCN 2006: 1-17
47		Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private approximation of search problems. STOC 2006: 119-128
46		Amos Beimel, Noam Livne: On Matroids and Non-ideal Secret Sharing. TCC 2006: 482-501
45		Amos Beimel, Enav Weinreb: Monotone circuits for monotone weighted threshold functions. Inf. Process. Lett. 97(1): 12-18 (2006)
	2005
44		Amos Beimel, Enav Weinreb: Monotone Circuits for Weighted Threshold Functions. IEEE Conference on Computational Complexity 2005: 67-75
43		Amos Beimel: On Private Computation in Incomplete Networks. SIROCCO 2005: 18-33
42		Amos Beimel, Tamir Tassa, Enav Weinreb: Characterizing Ideal Weighted Threshold Secret Sharing. TCC 2005: 600-619
41		Amos Beimel, Lior Malka: Efficient reliable communication over partially authenticated networks. Distributed Computing 18(1): 1-19 (2005)
40		Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private Approximation of Search Problems Electronic Colloquium on Computational Complexity (ECCC)(141): (2005)
39		Amos Beimel, Yuval Ishai, Eyal Kushilevitz: General constructions for information-theoretic private information retrieval. J. Comput. Syst. Sci. 71(2): 213-247 (2005)
38		Amos Beimel, Enav Weinreb: Separating the Power of Monotone Span Programs over Different Fields. SIAM J. Comput. 34(5): 1196-1215 (2005)
	2004
37		Amos Beimel, Shlomi Dolev, Noam Singer: Brief announcement: RT oblivious erasure correcting. PODC 2004: 393
36		Amos Beimel, Tal Malkin: A Quantitative Approach to Reductions in Secure Computation. TCC 2004: 238-257
35		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
34		Amos Beimel, Enav Weinreb: Separating the Power of Monotone Span Programs over Different Fields. FOCS 2003: 428-437
33		Amos Beimel, Lior Malka: Efficient reliable communication over partially authenticated networks. PODC 2003: 233-242
32		Amos Beimel, Tal Malkin: A Quantitative Approach to Reductions in Secure Computation Electronic Colloquium on Computational Complexity (ECCC)(086): (2003)
31		Amos Beimel, Shlomi Dolev: Buses for Anonymous Message Delivery. J. Cryptology 16(1): 25-39 (2003)
	2002
30		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
29		Amos Beimel, Yoav Stahl: Robust Information-Theoretic Private Information Retrieval. SCN 2002: 326-341
	2001
28		Amos Beimel, Yuval Ishai: Information-Theoretic Private Information Retrieval: A Unified Construction. ICALP 2001: 912-926
27		Amos Beimel, Yuval Ishai: On the Power of Nonlinear Secrect-Sharing. IEEE Conference on Computational Complexity 2001: 188-202
26		Amos Beimel, Yuval Ishai: Information-Theoretic Private Information Retrieval: A Unified Construction Electronic Colloquium on Computational Complexity (ECCC) 8(15): (2001)
25		Amos Beimel, Yuval Ishai: On the Power of Nonlinear Secret-Sharing. IACR Cryptology ePrint Archive 2001: 30 (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		Amos Beimel, Yuval Ishai, Tal Malkin: Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing. CRYPTO 2000: 55-73
22		Amos Beimel, Eyal Kushilevitz: Learning unions of high-dimensional boxes over the reals. Inf. Process. Lett. 73(5-6): 213-220 (2000)
21		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		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		Amos Beimel, Tal Malkin, Silvio Micali: The All-or-Nothing Nature of Two-Party Secure Computation. CRYPTO 1999: 80-97
18		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		Amos Beimel, Matthew K. Franklin: Reliable Communication over Partially Authenticated Networks. Theor. Comput. Sci. 220(1): 185-210 (1999)
	1998
15		Amos Beimel, Felix Geller, Eyal Kushilevitz: The Query Complexity of Finding Local Minima in the Lattice. COLT 1998: 294-302
14		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		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		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		Amos Beimel, Benny Chor: Interaction in Key Distribution Schemes (Extended Abstract). CRYPTO 1993: 444-455
	1992
1		Amos Beimel, Benny Chor: Universally Ideal Secret Sharing Schemes (Preliminary Version). CRYPTO 1992: 183-195

Coauthor Index

1	Boaz Ben-Moshe	[62]
2	Yehuda Ben-Shimol	[62]
3	Francesco Bergadano	[8] [21] [58]
4	Nader H. Bshouty	[8] [21] [58]
5	Mike Burmester	[20]
6	Paz Carmi	[40] [47] [56] [62]
7	Eldad Chai	[62]
8	Yeow Meng Chee	[76]
9	Benny Chor	[1] [2] [3] [6] [7] [12]
10	Sebastian Ben Daniel	[70]
11	Yvo Desmedt	[20]
12	Shlomi Dolev	[31] [37] [50]
13	Matthew K. Franklin	[10] [16] [48] [53]
14	Anna Gál	[4] [5] [9] [14] [17]
15	Felix Geller	[15] [24]
16	Renen Hallak	[52] [63]
17	Yuval Ishai	[18] [23] [25] [26] [27] [28] [30] [35] [39]
18	Erez Karpas	[64]
19	Shiva Prasad Kasiviswanathan	[69]
20	Itzik Kitroser	[62]
21	Eyal Kushilevitz	[8] [11] [13] [15] [18] [20] [21] [22] [24] [30] [39] [58] [70]
22	Yehuda Lindell	[75]
23	Noam Livne	[46] [57] [59]
24	Lior Malka	[33] [41]
25	Tal Malkin	[18] [19] [23] [32] [35] [36] [54] [66]
26	Silvio Micali	[19]
27	Kobbi Nissim	[40] [47] [52] [54] [56] [61] [63] [66] [69] [73]
28	Eran Omri	[61] [62] [67] [68] [71] [73] [75]
29	Ilan Orlov	[65] [67] [68] [71] [72] [75]
30	Carles Padró	[59]
31	Anat Paskin-Cherniavsky (Anat Paskin)	[60]
32	Mike Paterson	[4] [5] [9]
33	Jean-François Raymond	[30]
34	Solomon Eyal Shimony	[64]
35	Noam Singer	[37] [50]
36	Yoav Stahl	[29] [49]
37	Tamir Tassa	[42] [55]
38	Stefano Varricchio	[8] [21] [58]
39	Huaxiong Wang	[76]
40	Enav Weinreb	[34] [38] [40] [42] [44] [45] [47] [54] [55] [56] [66] [70]
41	Liang Feng Zhang	[76]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page