Data collection with self-enforcing privacy

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2006, Pages 69-78

  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 COLLECTION; LEAKY POLLSTER; SELF-ENFORCING PRIVACY;

DATA COMMUNICATION SYSTEMS; INFORMATION DISSEMINATION; INFORMATION MANAGEMENT; PROBLEM SOLVING; PUBLIC KEY CRYPTOGRAPHY;

COMPUTER PRIVACY;

EID: 34547248624     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1180405.1180416     Document Type: Conference Paper

References (24)

1. Rakesh Agrawal and Ramakrishnan Srikant. Privacy-preserving data mining. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pages 439-450, 2000.
2. Rakesh Agrawal, Peter J. Haas, and Jerry Kiernan. Watermarking relational data: framework, algorithms and analysis. The VLDB Journal, 12(2):157-169, 2003.
3. Andris Ambainis, Markus Jakobsson, and Helger Lipmaa. Cryptographic randomized response techniques. In Public Key Cryptography - PKC 2004, volume 2947 of Lecture Notes in Computer Science, pages 425-438, 2004.
4. Alexandra Boldyreva and Markus Jakobsson. Theft-protected proprietary certificates. In Digital Rights Management Workshop - DRM 2002, volume 2696 of Lecture Notes in Computer Science, pages 208-220, 2003.
5. Dan Boneh and James Shaw. Collusion-secure fingerprinting for digital data. IEEE Transactions on Information Theory, 44(5):1897-1905, 1998.
6. Benny Chor, Amos Fiat, Moni Naor, and Benny Pinkas. Tracing traitors. IEEE Transactions on Information Theory, 46(3):893-910, 2000.
7. David Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. In Communications of the ACM, 24(2):84-88, 1981.
8. David Chaum and Torben P. Pedersen. Wallet databases with observers. In Advances in Cryptology-CRYPTO '92, volume 740 of Lecture Notes in Computer Science, pages 89-105, 1993.
9. Jan Camenisch and Markus Stadler. Proof systems for general statements about discrete logarithms. Technical Report 260, Dept. of Computer Science, ETH Zurich, March 1997.
10. Cynthia Dwork, Jeffrey B. Lotspiech, and Moni Naor. Digital signets: Self-enforcing protection of digital information. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, 1996, pages 489-498. ACM.
11. Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. Calibrating noise to sensitivity in private data analysis. In TCC 2006, volume 3876 of Lecture Notes in Computer Science, pages 265-284, 2006.
12. Cynthia Dwork. Differential privacy. Invited talk. In ICALP 2006, Part II, volume 4052 of Lecture Notes in Computer Science, pages 1-12, 2006.
13. Oded Goldreich, Silvio Micali, and Avi Wigderson. 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, pages 218-229. ACM.
14. Jens Groth. A verifiable secret shuffle of homomorphic encryptions. In Public Key Cryptography - PKC 2008, volume 2567 of Lecture Notes in Computer Science, pages 145-160, 2002.
15. Markus Jakobsson, Ari Juels, and Phong Q. Nguyen. Proprietary certificates. In Topics in Cryptology - CT-RSA 2002, volume 2271 of Lecture Notes in Computer Science, pages 164-181. 2002.
16. Krishnaram Kenthapadi, Nina Mishra, and Kobbi Nissim. Simulatable auditing. In PODS 2005, pages 118-127. ACM, 2005.
17. N. Boris Margolin, Matthew Wright, Brian Neil Levine. Analysis of an incentives-based protection system. In Proc. A CM Digital Rights Management Workshop 2004, pages 22-30. ACM, 2004.
18. C. Andrew Neff. A verifiable secret shuffle and its application to e-voting. In ACM Conference on Computer and Communications Security, pages 116-125, 2001.
19. Wakaha Ogata, Kaoru Kurosawa, Kazue Sako, and Kazunori Takatani. Fault tolerant anonymous channel. In ICICS '97, volume 1334 of Lecture Notes in Computer Science, pages 440-444, 1997.
20. John M. Pollard. Monte Carlo methods for index computation (mod p). Mathematics of Computation, 32:918-924, 1978.
21. Birgit Pfitzmann and Matthias Schunter. Asymmetric fingerprinting (extended abstract). In Advances in Cryptology - EUROCRYPT '96, volume 1070 of Lecture Notes in Computer Science, pages 84-95, 1996.
22. Claus-Peter Schnorr. Efficient signature generation by smart cards. J. Cryptology, 4(3):161-174, 1991.
23. Stanley L. Warner. Randomized response: A survey technique for eliminating evasive answer bias. The American Statistical Association, 60(309):63-69, March 1965.
24. Andrew Chi-Chih Yao. Protocols for secure computations (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science, pages 160-164, Chicago, Illinois, 3-5 November 1982. IEEE.