Ph.D. Kobbi Nissim Kobliner
Born: 1965, Israel
Academic Qualifications:
    Ph.D. 2001, Weizmann Institute of Science.
Academic Positions:
Department of Computer Sciences - Associate Professor
Research Interests:
Cryptography, Cryptographic Protocols, Data privacy, Theory of Computation
Research Projects:
"Towards Foundations for Data Privacy". Funded by ISF grant no. 860/06.
Patents:
  • A. Blum, C. Dwork, F. McSherry, and K. Nissim, Private clustering and statistical queries while analyzing a large database, US Patent no. 20060200431, 2006
  • C. Dwork, K. Nissim, Preserving privacy when statistically analyzing a large database, US Patent no. 20060161527, 2006
  • M. Naor and K. Nissim, Method for authentication item, US Patent no. 6,226,743, 2001
Abstracts of Current Research:
  • See my homepage: : www.cs.bgu.ac.il/~kobbi
Publications:
  • S. Kasiviswanathan, H. K. Lee, K. Nissim, S. Raskhodnikova, and A. Smith.. What Can We Learn Privately? Symposium on Foundations of Computer Science (FOCS) : (2008)
  • A. beimel, K. Nissim, and E. Omri. Distributed Private Data Analysis: Simultaneously Solving How and What. CRYPTO : (2008)
  • K. Nissim, S. Raskhodnikova and Adam Smith. . Smooth Sensitivity and Sampling in Private Data Analysis. Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC) : 75–84 (2007)
  • Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, and S. Venkatesh. . Communication Versus Computation. Computational Complexity Vol. 16, No. 1 (May 2007): 1-33 (2007)
  • A. Beimel, R. Hallak, and K. Nissim. . Private Approximation of Clustering and Vertex Cover. Proceedings of the 4th Theory of Cryptography Conference (TCC) LNCS 4392: 383–403 (2007)
  • A. Beimel, T. Malkin, K. Nissim, and E. Weinreb. How Should We Solve Search Problems Privately? Proceedings of the 27th Annual International Cryptology Conference (CRYPTO) : pp. 31–49 (2007)
  • I. Mironov, A. Mityagin, and K. Nissim. . Hard Instances of the Constrained Discrete Logarithm Problem. ANTS : 582-598 (2006)
  • A. Beimel, P. Carmi, K. Nissim, and Enav Weinreb. . Private Approximation of Search Problems. Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC) : 119-128 (2006)
  • K. Nissim and E. Weinreb. . Communication Efficient Secure Linear Algebra. Proceedings of the 3rd Theory of Cryptography Conference (TCC) : 522-541 (2006)
  • C. Dwork, F. McSherry, K. Nissim, and A. Smith. . Calibrating Noise to Sensitivity in Private Data Analysis. Proceedings of the 3rd Theory of Cryptography Conference (TCC) : 265-284 (2006)
  • J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. Strauss and R. N. Wright. . Secure Multiparty Computation of Approximations. ACM Transactions on Algorithms (TALG) Vol. 2, No. 3 (July 2006): 435 – 472 (2006)
Keywords:computer science - theory, Privacy, Cryptography.
Links:Publication list:
Personal Homepage
Phones:
  1. Phone: 972-8-6477879
Email:kobbi@cs.bgu.ac.il