Get started
Author

Amos Beimel

Secure schemes for secret sharing and key distribution
1996 · Amos Beimel · Medical Entomology and Zoology · 767
Secret-Sharing Schemes: A Survey
2011 · Amos Beimel · Lecture notes in computer science · 652
Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval
2003 · A. Beimel, Y. Ishai, et al. · 218
Distributed Private Data Analysis: Simultaneously Solving How and What
2008 · Amos Beimel, Kobbi Nissim, et al. · Lecture notes in computer science · 148
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
2000 · Amos Beimel, Yuval Ishai, et al. · Lecture notes in computer science · 140
Buses for Anonymous Message Delivery
2003 · Beimel, Dolev · Journal of Cryptology · 123
PDF
Learning functions represented as multiplicity automata
2000 · Amos Beimel, Francesco Bergadano, et al. · Journal of the ACM · 120
PDF
Universally ideal secret-sharing schemes
1994 · A. Beimel, B. Chor · IEEE Transactions on Information Theory · 111
General constructions for information-theoretic private information retrieval
2005 · Amos Beimel, Yuval Ishai, et al. · Journal of Computer and System Sciences · 110
PDF
Information-Theoretic Private Information Retrieval: A Unified Construction
2001 · Amos Beimel, Yuval Ishai · Lecture notes in computer science · 110
Bounds on the Sample Complexity for Private Learning and Private Data Release
2010 · Amos Beimel, Shiva Prasad Kasiviswanathan, et al. · Lecture notes in computer science · 86
Characterizing Ideal Weighted Threshold Secret Sharing
2008 · Amos Beimel, Tamir Tassa, et al. · SIAM Journal on Discrete Mathematics · 82
Reducing the Servers’ Computation in Private Information Retrieval: PIR with Preprocessing
2004 · Amos Beimel, Yuval Ishai, et al. · Journal of Cryptology · 82
PDF
Non-Interactive Secure Multiparty Computation
2014 · Amos Beimel, Ariel Gabizon, et al. · Lecture notes in computer science · 78
RT Oblivious Erasure Correcting
2007 · A. Beimel, S. Dolev, et al. · IEEE/ACM Transactions on Networking · 73
Bounds on the sample complexity for private learning and private data release
2013 · Amos Beimel, Hai Brenner, et al. · Machine Learning · 70
PDF
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
2013 · Amos Beimel, Kobbi Nissim, et al. · Lecture notes in computer science · 68
PDF
The All-or-Nothing Nature of Two-Party Secure Computation
1999 · Amos Beimel, Tal Malkin, et al. · Lecture notes in computer science · 66
PDF
Share Conversion and Private Information Retrieval
2012 · Amos Beimel, Yuval Ishai, et al. · Proceedings - IEEE Conference on Computational Complexity/Proceedings · 64
Characterizing Ideal Weighted Threshold Secret Sharing
2005 · Amos Beimel, Tamir Tassa, et al. · Lecture notes in computer science · 64
PDF
Lower bounds for monotone span programs
1996 · Amos Beimel, Anna G�l, et al. · Computational Complexity · 64
On the Cryptographic Complexity of the Worst Functions
2014 · Amos Beimel, Yuval Ishai, et al. · Lecture notes in computer science · 61
PDF
One-way functions are essential for single-server private information retrieval
1999 · Amos Beimel, Yuval Ishai, et al. · ACM Symposium on Theory of Computing (STOC) · 61
PDF
Robust Information-Theoretic Private Information Retrieval
2007 · Amos Beimel, Yoav Stahl · Journal of Cryptology · 60
PDF
Robust Information-Theoretic Private Information Retrieval
2003 · Amos Beimel, Yoav Stahl · Lecture notes in computer science · 60
Works count: 172
Citation count: 5,100
H-index: 35
I10-index: 73
Year
Topic
Type