Kobbi Nissim

	2009
36		Dan Feldman, Amos Fiat, Haim Kaplan, Kobbi Nissim: Private coresets. STOC 2009: 361-370
	2008
35		Amos Beimel, Kobbi Nissim, Eran Omri: Distributed Private Data Analysis: Simultaneously Solving How and What. CRYPTO 2008: 451-468
34		Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: What Can We Learn Privately? FOCS 2008: 531-540
33		Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: What Can We Learn Privately? CoRR abs/0803.0924: (2008)
32		Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private Approximation of Search Problems. SIAM J. Comput. 38(5): 1728-1760 (2008)
	2007
31		Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb: How Should We Solve Search Problems Privately? CRYPTO 2007: 31-49
30		Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: Smooth sensitivity and sampling in private data analysis. STOC 2007: 75-84
29		Amos Beimel, Renen Hallak, Kobbi Nissim: Private Approximation of Clustering and Vertex Cover. TCC 2007: 383-403
28		Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh: Communication vs. Computation. Computational Complexity 16(1): 1-33 (2007)
	2006
27		Ilya Mironov, Anton Mityagin, Kobbi Nissim: Hard Instances of the Constrained Discrete Logarithm Problem. ANTS 2006: 582-598
26		Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private approximation of search problems. STOC 2006: 119-128
25		Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam Smith: Calibrating Noise to Sensitivity in Private Data Analysis. TCC 2006: 265-284
24		Kobbi Nissim, Enav Weinreb: Communication Efficient Secure Linear Algebra. TCC 2006: 522-541
23		Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright: Secure multiparty computation of approximations. ACM Transactions on Algorithms 2(3): 435-472 (2006)
22		Ilya Mironov, Anton Mityagin, Kobbi Nissim: Hard Instances of the Constrained Discrete Logarithm Problem CoRR abs/math/0606771: (2006)
	2005
21		Krishnaram Kenthapadi, Nina Mishra, Kobbi Nissim: Simulatable auditing. PODS 2005: 118-127
20		Avrim Blum, Cynthia Dwork, Frank McSherry, Kobbi Nissim: Practical privacy: the SuLQ framework. PODS 2005: 128-138
19		Dan Boneh, Eu-Jin Goh, Kobbi Nissim: Evaluating 2-DNF Formulas on Ciphertexts. TCC 2005: 325-341
18		Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private Approximation of Search Problems Electronic Colloquium on Computational Complexity (ECCC)(141): (2005)
	2004
17		Cynthia Dwork, Kobbi Nissim: Privacy-Preserving Datamining on Vertically Partitioned Databases. CRYPTO 2004: 528-544
16		Michael J. Freedman, Kobbi Nissim, Benny Pinkas: Efficient Private Matching and Set Intersection. EUROCRYPT 2004: 1-19
15		Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh: Communication Versus Computation. ICALP 2004: 745-756
14		Yair Bartal, Alain J. Mayer, Kobbi Nissim, Avishai Wool: Firmato: A novel firewall management toolkit. ACM Trans. Comput. Syst. 22(4): 381-420 (2004)
	2003
13		Yuval Ishai, Joe Kilian, Kobbi Nissim, Erez Petrank: Extending Oblivious Transfers Efficiently. CRYPTO 2003: 145-161
12		Irit Dinur, Kobbi Nissim: Revealing information while preserving privacy. PODS 2003: 202-210
11		Uriel Feige, Robert Krauthgamer, Kobbi Nissim: On Cutting a Few Vertices from a Graph. Discrete Applied Mathematics 127(3): 643-649 (2003)
	2001
10		Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright: Secure Multiparty Computation of Approximations. ICALP 2001: 927-938
9		Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz, Kobbi Nissim: Private approximation of NP-hard functions. STOC 2001: 550-559
8		Moni Naor, Kobbi Nissim: Communication preserving protocols for secure function evaluation. STOC 2001: 590-599
7		Moni Naor, Kobbi Nissim: Communication Complexity and Secure Function Evaluation CoRR cs.CR/0109011: (2001)
6		Moni Naor, Kobbi Nissim: Communication Complexity and Secure Function Evaluation Electronic Colloquium on Computational Complexity (ECCC) 8(062): (2001)
	2000
5		Uriel Feige, Michael Langberg, Kobbi Nissim: On the hardness of approximating N P witnesses. APPROX 2000: 120-131
4		Uriel Feige, Robert Krauthgamer, Kobbi Nissim: Approximating the minimum bisection size (extended abstract). STOC 2000: 530-536
	1999
3		Ran Canetti, Tal Malkin, Kobbi Nissim: Efficient Communication-Storage Tradeoffs for Multicast Encryption. EUROCRYPT 1999: 459-474
2		Yair Bartal, Alain J. Mayer, Kobbi Nissim, Avishai Wool: Firmato: A Novel Firewall Management Toolkit. IEEE Symposium on Security and Privacy 1999: 17-31
1		Vinod Anupam, Alain J. Mayer, Kobbi Nissim, Benny Pinkas, Michael K. Reiter: On the Security of Pay-per-Click and Other Web Advertising Schemes. Computer Networks 31(11-16): 1091-1100 (1999)

Coauthor Index

1	Vinod Anupam	[1]
2	Yair Bartal	[2] [14]
3	Amos Beimel	[18] [26] [29] [31] [32] [35]
4	Avrim Blum	[20]
5	Dan Boneh	[19]
6	Ran Canetti	[3]
7	Paz Carmi	[18] [26] [32]
8	Irit Dinur	[12]
9	Cynthia Dwork	[17] [20] [25]
10	Uriel Feige	[4] [5] [11]
11	Joan Feigenbaum	[10] [23]
12	Dan Feldman	[36]
13	Amos Fiat	[36]
14	Michael J. Freedman	[16]
15	Eu-Jin Goh	[19]
16	Shai Halevi	[9]
17	Renen Hallak	[29]
18	Prahladh Harsha	[15] [28]
19	Yuval Ishai	[10] [13] [15] [23] [28]
20	Haim Kaplan	[36]
21	Shiva Prasad Kasiviswanathan	[33] [34]
22	Krishnaram Kenthapadi	[21]
23	Joe Kilian	[13] [15] [28]
24	Robert Krauthgamer	[4] [9] [11]
25	Eyal Kushilevitz	[9]
26	Michael Langberg	[5]
27	Homin K. Lee	[33] [34]
28	Tal Malkin	[3] [10] [23] [31]
29	Alain J. Mayer	[1] [2] [14]
30	Frank McSherry	[20] [25]
31	Ilya Mironov	[22] [27]
32	Nina Mishra	[21]
33	Anton Mityagin	[22] [27]
34	Moni Naor	[6] [7] [8]
35	Eran Omri	[35]
36	Erez Petrank	[13]
37	Benny Pinkas	[1] [16]
38	Sofya Raskhodnikova	[30] [33] [34]
39	Michael K. Reiter	[1]
40	Adam Smith	[25] [30] [33] [34]
41	Martin Strauss (Martin J. Strauss)	[10] [23]
42	Srinivasan Venkatesh	[15] [28]
43	Enav Weinreb	[18] [24] [26] [31] [32]
44	Avishai Wool	[2] [14]
45	Rebecca N. Wright	[10] [23]

Colors in the list of coauthors