Amos Beimel
Amos Beimel
Dirección de correo verificada de bgu.ac.il
Título
Citado por
Citado por
Año
Secure schemes for secret sharing and key distribution
A Beimel
Technion-Israel Institute of technology, Faculty of computer science, 1996
9611996
Secret-sharing schemes: A survey
A Beimel
International conference on coding and cryptology, 11-46, 2011
5372011
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
2892002
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
195*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
178*2004
Distributed private data analysis: Simultaneously solving how and what
A Beimel, K Nissim, E Omri
Annual International Cryptology Conference, 451-468, 2008
1672008
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
163*2000
Characterizing ideal weighted threshold secret sharing
A Beimel, T Tassa, E Weinreb
SIAM Journal on Discrete Mathematics 22 (1), 360-397, 2008
1562008
Bounds on the sample complexity for private learning and private data release
A Beimel, H Brenner, SP Kasiviswanathan, K Nissim
Machine learning 94 (3), 401-437, 2014
155*2014
Universally ideal secret-sharing schemes
A Beimel, B Chor
IEEE Transactions on Information Theory 40 (3), 786-794, 1994
1411994
Buses for Anonymous Message Delivery.
A Beimel, S Dolev
Journal of Cryptology 16 (1), 2003
1392003
Private learning and sanitization: Pure vs. approximate differential privacy
A Beimel, K Nissim, U Stemmer
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2013
1242013
Robust information-theoretic private information retrieval
A Beimel, Y Stahl
Journal of Cryptology 20 (3), 295-321, 2007
119*2007
Lower bounds for monotone span programs
A Beimel, A Gál, M Paterson
Computational Complexity 6 (1), 29-45, 1996
911996
RT oblivious erasure correcting
A Beimel, S Dolev, N Singer
IEEE/ACM Transactions on Networking 15 (6), 1321-1332, 2007
872007
System for reconstruction of a secret shared by a plurality of participants
A Beimel, BZ Chor
US Patent 5,764,767, 1998
861998
Communication in key distribution schemes
A Beimel, B Chor
IEEE Transactions on Information Theory 42 (1), 19-28, 1996
86*1996
The all-or-nothing nature of two-party secure computation
A Beimel, T Malkin, S Micali
Annual International Cryptology Conference, 80-97, 1999
771999
On the power of nonlinear secret-sharing
A Beimel, Y Ishai
Proceedings 16th annual IEEE conference on computational complexity, 188-202, 2001
76*2001
One-way functions are essential for single-server private information retrieval
A Beimel, Y Ishai, E Kushilevitz, T Malkin
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
741999
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20