Prof. Kobbi Nissim

kobbi foto Associate professor

Contacts

Email:
Homepage:
Office: 208 in 37 building
Phone number: 08-6477879
Fax number: 08-6477650
Box number: 53

Teaching

Fall 2011-2012 20212011 Automata and Formal Languages
Fall 2011-2012 20215711 Elements of Privacy and Computational Learning
Fall 2011-2012 20225751 Advanced Topics in Privacy and Computational Learning
Spring 2012 20215351 Cryptography
Fall 2008-2009 20221111 Complexity
Fall 2008-2009 20212011 Automata and Formal Languages
Spring 2009 20215461 Topics in the Frontiers of Computer Science for Honor Students
Spring 2009 20225471 Advanced Topics in Complexity and Algorithms
Fall 2007-2008 20212011 Automata and Formal Languages
Fall 2007-2008 20221111 Complexity
Spring 2008 20225001 Privacy and Secure Computation
Spring 2008 20012011 Automata and Formal Languages for IAF
Fall 2006-2007 20212011 Automata and Formal Languages
Spring 2007 20221521 Advanced Seminar B
Spring 2007 20221111 Complexity
Spring 2007 20225071 Randomized algorithms and probabilistic methods
Fall 2005-2006 20212011 Automata and Formal Languages
Fall 2005-2006 20221111 Complexity
Spring 2006 20012011 Automata and Formal Languages for IAF
Fall 2004-2005 20212011 Automata and Formal Languages
Spring 2005 20225031 Advanced Cryptography

Research groups

Algorithms
Complexity
Cryptography and security

Education

2001  -  Ph.D  Weizmann Institute of Science, Dept. of Computer Science and Applied Math
Advisor: Prof. Moni Naor

Grants

Towards Foundations for Data Privacy, grant number 860/06, PIs : Kobbi Nissim and Benny Pinkas
October 2006.
Funded by ISF.

Selected publications all BibTex

 
Articles
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, S. Venkatesh. Communication Versus computation. Computational Complexity. Accepted For Publication.
J. Feigenbaum, Y. Ishai, T. Malkin, M. Strauss, R.M. Wright. Secure Multiparty Computation of Approximations. Transactions on Algorithms (TALG), 2(3):435-472, ACM, July 2006.
Yair Bartal, Alain J. Mayer, Kobbi Nissim, Avishai Wool. Firmato: A novel firewall management toolkit. ACM Trans. Comput. Syst. , 22(4):381-420 , 2004.
Uriel Feige, Robert Krauthgamer, Kobbi Nissim. On Cutting a Few Vertices from a Graph. Discrete Applied Mathematics, 127(3):643-649, 2003.
Moni Naor, Kobbi Nissim. Certificate Revocation and Certificate Update. IEEE Journal on Selected Areas in Communications, 18(4):561-570, 2000.
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.
 
Conference Articles
Kobbi Nissim, Sofya Raskhodnikova and Adam Smith. Smooth Sensitivity and Sampling in Private Data Analysis. In To appear, STOC 2007..
A. Beimel, R. Hallak, K. Nissim. Private Approximation of Clustering and Vertex Cover. In TCC 2007.
Cynthia Dwork and Frank McSherry and Kobbi Nissim and Adam Smith. Calibrating Noise to Sensitivity in Private Data Analysis. In To appear, TCC 2006., Shai Halevi and Tal Rabin editor, vol. 3876 of Lecture Notes in Computer Science, 265-284, Springer, 2006.
I. Mironov, A. Mityagin, K. Nissim. Hard Instances of the Constrained Discrete Logarithm Problem. In ANTS VII, pages 582-598, 2006.
Kobbi Nissim and Enav Weinreb. Communication Efficient Secure Linear Algebra. In To appear, TCC 2006., Shai Halevi and Tal Rabin editor, vol. 3876 of Lecture Notes in Computer Science, 522-541, Springer, 2006.
Amos Beimel, Paz Carmi, Kobbi Nissim and Enav Weinreb. Private Approximation of Search Problems. In to appear. STOC 2006., J. Kleingerg editor, pages 119-128, 2006.
Krishnaram Kenthapadi, Nina Mishra, Kobbi Nissim. Simulatable Auditing. In PODS , 2005.
Kobbi Nissim, Roie Zivan. Secure DisCSP Protocols - From Centralized Towards Distributed Solutions. In Distributed Constraint Reasoning (DCR), 2005.
Dan Boneh, Eu-Jin Goh, Kobbi Nissim. Evaluating 2-DNF Formulas on Ciphertexts. In Second Theory of Cryptography Conference, TCC, vol. 3378 of LNCS, 325-341, 2005.
Avrim Blum, Cynthia Dwork, Frank McSherry, Kobbi Nissim. Practical Privacy: The SuLQ Framework. In PODS, 2005.
Michael J. Freedman, Kobbi Nissim, Benny Pinkas. Efficient Private Matching and Set Intersection. In EUROCRYPT, vol. 3027 of LNCS, 1-19, 2004.
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, S. Venkatesh. Communication Versus Computation. In ICALP , vol. 3142 of LNCS, 745-756, 2004.
Cynthia Dwork, Kobbi Nissim. Privacy-Preserving Datamining on Vertically Partitioned Databases. In CRYPTO , vol. 3152 of LNCS, 528-544, 2004.
Yuval Ishai, Joe Kilian, Kobbi Nissim, Erez Petrank. Extending Oblivious Transfers Efficiently. In CRYPTO, vol. 2729 of LNCS, 145-161, 2003.
Irit Dinur, Kobbi Nissim. Revealing information while preserving privacy. In Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 202-210, 2003.
Moni Naor, Kobbi Nissim. Communication preserving protocols for secure function evaluation. In STOC , pages 590-599, 2001.
Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz, Kobbi Nissim. Private approximation of NP-hard functions. In STOC , pages 550-559, 2001.
Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright. Secure Multiparty Computation of Approximations. In ICALP , vol. 2076 of LNCS, 927-938, 2001.
Uriel Feige, Michael Langberg, Kobbi Nissim. On the hardness of approximating NP witnesses. In APPROX , vol. 1913 of LNCS, 120-131, 2000.
Uriel Feige, Robert Krauthgamer, Kobbi Nissim. Approximating the minimum bisection size. In STOC , pages 530-536, 2000.
Yair Bartal, Alain J. Mayer, Kobbi Nissim, Avishai Wool. Firmato: A Novel Firewall Management Toolkit. In IEEE Symposium on Security and Privacy , pages 17-31, 1999.
Ran Canetti, Tal Malkin, Kobbi Nissim. Efficient Communication-Storage Tradeoffs for Multicast Encryption. In EUROCRYPT , vol. 1592 of LNCS, 459-474, 1999.
M. Naor, K. Nissim. Certificate Revocation and Certificate Update. In 7th USENIX Security Symposium, 1998.
 
Unpublished
C. Dwork, K. Nissim, M. Naor, M. Langberg, O. Reingold. Succinct Proofs for NP and Spooky Interactions. .
N. Mishra, K. Nissim. How Auditors May Inadvertently Compromise Your Privacy – Position Paper. , 2004. PORTIA Workshop on Sensitive Data in Medical, Financial, and Content-Distribution Systems, Stanford.