|
- Secret sharing and non-Shannon information inequalities. (Orlov, Ilan) IEEE Trans. Inform. Theory (2011), Vol 57, Pages 5634–5649
- Secret-sharing schemes: a survey. Lecture Notes in Comput. Sci. (2011), Pages 11–46
- How should we solve search problems privately? (Malkin, Tal; Nissim, Kobbi; Weinreb, Enav) J. Cryptology (2010), Vol 23, Pages 344–371
- Protocols for multiparty coin toss with dishonest majority. (Omri, Eran; Orlov, Ilan) Lecture Notes in Comput. Sci. (2010), Pages 538-557
- Choosing, agreeing, and eliminating in communication complexity. (Ben Daniel, Sebastian; Kushilevitz, Eyal; Weinreb, Enav) Lecture Notes in Comput. Sci. (2010), Pages 451-462
- Matrix columns allocation problems. (Ben-Moshe, Boaz; Ben-Shimol, Yehuda; Carmi, Paz; Chai, Eldad; Kitroser, Itzik; Omri, Eran) Theoret. Comput. Sci. (2009), Vol 410, Pages 2174-2183
- Approximate belief updating in max-2-connected Bayes networks is NP-hard. (Karpas, Erez; Shimony, Solomon Eyal) Artificial Intelligence (2009), Vol 173, Pages 1150-1153
- Private approximation of clustering and vertex cover. (Hallak, Renen; Nissim, Kobbi) Comput. Complexity (2009), Vol 18, Pages 435–494
- Secret sharing and non-Shannon information inequalities. (Orlov, Ilan) Lecture Notes in Comput. Sci. (2009), Pages 539-557
- Private approximation of search problems. (Carmi, Paz; Nissim, Kobbi; Weinreb, Enav) SIAM J. Comput. (2008/09), Vol 38, Pages 1728–1760
- Characterizing ideal weighted threshold secret sharing. (Tassa, Tamir; Weinreb, Enav) SIAM J. Discrete Math. (2008), Vol 22, Pages 360–397
- On matroids and nonideal secret sharing. (Livne, Noam) IEEE Trans. Inform. Theory (2008), Vol 54, Pages 2626-2643
- Distributed private data analysis: simultaneously solving how and what. (Nissim, Kobbi; Omri, Eran) Lecture Notes in Comput. Sci. (2008), Pages 451-468
- Matroids can be far from ideal secret sharing. (Livne, Noam; Padró, Carles) Lecture Notes in Comput. Sci. (2008), Pages 194-212
- Robust information-theoretic private information retrieval. (Stahl, Yoav) J. Cryptology (2007), Vol 20, Pages 295-321
- How should we solve search problems privately? (Malkin, Tal; Nissim, Kobbi; Weinreb, Enav) Lecture Notes in Comput. Sci. (2007), Pages 31–49
- Weakly-private secret sharing schemes. (Franklin, Matthew) Lecture Notes in Comput. Sci. (2007), Pages 253-272
- Private approximation of clustering and vertex cover. (Hallak, Renen; Nissim, Kobbi) Lecture Notes in Comput. Sci. (2007), Pages 383-403
- Monotone circuits for monotone weighted threshold functions. (Weinreb, Enav) Inform. Process. Lett. (2006), Vol 97, Pages 12-18
- On matroids and non-ideal secret sharing. (Livne, Noam) Lecture Notes in Comput. Sci. (2006), Pages 482-501
- Private approximation of search problems. (Carmi, Paz; Nissim, Kobbi; Weinreb, Enav) Proceedings of the 38th Annual ACM Symposium on Theory of Computing (2006), Pages 119-128
- General constructions for information-theoretic private information retrieval. (Ishai, Yuval; Kushilevitz, Eyal) J. Comput. System Sci. (2005), Vol 71, Pages 213-247
- Separating the power of monotone span programs over different fields. (Weinreb, Enav) SIAM J. Comput. (2005), Vol 34, Pages 1196-1215
- Characterizing ideal weighted threshold secret sharing. (Tassa, Tamir; Weinreb, Enav) Lecture Notes in Comput. Sci. (2005), Pages 600-619
- On the power of nonlinear secret-sharing. (Ishai, Yuval) SIAM J. Discrete Math. (2005), Vol 19, Pages 258-280
- On private computation in incomplete networks. Lecture Notes in Comput. Sci. (2005), Pages 18-33
- Reducing the servers' computation in private information retrieval: PIR with preprocessing. (Ishai, Yuval; Malkin, Tal) J. Cryptology (2004), Vol 17, Pages 125-151
- A quantitative approach to reductions in secure computation. (Malkin, Tal) Lecture Notes in Comput. Sci. (2004), Pages 238-257
- Buses for anonymous message delivery. (Dolev, Shlomi) J. Cryptology (2003), Vol 16, Pages 25-39
- The query complexity of finding local minima in the lattice. (Geller, Felix; Kushilevitz, Eyal) Inform. and Comput. (2001), Vol 171, Pages 69-83
- Information-theoretic private information retrieval: a unified construction (extended abstract). (Ishai, Yuval) Lecture Notes in Comput. Sci. (2001), Pages 912–926
- Learning unions of high-dimensional boxes over the reals. (Kushilevitz, Eyal) Inform. Process. Lett. (2000), Vol 73, Pages 213–220
- Learning functions represented as multiplicity automata. (Bergadano, Francesco; Bshouty, Nader H.; Kushilevitz, Eyal; Varricchio, Stefano) J. ACM (2000), Vol 47, Pages 506-530
- Computing functions of a shared secret. (Burmester, Mike; Desmedt, Yvo; Kushilevitz, Eyal) SIAM J. Discrete Math. (2000), Vol 13, Pages 324–345
- Reducing the servers computation in private information retrieval: PIR with preprocessing. (Ishai, Yuval; Malkin, Tal) Lecture Notes in Comput. Sci. (2000), Pages 55-73
- Reliable communication over partially authenticated networks. (Franklin, Matthew) Theoret. Comput. Sci. (1999), Vol 220, Pages 185-210
- On arithmetic branching programs. (Gál, Anna) J. Comput. System Sci. (1999), Vol 59, Pages 195-220
- The all-or-nothing nature of two-party secure computation. (Malkin, Tal; Micali, Silvio) Lecture Notes in Comput. Sci. (1999), Pages 80-97
- One-way functions are essential for single-server private information retrieval. (Ishai, Yuval; Kushilevitz, Eyal; Malkin, Tal) Annual ACM Symposium on Theory of Computing (1999), Pages 89-98
- Learning boxes in high dimension. (Kushilevitz, E.) Algorithmica (1998), Vol 22, Pages 76-90
- On arithmetic branching programs. (Gál, Anna) Thirteenth Annual IEEE Conference on Computational Complexity (1998), Pages 68–80
- Secret sharing with public reconstruction. (Chor, Benny) IEEE Trans. Inform. Theory (1998), Vol 44, Pages 1887-1896
- The query complexity of finding local minima in the lattice. (Geller, Felix; Kushilevitz, Eyal) Proceedings of the Eleventh Annual Conference on Computational Learning Theory (1998), Pages 294-302
- Learning boxes in high dimension. (Kushilevitz, Eyal) Lecture Notes in Comput. Sci. (1997), Pages 3-15
- Lower bounds for monotone span programs. (Gál, Anna; Paterson, Mike) Comput. Complexity (1996/97), Vol 6, Pages 29-45
- Communication in key distribution schemes. (Chor, Benny) IEEE Trans. Inform. Theory (1996), Vol 42, Pages 19-28
- On the applications of multiplicity automata in learning. (Bergadano, Francesco; Bshouty, Nader H.; Kushilevitz, Eyal; Varricchio, Stefano) 37th Annual Symposium on Foundations of Computer Science (1996), Pages 349-358
- Universally ideal secret-sharing schemes. (Chor, Benny) IEEE Trans. Inform. Theory (1994), Vol 40, Pages 786-794
|
