Differential privacy with imperfect randomness

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7417 LNCS, Issue , 2012, Pages 497-516

  Dodis, Yevgeniy ^a   López Alt, Adriana ^a   Mironov, Ilya ^b   Vadhan, Salil ^c  

^a NEW YORK UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

^c HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIAL PRIVACIES; IMPOSSIBILITY RESULTS; INDISTINGUISHABILITY; LOW SENSITIVITY; NON-TRIVIAL; SECRET KEY;

CRYPTOGRAPHY;

RANDOM PROCESSES;

EID: 84865524308     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32009-5_29     Document Type: Conference Paper

References (24)

1. Andreev, A.E., Clementi, A.E.F., Rolim, J.D.P., Trevisan, L.: Weak random sources, hitting sets, and BPP simulations. SIAM J. Comput. 28(6), 2103-2116 (1999)
2. Blum, A., Dwork, C., McSherry, F., Nissim, K.: Practical privacy: the sulq framework. In: Li, C. (ed.) PODS, pp. 128-138. ACM (2005)
3. Bosley, C., Dodis, Y.: Does Privacy Require True Randomness? In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 1-20. Springer, Heidelberg (2007)
4. Broder, A.Z., Glassman, S.C., Manasse, M.S., Zweig, G.: Syntactic clustering of the web. Computer Networks 29(8-13), 1157-1166 (1997)
5. Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17(2), 230-261 (1988)
6. Dinur, I., Nissim, K.: Revealing information while preserving privacy. In: Neven, F., Beeri, C., Milo, T. (eds.) PODS, pp. 202-210. ACM (2003)
7. Dodis, Y., Katz, J., Reyzin, L., Smith, A.: Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 232-250. Springer, Heidelberg (2006)
8. Dodis, Y., Ong, S.J., Prabhakaran, M., Sahai, A.: On the (im)possibility of cryptography with imperfect randomness. In: FOCS, pp. 196-205. IEEE Computer Society (2004)
9. Dodis, Y., Spencer, J.: On the (non)universality of the one-time pad. In: FOCS, pp. 376-385. IEEE Computer Society (2002)
10. Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating Noise to Sensitivity in Private Data Analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265-284. Springer, Heidelberg (2006)
11. Dwork, C., Nissim, K.: Privacy-Preserving Datamining on Vertically Partitioned Databases. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 528-544. Springer, Heidelberg (2004)
12. Ghosh, A., Roughgarden, T., Sundararajan, M.: Universally utility-maximizing privacy mechanisms. In: Mitzenmacher, M. (ed.) STOC, pp. 351-360. ACM (2009)
13. Hardt, M., Talwar, K.: On the geometry of differential privacy. In: Schulman, L.J. (ed.) STOC, pp. 705-714. ACM (2010)
14. Holenstein, T.: Parallel repetition: simplifications and the no-signaling case. In: Johnson, D.S., Feige, U. (eds.) STOC, pp. 411-419. ACM (2007)
15. Manber, U.: Finding similar files in a large file system. In: Proceedings of the USENIX Winter 1994 Technical Conference, p. 2. USENIX Association, Berkeley (1994)
16. Maurer, U.M., Wolf, S.: Privacy Amplification Secure against Active Adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 307-321. Springer, Heidelberg (1997)
17. McGregor, A., Mironov, I., Pitassi, T., Reingold, O., Talwar, K., Vadhan, S.P.: The limits of two-party differential privacy. In: FOCS, pp. 81-90. IEEE Computer Society (2010)
18. McInnes, J.L., Pinkas, B.: On the Impossibility of Private Key Cryptography with Weakly Random Keys. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 421-435. Springer, Heidelberg (1991)
19. Moffat, A., Neal, R.M., Witten, I.H.: Arithmetic coding revisited. ACM Trans. Inf. Syst. 16(3), 256-294 (1998)
20. Reingold, O., Vadhan, S., Widgerson, A.: No deterministic extraction from santhavazirani sources - a simple proof (2004), http://windowsontheory.org/ 2012/02/21/no-deterministic-extraction-from-santha-vazirani-sources-a-simple- proof/
21. Santha, M., Vazirani, U.V.: Generating quasi-random sequences from semi-random sources. J. Comput. Syst. Sci. 33(1), 75-87 (1986)
22. Vazirani, U.V., Vazirani, V.V.: Random polynomial time is equal to slightlyrandom polynomial time. In: FOCS, pp. 417-428. IEEE Computer Society (1985)
23. Witten, I.H., Neal, R.M., Cleary, J.G.: Arithmetic coding for data compression. Commun. ACM 30(6), 520-540 (1987)
24. Zuckerman, D.: Simulating BPP using a general weak random source. Algorithmica 16(4/5), 367-391 (1996)