Distributed privacy preserving data collection

We study the distributed privacy preserving data collection problem: an untrusted data collector (e.g., a medical research institute) wishes to collect data (e.g., medical records) from a group of respondents (e.g., patients). Each respondent owns a multi-attributed record which contains both non-sensitive (e.g., quasi-identifiers) and sensitive information (e.g., a particular disease), and submits it to the data collector. Assuming T is the table formed by all the respondent data records, we say that the data collection process is privacy preserving if it allows the data collector to obtain a k-anonymized or l-diversified version of T without revealing the original records to the adversary. We propose a distributed data collection protocol that outputs an anonymized table by generalization of quasi-identifier attributes. The protocol employs cryptographic techniques such as homomorphic encryption, private information retrieval and secure multiparty computation to ensure the privacy goal in the process of data collection. Meanwhile, the protocol is designed to leak limited but non-critical information to achieve practicability and efficiency. Experiments show that the utility of the anonymized table derived by our protocol is in par with the utility achieved by traditional anonymization techniques. © 2011 Springer-Verlag.

Xue, M., Papadimitriou, P., Raïssi, C., Kalnis, P., & Pung, H. K. (2011). Distributed Privacy Preserving Data Collection. Lecture Notes in Computer Science, 93–107. doi:10.1007/978-3-642-20149-3_9

Springer Nature

Database Systems for Advanced Applications

Conference/Event Name
16th International Conference on Database Systems for Advanced Applications, DASFAA 2011


Permanent link to this record