The SCEAS System
| |||||||

## Search the dblp DataBase
Amos Beimel:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Amos Beimel, Anna Gál
**On Arithmetic Branching Programs.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1998, pp:68-80 [Conf] - Amos Beimel, Yuval Ishai
**On the Power of Nonlinear Secrect-Sharing.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2001, pp:188-202 [Conf] - Amos Beimel, Enav Weinreb
**Monotone Circuits for Weighted Threshold Functions.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2005, pp:67-75 [Conf] - Amos Beimel, Felix Geller, Eyal Kushilevitz
**The Query Complexity of Finding Local Minima in the Lattice.**[Citation Graph (0, 0)][DBLP] COLT, 1998, pp:294-302 [Conf] - Amos Beimel, Benny Chor
**Universally Ideal Secret Sharing Schemes (Preliminary Version).**[Citation Graph (0, 0)][DBLP] CRYPTO, 1992, pp:183-195 [Conf] - Amos Beimel, Benny Chor
**Interaction in Key Distribution Schemes (Extended Abstract).**[Citation Graph (0, 0)][DBLP] CRYPTO, 1993, pp:444-455 [Conf] - Amos Beimel, Benny Chor
**Secret Sharing with Public Reconstruction (Extended Abstract).**[Citation Graph (0, 0)][DBLP] CRYPTO, 1995, pp:353-366 [Conf] - Amos Beimel, Yuval Ishai, Tal Malkin
**Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2000, pp:55-73 [Conf] - Amos Beimel, Tal Malkin, Silvio Micali
**The All-or-Nothing Nature of Two-Party Secure Computation.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1999, pp:80-97 [Conf] - Amos Beimel, Eyal Kushilevitz
**Learning Boxes in High Dimension.**[Citation Graph (0, 0)][DBLP] EuroCOLT, 1997, pp:3-15 [Conf] - Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
**On the Applications of Multiplicity Automata in Learning.**[Citation Graph (0, 0)][DBLP] FOCS, 1996, pp:349-358 [Conf] - Amos Beimel, Anna Gál, Mike Paterson
**Lower Bounds for Monotone Span Programs.**[Citation Graph (0, 0)][DBLP] FOCS, 1995, pp:674-681 [Conf] - Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Jean-François Raymond
**Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:261-270 [Conf] - Amos Beimel, Enav Weinreb
**Separating the Power of Monotone Span Programs over Different Fields.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:428-437 [Conf] - Amos Beimel, Yuval Ishai
**Information-Theoretic Private Information Retrieval: A Unified Construction.**[Citation Graph (0, 0)][DBLP] ICALP, 2001, pp:912-926 [Conf] - Amos Beimel, Shlomi Dolev, Noam Singer
**Brief announcement: RT oblivious erasure correcting.**[Citation Graph (0, 0)][DBLP] PODC, 2004, pp:393- [Conf] - Amos Beimel, Lior Malka
**Efficient reliable communication over partially authenticated networks.**[Citation Graph (0, 0)][DBLP] PODC, 2003, pp:233-242 [Conf] - Amos Beimel, Yoav Stahl
**Robust Information-Theoretic Private Information Retrieval.**[Citation Graph (0, 0)][DBLP] SCN, 2002, pp:326-341 [Conf] - Amos Beimel, Matthew K. Franklin
**Edge Eavesdropping Games.**[Citation Graph (0, 0)][DBLP] SCN, 2006, pp:1-17 [Conf] - Amos Beimel
**On Private Computation in Incomplete Networks.**[Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:18-33 [Conf] - Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
**Private approximation of search problems.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:119-128 [Conf] - Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tal Malkin
**One-Way Functions Are Essential for Single-Server Private Information Retrieval.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:89-98 [Conf] - Amos Beimel, Noam Livne
**On Matroids and Non-ideal Secret Sharing.**[Citation Graph (0, 0)][DBLP] TCC, 2006, pp:482-501 [Conf] - Amos Beimel, Tal Malkin
**A Quantitative Approach to Reductions in Secure Computation.**[Citation Graph (0, 0)][DBLP] TCC, 2004, pp:238-257 [Conf] - Amos Beimel, Tamir Tassa, Enav Weinreb
**Characterizing Ideal Weighted Threshold Secret Sharing.**[Citation Graph (0, 0)][DBLP] TCC, 2005, pp:600-619 [Conf] - Amos Beimel, Matthew K. Franklin
**Weakly-Private Secret Sharing Schemes.**[Citation Graph (0, 0)][DBLP] TCC, 2007, pp:253-272 [Conf] - Amos Beimel, Renen Hallak, Kobbi Nissim
**Private Approximation of Clustering and Vertex Cover.**[Citation Graph (0, 0)][DBLP] TCC, 2007, pp:383-403 [Conf] - Amos Beimel, Matthew K. Franklin
**Reliable Communication over Partially Authenticated Networks.**[Citation Graph (0, 0)][DBLP] WDAG, 1997, pp:245-259 [Conf] - Amos Beimel, Eyal Kushilevitz
**Learning Boxes in High Dimension.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1998, v:22, n:1/2, pp:76-90 [Journal] - Amos Beimel, Anna Gál, Mike Paterson
**Lower Bounds for Monotone Span Programs.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1997, v:6, n:1, pp:29-45 [Journal] - Amos Beimel, Lior Malka
**Efficient reliable communication over partially authenticated networks.**[Citation Graph (0, 0)][DBLP] Distributed Computing, 2005, v:18, n:1, pp:1-19 [Journal] - Amos Beimel
**On private computation in incomplete networks.**[Citation Graph (0, 0)][DBLP] Distributed Computing, 2007, v:19, n:3, pp:237-252 [Journal] - Amos Beimel, Yuval Ishai
**Information-Theoretic Private Information Retrieval: A Unified Construction**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:15, pp:- [Journal] - Amos Beimel, Tal Malkin
**A Quantitative Approach to Reductions in Secure Computation**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:086, pp:- [Journal] - Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
**Private Approximation of Search Problems**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:141, pp:- [Journal] - Amos Beimel, Anna Gál, Mike Paterson
**Lower Bounds for Monotone Span Programs**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:1, pp:- [Journal] - Amos Beimel, Felix Geller, Eyal Kushilevitz
**The Query Complexity of Finding Local Minima in the Lattice.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2001, v:171, n:1, pp:69-83 [Journal] - Amos Beimel, Eyal Kushilevitz
**Learning unions of high-dimensional boxes over the reals.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:73, n:5-6, pp:213-220 [Journal] - Amos Beimel, Enav Weinreb
**Monotone circuits for monotone weighted threshold functions.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:97, n:1, pp:12-18 [Journal] - Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
**Learning functions represented as multiplicity automata.**[Citation Graph (0, 0)][DBLP] J. ACM, 2000, v:47, n:3, pp:506-530 [Journal] - Amos Beimel, Anna Gál
**On Arithmetic Branching Programs.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1999, v:59, n:2, pp:195-220 [Journal] - Amos Beimel, Yuval Ishai, Eyal Kushilevitz
**General constructions for information-theoretic private information retrieval.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2005, v:71, n:2, pp:213-247 [Journal] - Amos Beimel, Shlomi Dolev
**Buses for Anonymous Message Delivery.**[Citation Graph (0, 0)][DBLP] J. Cryptology, 2003, v:16, n:1, pp:25-39 [Journal] - Amos Beimel, Yuval Ishai, Tal Malkin
**Reducing the Servers' Computation in Private Information Retrieval: PIR with Preprocessing.**[Citation Graph (0, 0)][DBLP] J. Cryptology, 2004, v:17, n:2, pp:125-151 [Journal] - Amos Beimel, Enav Weinreb
**Separating the Power of Monotone Span Programs over Different Fields.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:34, n:5, pp:1196-1215 [Journal] - Amos Beimel, Mike Burmester, Yvo Desmedt, Eyal Kushilevitz
**Computing Functions of a Shared Secret.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2000, v:13, n:3, pp:324-345 [Journal] - Amos Beimel, Matthew K. Franklin
**Reliable Communication over Partially Authenticated Networks.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:220, n:1, pp:185-210 [Journal] - Amos Beimel, Benny Chor
**Universally ideal secret-sharing schemes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:3, pp:786-794 [Journal] - Amos Beimel, Benny Chor
**Communication in key distribution schemes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:19-28 [Journal] - Amos Beimel, Benny Chor
**Secret Sharing with Public Reconstruction.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:5, pp:1887-1896 [Journal] - Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb
**How Should We Solve Search Problems Privately?**[Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:31-49 [Conf] - Amos Beimel, Yoav Stahl
**Robust Information-Theoretic Private Information Retrieval.**[Citation Graph (0, 0)][DBLP] J. Cryptology, 2007, v:20, n:3, pp:295-321 [Journal] **Distributed Private Data Analysis: Simultaneously Solving How and What.**[Citation Graph (, )][DBLP]**Protocols for Multiparty Coin Toss with Dishonest Majority.**[Citation Graph (, )][DBLP]**Choosing, Agreeing, and Eliminating in Communication Complexity.**[Citation Graph (, )][DBLP]**On Linear Secret Sharing for Connectivity in Directed Graphs.**[Citation Graph (, )][DBLP]**Matroids Can Be Far from Ideal Secret Sharing.**[Citation Graph (, )][DBLP]**Secret Sharing and Non-Shannon Information Inequalities.**[Citation Graph (, )][DBLP]**Bounds on the Sample Complexity for Private Learning and Private Data Release.**[Citation Graph (, )][DBLP]**Approximate belief updating in max-2-connected Bayes networks is NP-hard.**[Citation Graph (, )][DBLP]**Private Approximation of Clustering and Vertex Cover.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |