![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Kobbi Nissim 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 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) 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, S. Venkatesh : Communication Versus Computation. ICALP 2004 : 745-756 Yair Bartal , Alain J. Mayer , Kobbi Nissim, Avishai Wool : Firmato : A novel firewall management toolkit. ACM Trans. Comput. Syst. 22 (4): 381-420 (2004) 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 Uriel Feige , Robert Krauthgamer , Kobbi Nissim: On Cutting a Few Vertices from a Graph. Discrete Applied Mathematics 127 (3): 643-649 (2003) 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) 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 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 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) 1 [ 1 ] 2 [ 2 ] [ 14 ] 3 [ 18 ] 4 [ 20 ] 5 [ 19 ] 6 [ 3 ] 7 [ 18 ] 8 [ 12 ] 9 [ 17 ] [ 20 ] [ 23 ] 10 [ 4 ] [ 5 ] [ 11 ] 11 [ 10 ] 12 [ 16 ] 13 [ 19 ] 14 [ 9 ] 15 [ 15 ] 16 [ 10 ] [ 13 ] [ 15 ] 17 [ 21 ] 18 [ 13 ] [ 15 ] 19 [ 4 ] [ 9 ] [ 11 ] 20 [ 9 ] 21 [ 5 ] 22 [ 3 ] [ 10 ] 23 [ 1 ] [ 2 ] [ 14 ] 24 [ 20 ] [ 23 ] 25 [ 21 ] 26 [ 6 ] [ 7 ] [ 8 ] 27 [ 13 ] 28 [ 1 ] [ 16 ] 29 [ 1 ] 30 [ 23 ] 31 [ 10 ] 32 [ 15 ] 33 [ 18 ] [ 22 ] 34 [ 2 ] [ 14 ] 35 [ 10 ] ![]() ©2006 Association for Computing Machinery |