The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Elements of information theory
Elements of information theory
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Hordes: a multicast based protocol for anonymity
Journal of Computer Security
Limiting privacy breaches in privacy preserving data mining
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Privacy preserving mining of association rules
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Information sharing across private databases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Anonymous Connections and Onion Routing
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
k-anonymous message transmission
Proceedings of the 10th ACM conference on Computer and communications security
Anonymity-preserving data collection
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Efficient anonymity-preserving data collection
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Data collection with self-enforcing privacy
Proceedings of the 13th ACM conference on Computer and communications security
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
| Hi-index | 0.00 |
The wide adoption of the Internet has made it a convenient and low-cost platform for large-scale data collection. However, privacy has been the one issue that concerns Internet users much more than reduced costs and ease of use. When sensitive information are involved, respondents in online data collection are especially reluctant to provide truthful response, and the conventional practice to employ a trusted third party to collect the data is unacceptable in these situations. Researchers have proposed various anonymity-preserving data collection techniques in recent years, but the current methods are generally unable to resist malicious attacks adequately, and they are not sufficiently scalable for the potentially large numbers of respondents involved in online data collections. In this paper, we present an efficient anonymity-preserving data collection protocol that is suitable for mutually distrusting respondents to submit their responses to an untrusted data collector. Our protocol employs the onion route approach to unlink the responses from the respondents to preserve anonymity. Our experimental results show that the method is highly efficient and robust for online data collection scenarios that involve large numbers of respondents.