A benchmark of globally-optimal anonymization methods for biomedical data

Proceedings - IEEE Symposium on Computer-Based Medical Systems

Volumn , Issue , 2014, Pages 66-71

  Prasser, Fabian ^a   Kohlmayer, Florian ^a   Kuhn, Klaus A ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

benchmark; de identification; k anonymity; l diversity; privacy; statistical disclosure control; t closeness; presence

Indexed keywords

BENCHMARKING; DATA PRIVACY; OPEN SYSTEMS;

DE-IDENTIFICATION; K-ANONYMITY; L DIVERSITIES; STATISTICAL DISCLOSURE CONTROL; T-CLOSENESS;

ALGORITHMS;

EID: 84907385449     PISSN: 10637125     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CBMS.2014.85     Document Type: Conference Paper

References (19)

1. Directive 95/46/EC of the European Parliament and of the Council of 24 October 1995. Off. J. Eur. Communities, 38(L. 281), 1995.
2. Health insurance portability and accountability act of 1996. Public Law Gazette, pages 1-349, 1996.
3. OECD Principles and Guidelines for Access to Research Data from Public Funding. www.oecd.org/sti/sci-tech/38500813.pd, 2006.
4. ARX. arx.deidentifier.org, Oct. 2013.
5. ARX - Benchmark. arx.deidentifier.org/benchmark, Oct. 2013.
6. Sharing research data to improve public health. http://wellcome.ac.uk/ About-us/Policy/Spotlight-issues/Data-sharing/ Public-health-and-epidemiology/ WTDV030690.htm, Oct. 2013.
7. K. E. Emam et al. A globally optimal k-anonymity method for the de-identification of health data. J. Amer. Medical Informatics Assoc., 16(5):670-682, 2009.
8. C. Heeney et al. Assessing the privacy risks of data sharing in genomics. Public health genomics, 14(1):17-25, 2011.
9. F. Kohlmayer et al. Highly efficient optimal k-anonymity for biomedical datasets. In Proc. Int. Symp. Computer-Based Medical Systems, 2012.
10. F. Kohlmayer, F. Prasser, et al. Flash: Efficient, stable and optimal kanonymity. In 2012 Proc. Int. Conf. Privacy, Security, Risk and Trust, pages 708-717. IEEE, 2012.
11. K. LeFevre et al. Incognito: Efficient full-domain k-anonymity. In Proc. Int. Conf. on Management of Data, pages 49-60, 2005.
12. N. Li et al. t-closeness: Privacy beyond k-anonymity and l-diversity. In 23rd Int. Conf. on Data Engineering, pages 106-115, 2007.
13. T. Li et al. Slicing: A new approach for privacy preserving data publishing. IEEE Transactions on Knowledge and Data Engineering, 24(3):561-574, 2012.
14. A. Machanavajjhala et al. L-diversity: Privacy beyond k-anonymity. ACM Trans. on Knowledge Discovery from Data, 1(1), 2007.
15. A. Narayanan and V. Shmatikov. Robust de-anonymization of large sparse datasets. In Proc. IEEE Symposium on Security and Privacy, pages 111-125, 2008.
16. M. Nergiz et al. Hiding the presence of individuals from shared databases. In Int. Conf. on Management of Data, pages 665-676, 2007.
17. P. Samarati and L. Sweeney. Generalizing data to provide anonymity when disclosing information. In Proc. Symp. on Principles of Database Systems, page 188, 1998.
18. L. Sweeney. Computational Disclosure Control - A Primer on Data Privacy Protection. PhD thesis, MIT, 2001.
19. L. Sweeney et al. Identifying Participants in the Personal Genome Project by Name. SSRN Electronic Journal, pages 1-4, 2013.