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