His primary scientific interests are in Theoretical computer science, Differential privacy, Algorithm, Function and Data mining. His Theoretical computer science research is multidisciplinary, relying on both Random oracle, Instance-based learning, Statistical database and Secure two-party computation. His research in Random oracle intersects with topics in Homomorphic encryption, Attribute-based encryption, Oblivious transfer and Zero-knowledge proof.
His Differential privacy study combines topics in areas such as Probably approximately correct learning, Algorithmic learning theory, Concept class, Local algorithm and Optimization problem. His work in Algorithm covers topics such as Row which are related to areas like Sublinear function and Query optimization. His work carried out in the field of Data mining brings together such families of science as Efficient algorithm, Cluster analysis, Information privacy and Minimum spanning tree.
His main research concerns Differential privacy, Theoretical computer science, Discrete mathematics, Function and Combinatorics. His Differential privacy study is concerned with Data mining in general. His biological study deals with issues like Information privacy, which deal with fields such as Confidentiality and Database.
His studies deal with areas such as Computation and Protocol as well as Theoretical computer science. His Discrete mathematics research incorporates elements of Cluster analysis and Cryptography. His Algorithm study frequently links to adjacent areas such as Row.
His primary areas of study are Differential privacy, Discrete mathematics, Theoretical computer science, Range and Shuffling. His studies in Differential privacy integrate themes in fields like Machine learning, Protocol and Artificial intelligence. He combines subjects such as Key and Security parameter with his study of Discrete mathematics.
Many of his studies involve connections with topics such as Sample and Theoretical computer science. His Range research includes themes of Boolean circuit and Probabilistic logic. His Shuffling research includes elements of Binary logarithm, Reduction and Matching.
Shuffling, Discrete mathematics, Binary logarithm, Differential privacy and Context are his primary areas of study. In his works, Kobbi Nissim conducts interdisciplinary research on Discrete mathematics and Omega. Kobbi Nissim conducts interdisciplinary study in the fields of Binary logarithm and Bounded function through his works.
Among his research on Bounded function, you can see a combination of other fields of science like Reduction, Mean squared error, Protocol, Arithmetic and Log-log plot. His Differential privacy research integrates issues from Block and Combinatorics. Kobbi Nissim incorporates a variety of subjects into his writings, including Context, Theoretical computer science, ENCODE, Core and Dependency.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Calibrating noise to sensitivity in private data analysis
Cynthia Dwork;Frank Mcsherry;Kobbi Nissim;Adam Smith.
Lecture Notes in Computer Science (2006)
Calibrating noise to sensitivity in private data analysis
Cynthia Dwork;Frank Mcsherry;Kobbi Nissim;Adam Smith.
Lecture Notes in Computer Science (2006)
Evaluating 2-DNF formulas on ciphertexts
Dan Boneh;Eu-Jin Goh;Kobbi Nissim.
theory of cryptography conference (2005)
Evaluating 2-DNF formulas on ciphertexts
Dan Boneh;Eu-Jin Goh;Kobbi Nissim.
theory of cryptography conference (2005)
Efficient private matching and set intersection
Michael J. Freedman;Kobbi Nissim;Benny Pinkas.
Lecture Notes in Computer Science (2004)
Efficient private matching and set intersection
Michael J. Freedman;Kobbi Nissim;Benny Pinkas.
Lecture Notes in Computer Science (2004)
Revealing information while preserving privacy
Irit Dinur;Kobbi Nissim.
symposium on principles of database systems (2003)
Revealing information while preserving privacy
Irit Dinur;Kobbi Nissim.
symposium on principles of database systems (2003)
Smooth sensitivity and sampling in private data analysis
Kobbi Nissim;Sofya Raskhodnikova;Adam Smith.
symposium on the theory of computing (2007)
Smooth sensitivity and sampling in private data analysis
Kobbi Nissim;Sofya Raskhodnikova;Adam Smith.
symposium on the theory of computing (2007)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Ben-Gurion University of the Negev
Boston University
Harvard University
Harvard University
Technion – Israel Institute of Technology
Weizmann Institute of Science
Columbia University
Bar-Ilan University
Technion – Israel Institute of Technology
Materialize, Inc.
National Taiwan University
University of Georgia
Lund University
Utah State University
JSR (Japan)
University of California, Berkeley
University of Regensburg
United States Department of the Army
National Institute of Water and Atmospheric Research
European Centre for Medium-Range Weather Forecasts
University of Victoria
University of Iowa
Washington University in St. Louis
Johns Hopkins University
University of California, Berkeley
University of Hawaii System