dblp.uni-trier.dewww.uni-trier.de

Amos Beimel Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

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

Coauthor Index

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)