Travelled to:1 × Greece
1 × Iceland
1 × Poland
3 × USA
Collaborated with:Y.Ishai K.Choromanski E.Kushilevitz R.N.Wright M.J.Strauss A.Beimel Y.Gertner D.Dachman-Soled H.K.Lee R.A.Servedio A.Wan H.Wee J.Feigenbaum K.Nissim M.Strauss
Talks about:privat (3) multiparti (2) function (2) approxim (2) retriev (2) privaci (2) inform (2) cryptograph (1) algorithm (1) statist (1)
Person: Tal Malkin
DBLP: Malkin:Tal
Contributed to:
2012
200820072001
19991998Wrote 6 papers:
- PODS-2012-ChoromanskiM #algorithm #database #graph #power of #privacy #statistics
- The power of the dinur-nissim algorithm: breaking privacy of statistical and graph databases (KC, TM), pp. 65–76.
- ICALP-A-2008-Dachman-SoledLMSWW #encryption #learning
- Optimal Cryptographic Hardness of Learning Monotone Functions (DDS, HKL, TM, RAS, AW, HW), pp. 36–47.
- ICALP-2007-IshaiMSW #approximate #multi
- Private Multiparty Sampling and Approximation of Vector Combinations (YI, TM, MJS, RNW), pp. 243–254.
- ICALP-2001-FeigenbaumIMNSW #approximate #multi
- Secure Multiparty Computation of Approximations (JF, YI, TM, KN, MS, RNW), pp. 927–938.
- STOC-1999-BeimelIKM #information retrieval
- One-Way Functions Are Essential for Single-Server Private Information Retrieval (AB, YI, EK, TM), pp. 89–98.
- STOC-1998-GertnerIKM #information retrieval #privacy
- Protecting Data Privacy in Private Information Retrieval Schemes (YG, YI, EK, TM), pp. 151–160.