The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kobbi Nissim: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ilya Mironov, Anton Mityagin, Kobbi Nissim
    Hard Instances of the Constrained Discrete Logarithm Problem. [Citation Graph (0, 0)][DBLP]
    ANTS, 2006, pp:582-598 [Conf]
  2. Uriel Feige, Michael Langberg, Kobbi Nissim
    On the hardness of approximating N P witnesses. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:120-131 [Conf]
  3. Cynthia Dwork, Kobbi Nissim
    Privacy-Preserving Datamining on Vertically Partitioned Databases. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:528-544 [Conf]
  4. Yuval Ishai, Joe Kilian, Kobbi Nissim, Erez Petrank
    Extending Oblivious Transfers Efficiently. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2003, pp:145-161 [Conf]
  5. Ran Canetti, Tal Malkin, Kobbi Nissim
    Efficient Communication-Storage Tradeoffs for Multicast Encryption. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1999, pp:459-474 [Conf]
  6. Michael J. Freedman, Kobbi Nissim, Benny Pinkas
    Efficient Private Matching and Set Intersection. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:1-19 [Conf]
  7. Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright
    Secure Multiparty Computation of Approximations. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:927-938 [Conf]
  8. Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh
    Communication Versus Computation. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:745-756 [Conf]
  9. Avrim Blum, Cynthia Dwork, Frank McSherry, Kobbi Nissim
    Practical privacy: the SuLQ framework. [Citation Graph (0, 0)][DBLP]
    PODS, 2005, pp:128-138 [Conf]
  10. Irit Dinur, Kobbi Nissim
    Revealing information while preserving privacy. [Citation Graph (0, 0)][DBLP]
    PODS, 2003, pp:202-210 [Conf]
  11. Krishnaram Kenthapadi, Nina Mishra, Kobbi Nissim
    Simulatable auditing. [Citation Graph (0, 0)][DBLP]
    PODS, 2005, pp:118-127 [Conf]
  12. Yair Bartal, Alain J. Mayer, Kobbi Nissim, Avishai Wool
    Firmato: A Novel Firewall Management Toolkit. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 1999, pp:17-31 [Conf]
  13. Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
    Private approximation of search problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:119-128 [Conf]
  14. Uriel Feige, Robert Krauthgamer, Kobbi Nissim
    Approximating the minimum bisection size (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:530-536 [Conf]
  15. Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz, Kobbi Nissim
    Private approximation of NP-hard functions. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:550-559 [Conf]
  16. Moni Naor, Kobbi Nissim
    Communication preserving protocols for secure function evaluation. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:590-599 [Conf]
  17. Kobbi Nissim, Enav Weinreb
    Communication Efficient Secure Linear Algebra. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:522-541 [Conf]
  18. Dan Boneh, Eu-Jin Goh, Kobbi Nissim
    Evaluating 2-DNF Formulas on Ciphertexts. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:325-341 [Conf]
  19. Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam Smith
    Calibrating Noise to Sensitivity in Private Data Analysis. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:265-284 [Conf]
  20. Amos Beimel, Renen Hallak, Kobbi Nissim
    Private Approximation of Clustering and Vertex Cover. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:383-403 [Conf]
  21. Vinod Anupam, Alain J. Mayer, Kobbi Nissim, Benny Pinkas, Michael K. Reiter
    On the Security of Pay-per-Click and Other Web Advertising Schemes. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 1999, v:31, n:11-16, pp:1091-1100 [Journal]
  22. Moni Naor, Kobbi Nissim
    Communication Complexity and Secure Function Evaluation [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  23. Uriel Feige, Robert Krauthgamer, Kobbi Nissim
    On Cutting a Few Vertices from a Graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:127, n:3, pp:643-649 [Journal]
  24. Moni Naor, Kobbi Nissim
    Communication Complexity and Secure Function Evaluation [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:062, pp:- [Journal]
  25. Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
    Private Approximation of Search Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:141, pp:- [Journal]
  26. Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright
    Secure multiparty computation of approximations. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:3, pp:435-472 [Journal]
  27. Yair Bartal, Alain J. Mayer, Kobbi Nissim, Avishai Wool
    Firmato: A novel firewall management toolkit. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Syst., 2004, v:22, n:4, pp:381-420 [Journal]
  28. Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb
    How Should We Solve Search Problems Privately? [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:31-49 [Conf]
  29. Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
    Smooth sensitivity and sampling in private data analysis. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:75-84 [Conf]
  30. Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh
    Communication vs. Computation. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2007, v:16, n:1, pp:1-33 [Journal]
  31. Ilya Mironov, Anton Mityagin, Kobbi Nissim
    Hard Instances of the Constrained Discrete Logarithm Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  32. Distributed Private Data Analysis: Simultaneously Solving How and What. [Citation Graph (, )][DBLP]


  33. What Can We Learn Privately? [Citation Graph (, )][DBLP]


  34. Efficient Set Operations in the Presence of Malicious Adversaries. [Citation Graph (, )][DBLP]


  35. Private coresets. [Citation Graph (, )][DBLP]


  36. Bounds on the Sample Complexity for Private Learning and Private Data Release. [Citation Graph (, )][DBLP]


  37. Private Approximation of Clustering and Vertex Cover. [Citation Graph (, )][DBLP]


  38. What Can We Learn Privately? [Citation Graph (, )][DBLP]


  39. Approximately Optimal Mechanism Design via Differential Privacy [Citation Graph (, )][DBLP]


  40. Impossibility of Differentially Private Universally Optimal Mechanisms [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002