Distributed privacy preserving data collection

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

Volumn 6587 LNCS, Issue PART 1, 2011, Pages 93-107

  Xue, Mingqiang ^a   Papadimitriou, Panagiotis ^b   Raïssi, Chedy ^c   Kalnis, Panos ^d   Pung, Hung Keng ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b STANFORD UNIVERSITY   (United States)

^c INRIA   (France)

^d KING ABDULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Saudi Arabia)

Author keywords

[No Author keywords available]

Indexed keywords

ANONYMIZATION; CRITICAL INFORMATION; CRYPTOGRAPHIC TECHNIQUES; DATA COLLECTION; DATA COLLECTION PROCESS; DATA COLLECTORS; DATA RECORDS; DISTRIBUTED DATA; HOMOMORPHIC-ENCRYPTIONS; MEDICAL RECORD; MEDICAL RESEARCH; MULTI-ATTRIBUTED RECORDS; PRIVACY PRESERVING; PRIVATE INFORMATION RETRIEVAL; SECURE MULTI-PARTY COMPUTATION; SENSITIVE INFORMATIONS;

CRYPTOGRAPHY; DATA PRIVACY; DATABASE SYSTEMS; INFORMATION RETRIEVAL;

DATA ACQUISITION;

EID: 79955104712     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20149-3_9     Document Type: Conference Paper

References (19)

1. Asmuth, C., Bloom, J.: A modular approach to key safeguarding. IEEE Trans. Information Theory 29(2), 208-210 (1983)
2. Bayardo, R., Agrawal, R.: Data privacy through optimal k-anonymization. In: Proc. of ICDE, pp. 217-228 (2005)
3. Brickell, J., Shmatikov, V.: Efficient anonymity-preserving data collection. In: KDD 2006, pp. 76-85. ACM, New York (2006)
4. Damgard, I., Fitzi, M., Kiltz, E., Nielsen, J., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation, pp. 285-304 (2006)
5. Gentry, C., Ramzan, Z.: Single-database private information retrieval with constant communication rate, pp. 803-815 (2005)
6. Ghinita, G., Karras, P., Kalnis, P.,Mamoulis, N.: Fast data anonymization with low information loss. In: Proc. of VLDB, pp. 758-769 (2007)
7. Jurczyk, P., Xiong, L.: Privacy-preserving data publishing for horizontally partitioned databases. In: CIKM 2008: Proceeding of the 17th ACM Conference on Information and Knowledge Mmanagement, pp. 1321-1322. ACM, New York (2008)
8. Kaya, K., Selçuk, A.A.: Threshold cryptography based on asmuth-bloom secret sharing. Inf. Sci. 177(19), 4148-4160 (2007)
9. LeFevre, K., DeWitt, D.J., Ramakrishnan, R.: Incognito: Efficient full-domain k-anonymity. In: Proc. of ACM SIGMOD, pp. 49-60 (2005)
10. Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M.: l-diversity: Privacy beyond k-anonymity. In: Proc. of ICDE (2006)
11. Meyerson, A.,Williams, R.: On the complexity of optimal k-anonymity. In: PODS 2004, pp. 223-228. ACM, New York (2004)
12. Moon, B., Jagadish, H.v., Faloutsos, C., Saltz, J.H.: Analysis of the clustering properties of the hilbert space-filling curve. IEEE TKDE 13(1), 124-141 (2001)
13. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes, pp. 223-238 (1999)
14. Samarati, P., Sweeney, L.: Generalizing data to provide anonymity when disclosing information (abstract). In: Proc. of ACM PODS, p. 188 (1998)
15. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612-613 (1979)
16. Sweeney, L.: k-anonymity: A model for protecting privacy. Int. J. of Uncertainty, Fuzziness and Knowledge-Based Systems 10(5), 557-570 (2002)
17. Yang, Z., Zhong, S., Wright, R.N.: Anonymity-preserving data collection. In: KDD 2005, pp. 334-343. ACM, New York (2005)
18. Zhong, S., Yang, Z., Chen, T.: k-anonymous data collection. Inf. Sci. 179(17), 2948-2963 (2009)
19. Zhong, S., Yang, Z.,Wright, R.N.: Privacy-enhancing k-anonymization of customer data. In: PODS 2005, pp. 139-147. ACM, New York (2005)