Building Application-Related Patient Identifiers: What Solution for a European Country?
Author(s) -
Catherine Quantin,
FrançoisAndré Allaert,
Paul Avillach,
Maniane Fassa,
Benoît Riandey,
Gilles Trouessin,
Olivier Cohen
Publication year - 2008
Publication title -
international journal of telemedicine and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.363
H-Index - 27
eISSN - 1687-6423
pISSN - 1687-6415
DOI - 10.1155/2008/678302
Subject(s) - computer science , anonymity , hash function , identifier , reliability (semiconductor) , computer security , directive , personally identifiable information , unique identifier , function (biology) , quality (philosophy) , internet privacy , computer network , power (physics) , physics , quantum mechanics , evolutionary biology , biology , programming language , philosophy , epistemology
We propose a method utilizing a derived social security number with the same reliability as the social security number. We show the anonymity techniques classically based on unidirectional hash functions (such as the secure hash algorithm (SHA-2) function that can guarantee the security, quality, and reliability of information if these techniques are applied to the Social Security Number). Hashing produces a strictly anonymous code that is always the same for a given individual, and thus enables patient data to be linked. Different solutions are developed and proposed in this article. Hashing the social security number will make it possible to link the information in the personal medical file to other national health information sources with the aim of completing or validating the personal medical record or conducting epidemiological and clinical research. This data linkage would meet the anonymous data requirements of the European directive on data protection.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom