Follow
Amos Beimel
Amos Beimel
Verified email at bgu.ac.il
Title
Cited by
Cited by
Year
Secure schemes for secret sharing and key distribution
A Beimel
Technion-Israel Institute of technology, Faculty of computer science, 1996
10271996
Secret-sharing schemes: A survey
A Beimel
Coding and Cryptology: Third International Workshop, IWCC 2011, Qingdao …, 2011
6852011
Breaking the o (n/sup 1/(2k-1)/) barrier for information-theoretic private information retrieval
A Beimel, Y Ishai, E Kushilevitz, JF Raymond
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002
3132002
General constructions for information-theoretic private information retrieval
A Beimel, Y Ishai, E Kushilevitz
Journal of Computer and System Sciences 71 (2), 213-247, 2005
216*2005
Reducing the servers' computation in private information retrieval: PIR with preprocessing
A Beimel, Y Ishai, T Malkin
Journal of Cryptology 17 (2), 125-151, 2004
216*2004
Bounds on the sample complexity for private learning and private data release
A Beimel, H Brenner, SP Kasiviswanathan, K Nissim
Machine learning 94, 401-437, 2014
2042014
Distributed Private Data Analysis: Simultaneously Solving How and What.
A Beimel, K Nissim, E Omri
CRYPTO 5157, 451-468, 2008
1932008
Learning functions represented as multiplicity automata
A Beimel, F Bergadano, NH Bshouty, E Kushilevitz, S Varricchio
Journal of the ACM (JACM) 47 (3), 506-530, 2000
178*2000
Private learning and sanitization: Pure vs. approximate differential privacy
A Beimel, K Nissim, U Stemmer
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2013
1722013
Characterizing ideal weighted threshold secret sharing
A Beimel, T Tassa, E Weinreb
SIAM Journal on Discrete Mathematics 22 (1), 360-397, 2008
1702008
Universally ideal secret-sharing schemes
A Beimel, B Chor
IEEE Transactions on Information Theory 40 (3), 786-794, 1994
154*1994
Buses for anonymous message delivery.
A Beimel, S Dolev
Journal of Cryptology 16 (1), 2003
1502003
Robust information-theoretic private information retrieval
A Beimel, Y Stahl
Journal of Cryptology 20, 295-321, 2007
132*2007
System for reconstruction of a secret shared by a plurality of participants
A Beimel, BZ Chor
US Patent 5,764,767, 1998
1161998
Lower bounds for monotone span programs
A Beimel, A Gįl, M Paterson
Computational Complexity 6, 29-45, 1996
961996
Non-interactive secure multiparty computation
A Beimel, A Gabizon, Y Ishai, E Kushilevitz, S Meldgaard, ...
Advances in Cryptology–CRYPTO 2014: 34th Annual Cryptology Conference, Santa …, 2014
922014
RT oblivious erasure correcting
A Beimel, S Dolev, N Singer
IEEE/ACM Transactions on Networking 15 (6), 1321-1332, 2007
922007
Communication in key distribution schemes
A Beimel, B Chor
IEEE Transactions on Information Theory 42 (1), 19-28, 1996
91*1996
Characterizing the Sample Complexity of Pure Private Learners.
A Beimel, K Nissim, U Stemmer
J. Mach. Learn. Res. 20, 146:1-146:33, 2019
87*2019
The all-or-nothing nature of two-party secure computation
A Beimel, T Malkin, S Micali
Crypto 1666, 80-97, 1999
841999
The system can't perform the operation now. Try again later.
Articles 1–20