Data collection with self-enforcing privacy

ACM Transactions on Information and System Security

Volumn 12, Issue 2, 2008, Pages

  Golle, Philippe ^a   McSherry, Frank ^b   Mironov, Ilya ^b  

^a PALO ALTO RESEARCH CENTER   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Data collection; Privacy

Indexed keywords

DATA ACQUISITION;

BREAKINGS; CRYPTOGRAPHIC ASSUMPTIONS; DATA COLLECTION; DATA SUBMISSION; PRIVACY; PRIVATE DATA; PROPERTY; SENSITIVE DATAS; SIMPLE++;

SENSITIVE DATA;

EID: 57849106781     PISSN: 10949224     EISSN: 15577406     Source Type: Journal    
DOI: 10.1145/1455518.1477940     Document Type: Article

References (25)

1. AGRAWAL, R., HAAS, P. J., AND KIERNAN, J. 2003. Watermarking relational data: framework, algorithms and analysis. VLDB J. 12, 2, 157-169.
2. AGRAWAL, R. AND SRIKANT, R. 2000. Privacy-preserving data mining. In Proceedings of the ACM International Conference on Management of Data (SIGMOD'00). W. Chen, J. F. Naughton, and P. A. Bernstein Eds. 439-450.
3. AMBAINIS, A., JAKOBSSON, M., AND LIPMAA, H. 2004. Cryptographic randomized response techniques. In Proceedings of the Conference on Public Key Cryptography (PKC'04). F. Bao, R. H. Deng, and J. Zhou Eds. Lecture Notes in Computer Science, vol. 2947. Springer, 425-438.
4. BOLDYREVA, A. AND JAKOBSSON, M. 2003. Theft-protected proprietary certificates. In Proceedings of the Conference on Security and Privacy in Digital Rights Management (DRM'02). J. Feigenbaum Ed. Lecture Notes in Computer Science, vol. 2696. Springer, 208-220.
5. BONEH, D. AND SHAW, J. 1998. Collusion-secure fingerprinting for digital data. IEEE Trans. Inf. Theory 44, 5, 1897-1905.
6. AMENISCH, J. AND STADLER, M. 1997. Proof systems for general statements about discrete logarithms. Tech. rep. 260, Dept. of Computer Science, ETH Zurich.
7. HAUM, D. 1981. Untraceable electronic mail, return addresses, and digital pseudonyms. Comm. ACM 24, 2, 84-88.
8. HAUM, D. AND PEDERSEN, T. P. 1993. Wallet databases with observers. In Proceedings of the Conference on Advances in Cryptology (CRYPTO'92). E. F. Brickell Ed. Lecture Notes in Computer Science, vol. 740. Springer, 89-105.
9. HOR, B., FIAT, A., NAOR, M., AND PINKAS, B. 2000. Tracing traitors. IEEE Trans. Inf. Theory 46, 3, 893-910.
10. WORK, C. 2006. Differential privacy. Invited talk. In Automata, Languages and Programming (ICALP2). M. Bugliesi, B. Preneel, V. Sassone, and I. Wegener Eds. Lecture Notes in Computer Science, vol. 4052. Springer, 1-12.
11. WORK, C., LOTSPIECH, J. B., AND NAOR, M. 1996. Digital signets: Self-enforcing protection of digital information. In Proceedings of the 28th Annual ACM Symposium, on Theory of Computing (STOC'96). 489-498.
12. WORK, C, MCSHERRY, F., NISSIM, K., AND SMITH, A. 2006. Calibrating noise to sensitivity in private data analysis. In Theory of Cryptography Conference (TCC'06). S. Halevi and T. Rabin Eds. Lecture Notes in Computer Science, vol. 3876. Springer, 265-284.
13. GOLDREICH, O., MICALI, S., AND WLGDERSON, A. 1987. How to play any mental game, or a completeness theorem for protocols with honest majority. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC'87). 218-229.
14. GOLLE, P., MCSHERRY, F., AND MIRONOV, I. 2006. Data collection with self-enforcing privacy. In Proceedings of the ACM Conference on Computer and Communications Security (CCS'06). R. Wright, S. D. C. di Vimercati, and V. Shmatikov Eds. 69-78.
15. GROTH, J. 2002. A verifiable secret shuffle of homomorphic encryptions. In Public Key Cryptography (PKC'03). Y. Desmedt Ed. Lecture Notes in Computer Science, vol. 2567. Springer, 145-160.
16. JAKOBSSON, M., JUELS, A., AND NGUYEN, P. Q. 2002. Proprietary certificates. In Topics in Cryptology (CT-RSA'02). B. Preneel Ed. Lecture Notes in Computer Science, vol. 2271. Springer, 164-181.
17. KENTHAPADI, K., MLSHRA, N., AND NLSSIM, K. 2005. Simulatable auditing. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS'05). C. Li Ed. 118-127.
18. ARGOLIN, N. B., WRIGHT, M., AND LEVINE, B. N. 2004. Analysis of an incentives-based secrets protection system. In Proceedings of the ACM Workshop on Digital Rights Management (DRM'04). A. Kiayias and M. Yung Eds. 22-30.
19. NEFF, C. A. 2001. A verifiable secret shuffle and its application to e-voting. In Proceedings of the ACM Conference on Computer and Communications Security (CCS'01). 116-125.
20. OGATA, W., KUROSAWA, K., SAKO, K., AND TAKATANI, K. 1997. Fault tolerant anonymous channel. In Information and Communication Security (ICICS'97). Y. Han, T. Okamoto, and S. Qing Eds. Lecture Notes in Computer Science, vol. 1334. Springer, 440-444.
21. PFITZMANN, B. AND SCHUNTER, M. 1996. Asymmetric fingerprinting (extended abstract). In Advances in Cryptology (EUROCRYPT'96). U. M. Maurer Ed. Lecture Notes in Computer Science, vol. 1070. Springer, 84-95.
22. POLLARD, J. M. 1978. Monte Carlo methods for index computation (mod p). Math. Comput. 32, 918-924.
23. SCHNORR, C.-P. 1991. Efficient signature generation by smart cards. J. Cryptol. 4, 3, 161-174.
24. WARNER, S. L. 1965. Randomized response: A survey technique for eliminating evasive answer bias. Amer. Stat. Assoc. 60, 309, 63-69.
25. YAO, A. C.-C. 1982. Protocols for secure computations (extended abstract). In Proceedings of the IEEE 23rd Annual Symposium on Foundations of Computer Science (FOCS'82). 160-164.