STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Privacy-preserving data mining
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
On the design and quantification of privacy preserving data mining algorithms
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Optimistic Mixing for Exit-Polls
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Verifiable Secret Shuffle of Homomorphic Encryptions
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Tools for privacy preserving distributed data mining
ACM SIGKDD Explorations Newsletter
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Achieving k-anonymity privacy protection using generalization and suppression
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Anonymous Connections and Onion Routing
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Using randomized response techniques for privacy-preserving data mining
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Privacy-preserving Bayesian network structure computation on distributed heterogeneous data
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Anonymity-preserving data collection
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Direct chosen ciphertext security from identity-based techniques
Proceedings of the 12th 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
Two methods for privacy preserving data mining with malicious participants
Information Sciences: an International Journal
Efficient and Anonymous Online Data Collection
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Collusion-resistant anonymous data collection method
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Information Sciences: an International Journal
Anonymized data: generation, models, usage
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Freedom of Privacy: Anonymous Data Collection with Respondent-Defined Privacy Protection
INFORMS Journal on Computing
Dissent: accountable anonymous group messaging
Proceedings of the 17th ACM conference on Computer and communications security
Distributed privacy preserving data collection
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Emergency Access Authorization for Personally Controlled Online Health Care Data
Journal of Medical Systems
Dissent in numbers: making strong anonymity scale
OSDI'12 Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation
Hang with your buddies to resist intersection attacks
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Conscript your friends into larger anonymity sets with JavaScript
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Proactively accountable anonymous messaging in verdict
SEC'13 Proceedings of the 22nd USENIX conference on Security
| Hi-index | 0.00 |
The output of a data mining algorithm is only as good as its inputs, and individuals are often unwilling to provide accurate data about sensitive topics such as medical history and personal finance. Individuals maybe willing to share their data, but only if they are assured that it will be used in an aggregate study and that it cannot be linked back to them. Protocols for anonymity-preserving data collection provide this assurance, in the absence of trusted parties, by allowing a set of mutually distrustful respondents to anonymously contribute data to an untrusted data miner.To effectively provide anonymity, a data collection protocol must be collusion resistant, which means that even if all dishonest respondents collude with a dishonest data miner in an attempt to learn the associations between honest respondents and their responses, they will be unable to do so. To achieve collusion resistance, previously proposed protocols for anonymity-preserving data collection have quadratically many communication rounds in the number of respondents, and employ (sometimes incorrectly) complicated cryptographic techniques such as zero-knowledge proofs.We describe a new protocol for anonymity-preserving, collusion resistant data collection. Our protocol has linearly many communication rounds, and achieves collusion resistance without relying on zero-knowledge proofs. This makes it especially suitable for data mining scenarios with a large number of respondents.