Kobbi Nissim

Alexander Kantor, Kobbi Nissim: Attacks on statistical databases: The highly noisy case. Inf. Process. Lett. 113(12): 409-413 (2013)

Amos Beimel, Kobbi Nissim, Uri Stemmer: Characterizing the sample complexity of private learners. ITCS 2013: 97-110

Shiva Prasad Kasiviswanathan, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: Analyzing Graphs with Node Differential Privacy. TCC 2013: 457-476

Carmit Hazay, Kobbi Nissim: Efficient Set Operations in the Presence of Malicious Adversaries. J. Cryptology 25(3): 383-433 (2012)

Kobbi Nissim, Rann Smorodinsky, Moshe Tennenholtz: Approximately optimal mechanism design via differential privacy. ITCS 2012: 203-213

Kobbi Nissim, Claudio Orlandi, Rann Smorodinsky: Privacy-aware mechanism design. ACM Conference on Electronic Commerce 2012: 774-789

Yehuda Lindell, Kobbi Nissim, Claudio Orlandi: Hiding the Input-Size in Secure Two-Party Computation. IACR Cryptology ePrint Archive 2012: 679 (2012)

Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: What Can We Learn Privately? SIAM J. Comput. 40(3): 793-826 (2011)

Amos Beimel, Kobbi Nissim, Eran Omri: Distributed Private Data Analysis: On Simultaneously Solving How and What. CoRR abs/1103.2626 (2011)

Kobbi Nissim, Claudio Orlandi, Rann Smorodinsky: Privacy-Aware Mechanism Design. CoRR abs/1111.3350 (2011)

Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb: How Should We Solve Search Problems Privately? J. Cryptology 23(2): 344-371 (2010)

Hai Brenner, Kobbi Nissim: Impossibility of Differentially Private Universally Optimal Mechanisms. FOCS 2010: 71-80

Carmit Hazay, Kobbi Nissim: Efficient Set Operations in the Presence of Malicious Adversaries. Public Key Cryptography 2010: 312-331

Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi Nissim: Bounds on the Sample Complexity for Private Learning and Private Data Release. TCC 2010: 437-454

Kobbi Nissim, Rann Smorodinsky, Moshe Tennenholtz: Approximately Optimal Mechanism Design via Differential Privacy. CoRR abs/1004.2888 (2010)

Hai Brenner, Kobbi Nissim: Impossibility of Differentially Private Universally Optimal Mechanisms. CoRR abs/1008.0256 (2010)

Amos Beimel, Renen Hallak, Kobbi Nissim: Private Approximation of Clustering and Vertex Cover. Computational Complexity 18(3): 435-494 (2009)

Dan Feldman, Amos Fiat, Haim Kaplan, Kobbi Nissim: Private coresets. STOC 2009: 361-370

Carmit Hazay, Kobbi Nissim: Efficient Set Operations in the Presence of Malicious Adversaries. IACR Cryptology ePrint Archive 2009: 594 (2009)

Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private Approximation of Search Problems. SIAM J. Comput. 38(5): 1728-1760 (2008)

Amos Beimel, Kobbi Nissim, Eran Omri: Distributed Private Data Analysis: Simultaneously Solving How and What. CRYPTO 2008: 451-468

Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: What Can We Learn Privately? FOCS 2008: 531-540

Kobbi Nissim: Private Data Analysis via Output Perturbation - A Rigorous Approach to Constructing Sanitizers and Privacy Preserving Algorithms. Privacy-Preserving Data Mining 2008: 383-414

Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: What Can We Learn Privately? CoRR abs/0803.0924 (2008)

Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh: Communication vs. Computation. Computational Complexity 16(1): 1-33 (2007)

Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb: How Should We Solve Search Problems Privately? CRYPTO 2007: 31-49

Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: Smooth sensitivity and sampling in private data analysis. STOC 2007: 75-84

Amos Beimel, Renen Hallak, Kobbi Nissim: Private Approximation of Clustering and Vertex Cover. TCC 2007: 383-403

Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright: Secure multiparty computation of approximations. ACM Transactions on Algorithms 2(3): 435-472 (2006)

Ilya Mironov, Anton Mityagin, Kobbi Nissim: Hard Instances of the Constrained Discrete Logarithm Problem. ANTS 2006: 582-598

Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private approximation of search problems. STOC 2006: 119-128

Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam Smith: Calibrating Noise to Sensitivity in Private Data Analysis. TCC 2006: 265-284

Kobbi Nissim, Enav Weinreb: Communication Efficient Secure Linear Algebra. TCC 2006: 522-541

Ilya Mironov, Anton Mityagin, Kobbi Nissim: Hard Instances of the Constrained Discrete Logarithm Problem. CoRR abs/math/0606771 (2006)

Ilya Mironov, Anton Mityagin, Kobbi Nissim: Hard Instances of the Constrained Discrete Logarithm Problem. IACR Cryptology ePrint Archive 2006: 253 (2006)

Krishnaram Kenthapadi, Nina Mishra, Kobbi Nissim: Simulatable auditing. PODS 2005: 118-127

Avrim Blum, Cynthia Dwork, Frank McSherry, Kobbi Nissim: Practical privacy: the SuLQ framework. PODS 2005: 128-138

Dan Boneh, Eu-Jin Goh, Kobbi Nissim: Evaluating 2-DNF Formulas on Ciphertexts. TCC 2005: 325-341

Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private Approximation of Search Problems. Electronic Colloquium on Computational Complexity (ECCC)(141) (2005)

Yair Bartal, Alain J. Mayer, Kobbi Nissim, Avishai Wool: Firmato: A novel firewall management toolkit. ACM Trans. Comput. Syst. 22(4): 381-420 (2004)

Cynthia Dwork, Kobbi Nissim: Privacy-Preserving Datamining on Vertically Partitioned Databases. CRYPTO 2004: 528-544

Michael J. Freedman, Kobbi Nissim, Benny Pinkas: Efficient Private Matching and Set Intersection. EUROCRYPT 2004: 1-19

Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh: Communication Versus Computation. ICALP 2004: 745-756

Uriel Feige, Robert Krauthgamer, Kobbi Nissim: On Cutting a Few Vertices from a Graph. Discrete Applied Mathematics 127(3): 643-649 (2003)

Yuval Ishai, Joe Kilian, Kobbi Nissim, Erez Petrank: Extending Oblivious Transfers Efficiently. CRYPTO 2003: 145-161

Irit Dinur, Kobbi Nissim: Revealing information while preserving privacy. PODS 2003: 202-210

Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright: Secure Multiparty Computation of Approximations. ICALP 2001: 927-938

Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz, Kobbi Nissim: Private approximation of NP-hard functions. STOC 2001: 550-559

Moni Naor, Kobbi Nissim: Communication preserving protocols for secure function evaluation. STOC 2001: 590-599

Moni Naor, Kobbi Nissim: Communication Complexity and Secure Function Evaluation. CoRR cs.CR/0109011 (2001)

Moni Naor, Kobbi Nissim: Communication Complexity and Secure Function Evaluation. Electronic Colloquium on Computational Complexity (ECCC) 8(062) (2001)

Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright: Secure Multiparty Computation of Approximations. IACR Cryptology ePrint Archive 2001: 24 (2001)

Moni Naor, Kobbi Nissim: Communication Complexity and Secure Function Evaluation. IACR Cryptology ePrint Archive 2001: 76 (2001)

Moni Naor, Kobbi Nissim: Certificate revocation and certificate update. IEEE Journal on Selected Areas in Communications 18(4): 561-570 (2000)

Uriel Feige, Michael Langberg, Kobbi Nissim: On the hardness of approximating N P witnesses. APPROX 2000: 120-131

Uriel Feige, Robert Krauthgamer, Kobbi Nissim: Approximating the minimum bisection size (extended abstract). STOC 2000: 530-536

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)

Ran Canetti, Tal Malkin, Kobbi Nissim: Efficient Communication-Storage Tradeoffs for Multicast Encryption. EUROCRYPT 1999: 459-474

Yair Bartal, Alain J. Mayer, Kobbi Nissim, Avishai Wool: Firmato: A Novel Firewall Management Toolkit. IEEE Symposium on Security and Privacy 1999: 17-31