\(k\)-anonymous data collection
From MaRDI portal
Publication:730905
DOI10.1016/J.INS.2009.05.004zbMath1193.68106OpenAlexW2017618676MaRDI QIDQ730905
Sheng Zhong, Zhiqiang Yang, Tingting Chen
Publication date: 1 October 2009
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2009.05.004
Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items (3)
Anonymous Data Collection System with Mediators ⋮ One-time encryption-key technique for the traditional DL-based encryption scheme with anonymity ⋮ Verification of initial-state opacity in security applications of discrete event systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Privacy-preserving algorithms for distributed mining of frequent itemsets
- Probabilistic encryption
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- Two methods for privacy preserving data mining with malicious participants
- Fuzzy reasoning model under quotient space structure
- Flash mixing
- Privacy-Preserving Classifier Learning
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Foundations of Cryptography
- Optimistic Mixing for Exit-Polls
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
- ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Database Theory - ICDT 2005
- Topics in Cryptology – CT-RSA 2004
- Privacy preserving data mining
This page was built for publication: \(k\)-anonymous data collection