Travelled to:1 × Finland
2 × Greece
6 × USA
Collaborated with:R.Krauthgamer I.Dinur M.Naor Y.Ishai S.Raskhodnikova A.Smith K.Kenthapadi N.Mishra U.Feige D.Feldman A.Fiat H.Kaplan A.Beimel P.Carmi E.Weinreb A.Blum C.Dwork F.McSherry S.Halevi E.Kushilevitz P.Harsha J.Kilian S.Venkatesh J.Feigenbaum T.Malkin M.Strauss R.N.Wright
Talks about:approxim (4) privat (4) function (2) communic (2) privaci (2) preserv (2) comput (2) secur (2) multiparti (1) framework (1)
Person: Kobbi Nissim
DBLP: Nissim:Kobbi
Contributed to:
200920072006
2005
20042003200120012000Wrote 11 papers:
- STOC-2009-FeldmanFKN
- Private coresets (DF, AF, HK, KN), pp. 361–370.
- STOC-2007-NissimRS #data analysis
- Smooth sensitivity and sampling in private data analysis (KN, SR, AS), pp. 75–84.
- STOC-2006-BeimelCNW #approximate #problem
- Private approximation of search problems (AB, PC, KN, EW), pp. 119–128.
- PODS-2005-BlumDMN #framework #privacy
- Practical privacy: the SuLQ framework (AB, CD, FM, KN), pp. 128–138.
- PODS-2005-KenthapadiMN
- Simulatable auditing (KK, NM, KN), pp. 118–127.
- ICALP-2004-HarshaIKNV #communication
- Communication Versus Computation (PH, YI, JK, KN, SV), pp. 745–756.
- PODS-2003-DinurN #privacy
- Revealing information while preserving privacy (ID, KN), pp. 202–210.
- ICALP-2001-FeigenbaumIMNSW #approximate #multi
- Secure Multiparty Computation of Approximations (JF, YI, TM, KN, MS, RNW), pp. 927–938.
- STOC-2001-HaleviKKN #approximate #np-hard
- Private approximation of NP-hard functions (SH, RK, EK, KN), pp. 550–559.
- STOC-2001-NaorN #communication #evaluation #protocol
- Communication preserving protocols for secure function evaluation (MN, KN), pp. 590–599.
- STOC-2000-FeigeKN #approximate
- Approximating the minimum bisection size (UF, RK, KN), pp. 530–536.