dblp.uni-trier.dewww.uni-trier.de

Kobbi Nissim

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

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

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

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)