A taxonomy of privacy-preserving record linkage techniques

Information Systems

Volumn 38, Issue 6, 2013, Pages 946-969

  Vatsalan, Dinusha ^a   Christen, Peter ^a   Verykios, Vassilios S ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b HELLENIC OPEN UNIVERSITY   (Greece)

Author keywords

Data matching; Data quality; Entity resolution; Privacy techniques; Record linkage; Survey

Indexed keywords

CLASSIFICATION (OF INFORMATION); DATA HANDLING; DATA INTEGRATION; DATA MINING; DATA WAREHOUSES; DATABASE SYSTEMS; LEARNING SYSTEMS; SURVEYING; SURVEYS; TAXONOMIES;

DATA MATCHING; DATA PREPROCESSING; DATA QUALITY; ENTITY RESOLUTIONS; LARGE DATABASE; PRIVACY PRESERVING RECORD LINKAGES; RECORD LINKAGE; SENSITIVE INFORMATIONS;

DATA PRIVACY;

EID: 84889599807     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2012.11.005     Document Type: Article

References (143)

1. J. Han, M. Kamber, J. Pei, Data Mining: Concepts and Techniques, 3rd edition, Morgan Kaufmann, 2011.
2. C. Batini, M. Scannapieco, Data Quality: Concepts, Methodologies and Techniques, Data-Centric Systems and Applications, Springer, 2006.
3. Y. Lee, L. Pipino, J. Funk, R. Wang, Journey to Data Quality, MIT Press, 2009.
4. E. Rahm, H.H. Do, Data cleaning: problems and current approaches, IEEE Data Engineering Bulletin 23 (4) (2000) 3-13.
5. P. Christen, A comparison of personal name matching: techniques and practical issues, in: IEEE ICDM Workshop on Mining Complex Data, Hong Kong, 2006.
6. T. Herzog, F. Scheuren, W. Winkler, Data Quality and Record Linkage Techniques, Springer Verlag, 2007.
7. P. Christen, Privacy-preserving data linkage and geocoding: current approaches and research directions, in: IEEE ICDM Workshop on Privacy Aspects of Data Mining, Hong Kong, 2006.
8. A. Elmagarmid, P. Ipeirotis, V.S. Verykios, Duplicate record detection: a survey, IEEE Transactions on Knowledge and Data Engineering 19 (1) (2007) 1-16. (Pubitemid 44955773)
9. Z. Bellahsene, A. Bonifati, E. Rahm, Schema Matching and Mapping, Data-Centric Systems and Applications, Springer, 2011.
10. I.P. Fellegi, A.B. Sunter, A theory for record linkage, Journal of the American Statistical Society 64 (328) (1969) 1183-1210.
11. X. Dong, F. Naumann, Data fusion: resolving data conflicts for integration, Proceedings of the VLDB Endowment 2 (2) (2009) 1654-1655.
12. J. Bleiholder, F. Naumann, Data fusion, ACM Computing Surveys 41 (1) (2008) 1-41.
13. P. Christen, Data Matching, Data-Centric Systems and Applications, Springer, 2012.
14. F. Naumann, M. Herschel, An introduction to duplicate detection, Synthesis Lectures on Data Management, vol. 2 (1), 2010, pp. 1-87.
15. M.A. Hernandez, S.J. Stolfo, Real-world data is dirty: data cleansing and the merge/purge problem, Data Mining and Knowledge Discovery 2 (1) (1998) 9-37. (Pubitemid 128696797)
16. W.W. Cohen, J. Richman, Learning to match and cluster large high-dimensional data sets for data integration, in: ACM SIGKDD, Edmonton, 2002.
17. R. Baxter, P. Christen, T. Churches, A comparison of fast blocking methods for record linkage, in: ACM SIGKDD Workshop on Data Cleaning, Record Linkage and Object Consolidation, Washington, DC, 2003.
18. P. Christen, K. Goiser, Quality and complexity measures for data linkage and deduplication, in: F. Guillet, H. Hamilton (Eds.), Quality Measures in Data Mining, Studies in Computational Intelligence, vol. 43, Springer, 2007, pp. 127-151.
19. P. Christen, A survey of indexing techniques for scalable record linkage and deduplication, IEEE Transactions on Knowledge and Data Engineering 24 (9) (2012) 1537-1555.
20. C. Clifton, M. Kantarcioglu, A. Doan, G. Schadow, J. Vaidya, A. Elmagarmid, D. Suciu, Privacy-preserving data integration and sharing, in: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Paris, 2004, pp. 19-26.
21. E. Brook, D. Rosman, C. Holman, Public good through data linkage: measuring research outputs from the Western Australian data linkage system, Australian and New Zealand Journal of Public Health 32 (1) (2008) 19-23. (Pubitemid 351351015)
22. D.E. Clark, Practical introduction to record linkage for injury research, Injury Prevention 10 (2004) 186-191. (Pubitemid 39186474)
23. C.W. Kelman, J. Bass, D. Holman, Research use of linked health data-a best practice protocol, Australian and New Zealand Journal of Public Health 26 (2002) 251-255. (Pubitemid 35446374)
24. J. Jonas, J. Harper, Effective Counterterrorism and the Limited Role of Predictive Data Mining, Cato Institute, 2006.
25. C. Phua, K. Smith-Miles, V. Lee, R. Gayler, Resilient identity crime detection, IEEE Transactions on Knowledge and Data Engineering 24 (3) (2012) 533-546.
26. G. Wang, H. Chen, H. Atabakhsh, Automatically detecting deceptive criminal identities, Communications of the ACM 47 (3) (2004) 70-76.
27. W.E. Winkler, Overview of Record Linkage and Current Research Directions, Technical Report RR2006/02, US Bureau of the Census, 2006.
28. M. Murugesan, W. Jiang, C. Clifton, L. Si, J. Vaidya, Efficient privacy preserving similar document detection, International Journal on Very Large Databases 19 (4) (2010) 457-475.
29. T. Churches, P. Christen, K. Lim, J.X. Zhu, Preparation of name and address data for record linkage using hidden Markov models, BioMed Central Medical Informatics and Decision Making 2 (9) (2002).
30. P. Christen, Development and user experiences of an open source data cleaning, deduplication and record linkage system, SIGKDD Explorations 11 (1) (2009) 39-48.
31. W.W. Cohen, P. Ravikumar, S. Fienberg, A comparison of string distance metrics for name-matching tasks, in: IJCAI Workshop on Information Integration on the Web, Acapulco, 2003, pp. 73-78.
32. P. Christen, Febrl: an open source data cleaning, deduplication and record linkage system with a graphical user interface, in: ACM SIGKDD, Las Vegas, 2008, pp. 1065-1068.
33. L. Gu, R. Baxter, Decision models for record linkage, in: Selected Papers from AusDM, Lecture Notes in Computer Science, vol. 3755, Springer, 2006, pp. 146-160. (Pubitemid 350253717)
34. W.E. Winkler, Methods for evaluating and creating data quality, Information Systems 29 (7) (2004) 531-550.
35. I. Bhattacharya, L. Getoor, Collective entity resolution in relational data, ACM Transactions on Knowledge Discovery from Data 1 (1) (2007).
36. D. Kalashnikov, S. Mehrotra, Domain-independent data cleaning via analysis of entity-relationship graph, ACM Transactions on Database Systems 31 (2) (2006) 716-767. (Pubitemid 43924953)
37. C. Quantin, H. Bouzelat, L. Dusserre, Irreversible encryption method by generation of polynomials, Medical Informatics and the Internet in Medicine 21 (2) (1996) 113-121. (Pubitemid 26401860)
38. R. Schnell, T. Bachteler, S. Bender, A toolbox for record linkage, Austrian Journal of Statistics 33 (1-2) (2004) 125-133.
39. J. Nin, V. Muntes-Mulero, N. Martinez-Bazan, J.-L. Larriba-Pey, On the use of semantic blocking techniques for data cleansing and integration, in: IDEAS, Banff, Canada, 2007, pp. 190-198.
40. L. Jin, C. Li, S. Mehrotra, Efficient record linkage in large data sets, in: DASFAA, Tokyo, 2003, pp. 137-146.
41. M.A. Hernandez, S.J. Stolfo, The merge/purge problem for large databases, in: ACM SIGMOD, San Jose, 1995, pp. 127-138.
42. A. Aizawa, K. Oyama, A fast linkage detection scheme for multi-source information integration, in: WIRI, Tokyo, 2005, pp. 30-39. (Pubitemid 44883138)
43. T. de Vries, H. Ke, S. Chawla, P. Christen, Robust record linkage blocking using suffix arrays and Bloom filters, ACM Transactions on Knowledge Discovery from Data 5 (2) (2011).
44. A. McCallum, K. Nigam, L.H. Ungar, Efficient clustering of high-dimensional data sets with application to reference matching, in: ACM SIGKDD, Boston, 2000, pp. 169-178.
45. P. Hall, G. Dowling, Approximate string matching, ACM Computing Surveys 12 (4) (1980) 381-402.
46. P. Jokinen, J. Tarhio, E. Ukkonen, A comparison of approximate string matching algorithms, Software-Practice and Experience 26 (12) (1996) 1439-1458. (Pubitemid 126598523)
47. G. Navarro, A guided tour to approximate string matching, ACM Computing Surveys 33 (1) (2001) 31-88. (Pubitemid 33768480)
48. E.H. Porter, W.E. Winkler, Approximate String Comparison and its Effect on an Advanced Record Linkage System, Technical Report RR97/02, US Bureau of the Census, 1997.
49. H. Keskustalo, A. Pirkola, K. Visala, E. Leppänen, K. Järvelin, Non-adjacent diagrams improve matching of cross-lingual spelling variants, in: String Processing and Information Retrieval, Springer, 2003, pp. 252-265.
50. K. Kukich, Techniques for automatically correcting words in text, ACM Computing Surveys 24 (4) (1992) 377-439. (Pubitemid 23687641)
51. B. van Berkel, K. De Smedt, Triphone analysis: a combined method for the correction of orthographical and typographical errors, in: ANLP, Austin, TX, USA, 1988, pp. 77-83.
52. M. Jaro, Advances in record-linkage methodology as applied to matching the 1985 census of Tampa, Florida, Journal of American Statistical Association (1989) 414-420.
53. W. Winkler, String comparator metrics and enhanced decision rules in the Fellegi-Sunter model of record linkage, in: Survey Research Methods, American Statistical Association, 1990, pp. 778-783.
54. W. Winkler, Improved decision rules in the Fellegi-Sunter model of record linkage, in: Survey Research Methods, American Statistical Association, vol. 274, 1993, p. 279.
55. P. Christen, Automatic record linkage using seeded nearest neighbour and support vector machine classification, in: ACM SIGKDD, Las Vegas, 2008.
56. X. Meng, D. Rubin, Maximum likelihood estimation via the ECM algorithm: a general framework, Biometrika 80 (2) (1993) 267.
57. W. Winkler, Using the EM algorithm for weight computation in the Fellegi-Sunter model of record linkage, in: Survey Research Methods, American Statistical Association, vol. 667, 1988, p. 671.
58. W. Winkler, Near automatic weight computation in the Fellegi-Sunter model of record linkage, in: Fifth Annual Research Conference, US Bureau of the Census, 1989.
59. S. Grannis, J. Overhage, C. McDonald, Analysis of identifier performance using a deterministic linkage algorithm, in: AMIA Annual Symposium, 2002, p. 305.
60. W. Cohen, Data integration using similarity joins and a word-based information representation language, ACM Transactions on Information Systems 18 (3) (2000) 288-321.
61. M.G. Elfeky, V.S. Verykios, A.K. Elmagarmid, TAILOR: a record linkage toolbox, in: IEEE ICDE, San Jose, 2002, pp. 17-28. (Pubitemid 34278693)
62. M. Bilenko, R.J. Mooney, Adaptive duplicate detection using learnable string similarity measures, in: ACM SIGKDD, Washington, DC, 2003, pp. 39-48.
63. B. On, N. Koudas, D. Lee, D. Srivastava, Group linkage, in: IEEE ICDE, Istanbul, Turkey, 2007, pp. 496-505. (Pubitemid 47422053)
64. M. Herschel, F. Naumann, S. Szott, M. Taubert, Scalable iterative graph duplicate detection, IEEE Transactions on Knowledge and Data Engineering 24 (11) (2012) 2094-2108.
65. I.H. Witten, A. Moffat, T.C. Bell, Managing Gigabytes, 2nd edition, Morgan Kaufmann, 1999.
66. V. Raghavan, P. Bollmann, G. Jung, A critical investigation of recall and precision as measures of retrieval system performance, ACM Transactions on Information Systems 7 (3) (1989) 205-229. (Pubitemid 21659999)
67. C. Manning, H. Schütze, MITCogNet, Foundations of Statistical Natural Language Processing, vol. 59, MIT Press, 1999.
68. N. Lavrač, P. Flach, B. Zupan, Rule evaluation measures: a unifying view, Inductive Logic Programming (1999) 174-185.
69. V.S. Verykios, A. Karakasidis, V. Mitrogiannis, Privacy preserving record linkage approaches, International Journal of Data Mining, Modelling and Management 1 (2) (2009) 206-221.
70. R. Hall, S. Fienberg, Privacy-preserving record linkage, in: Privacy in Statistical Databases, Springer Lecture Notes in Computer Science, vol. 6344, Corfu, Greece, 2010, pp. 269-283.
71. T. Churches, P. Christen, Some methods for blindfolded record linkage, BioMed Central Medical Informatics and Decision Making 4 (9) (2004).
72. A. Al-Lawati, D. Lee, P. McDaniel, Blocking-aware private record linkage, in: International Workshop on Information Quality in Information Systems, Baltimore, MD, USA, 2005, pp. 59-68.
73. T. Bachteler, R. Schnell, J. Reiher, An empirical comparison of approaches to approximate string matching in private record linkage, in: Statistics Canada Symposium, 2010.
74. A. Inan, M. Kantarcioglu, E. Bertino, M. Scannapieco, A hybrid approach to private record linkage, in: IEEE ICDE, Cancun, Mexico, 2008, pp. 496-505.
75. M. Yakout, M. Atallah, A. Elmagarmid, Efficient private record linkage, in: IEEE ICDE, Shanghai, 2009, pp. 1283-1286.
76. S. Weber, H. Lowe, A. Das, T. Ferris, A simple heuristic for blindfolded record linkage, Journal of the American Medical Informatics Association 19 (e1) (2012) e157-e161.
77. C. O'Keefe, M. Yung, L. Gu, R. Baxter, Privacy-preserving data linkage protocols, in: ACM Workshop on Privacy in the Electronic Society, Washington, DC, USA, 2004, pp. 94-102.
78. E. Durham, Y. Xue, M. Kantarcioglu, B. Malin, Quantifying the correctness, computational complexity, and security of privacy-preserving string comparators for record linkage, Information Fusion 13 (4) (2012) 245-259.
79. A. Karakasidis, V.S. Verykios, Advances in privacy preserving record linkage, in: E-activity and Innovative Technology, Advances in Applied Intelligence Technologies Book Series, IGI Global, 2010, pp. 22-34.
80. S. Trepetin, Privacy-preserving string comparisons in record linkage systems: a review, Information Security Journal: A Global Perspective 17 (5) (2008) 253-266.
81. P. Christen, Geocode matching and privacy preservation, in: KDD Workshop on Privacy, Security, and Trust, Las Vegas, 2009, pp. 7-24.
82. O. Goldreich, Foundations of Cryptography: Basic Applications, vol. 2, Cambridge University Press, 2004.
83. Y. Lindell, B. Pinkas, Secure multiparty computation for privacy-preserving data mining, Journal of Privacy and Confidentiality 1 (1) (2009) 5.
84. Y. Lindell, B. Pinkas, An efficient protocol for secure two-party computation in the presence of malicious adversaries, EUROCRYPT (2007) 52-78.
85. R. Canetti, Security and composition of multiparty cryptographic protocols, Journal of Cryptology 13 (1) (2000) 143-202.
86. L. Dusserre, C. Quantin, H. Bouzelat, A one way public key cryptosystem for the linkage of nominal files in epidemiological studies, Medinfo 8 (1995) 644-647.
87. C. Quantin, H. Bouzelat, F. Allaert, A. Benhamiche, J. Faivre, L. Dusserre, How to ensure data security of an epidemiological follow-up: quality assessment of an anonymous record linkage procedure, International Journal of Medical Informatics 49 (1) (1998) 117-122. (Pubitemid 28353812)
88. H. Bouzelat, C. Quantin, L. Dusserre, Extraction and anonymity protocol of medical file, in: AMIA Fall Symposium, 1996, pp. 323-327.
89. C. Quantin, H. Bouzelat, F.-A. Allaert, A.-M. Benhamiche, J. Faivre, L. Dusserre, Automatic record hash coding and linkage for epide-miological follow-up data confidentiality, Methods of Information in Medicine 37 (3) (1998) 271-277. (Pubitemid 28450065)
90. B. Schneier, Applied Cryptography: Protocols, Algorithms, and Source Code in C, 2nd edition, John Wiley & Sons Inc., New York, 1996.
91. H. Krawczyk, M. Bellare, R. Canetti, HMAC: Keyed-Hashing for Message Authentication, RFC Editor, 1997.
92. S. Singh, The Code Book: The Secret History of Codes and Code-breaking, Fourth Estate-E-books-General, 2010.
93. C. Clifton, M. Kantarcioglu, J. Vaidya, X. Lin, M. Zhu, Tools for privacy preserving distributed data mining, SIGKDD Explorations 4 (2) (2002) 28-34.
94. A. Yao, How to generate and exchange secrets, in: 27th Annual Symposium on Foundations of Computer Science, IEEE, 1986, pp. 162-167.
95. O. Goldreich, S. Micali, A. Wigderson, How to play any mental game, in: 19th Annual ACM Symposium on Theory of Computing, New York, USA, 1987, pp. 218-229.
96. R. Agrawal, A. Evfimievski, R. Srikant, Information sharing across private databases, in: ACM SIGMOD, San Diego, 2003, pp. 86-97.
97. L. Kissner, D. Song, Private and Threshold Set-intersection, Technical Report, Carnegie Mellon University, 2005.
98. M. Luby, C. Rackoff, How to construct pseudo-random permutations from pseudo-random functions, in: CRYPTO, vol. 85, 1986, p. 447.
99. D. Song, D. Wagner, A. Perrig, Practical techniques for searches on encrypted data, in: IEEE Symposium on Security and Privacy, 2000, pp. 44-55.
100. M. Freedman, Y. Ishai, B. Pinkas, O. Reingold, Keyword search and oblivious pseudorandom functions, Theory of Cryptography (2005) 303-324. (Pubitemid 41231171)
101. A. Karakasidis, V.S. Verykios, P. Christen, Fake injection strategies for private phonetic matching, in: International Workshop on Data Privacy Management, Leuven, Belgium, 2011.
102. M. Scannapieco, I. Figotin, E. Bertino, A. Elmagarmid, Privacy preserving schema and data matching, in: ACM SIGMOD, Beijing, China, 2007, pp. 653-664. (Pubitemid 47630842)
103. C. Pang, L. Gu, D. Hansen, A. Maeder, Privacy-preserving fuzzy matching using a public reference table, Intelligent Patient Management (2009) 71-89.
104. D. Vatsalan, P. Christen, V.S. Verykios, An efficient two-party protocol for approximate matching in private record linkage, in: AusDM, CRPIT, vol. 121, Ballarat, Australia, 2011, pp. 125-136.
105. L. Sweeney, K-anonymity: a model for protecting privacy, International Journal of Uncertainty Fuzziness and Knowledge Based Systems 10 (5) (2002) 557-570. (Pubitemid 35384857)
106. N. Li, T. Li, S. Venkatasubramanian, T-closeness: privacy beyond k-anonymity and l-diversity, in: IEEE ICDE, Istanbul, Turkey, 2007, pp. 106-115. (Pubitemid 47422014)
107. A. Machanavajjhala, D. Kifer, J. Gehrke, M. Venkitasubramaniam, l-diversity: privacy beyond k-anonymity, ACM Transactions on Knowledge Discovery from Data 1 (1) (2007) 3.
108. M. Kantarcioglu, W. Jiang, B. Malin, A privacy-preserving framework for integrating person-specific databases, in: Privacy in Statistical Databases, Springer, 2008, pp. 298-314.
109. N. Mohammed, B. Fung, M. Debbabi, Anonymity meets game theory: secure data integration with malicious participants, International Journal on Very Large Databases 20 (4) (2011) 567-588.
110. A. Karakasidis, V.S. Verykios, Reference table based k-anonymous private blocking, in: 27th Annual ACM Symposium on Applied Computing, Trento, Italy, 2012.
111. B. Bloom, Space/time trade-offs in hash coding with allowable errors, Communications of the ACM 13 (7) (1970) 422-426.
112. A. Broder, M. Mitzenmacher, Network applications of bloom filters: a survey, Internet Mathematics 1 (4) (2004) 485-509.
113. E. Durham, Y. Xue, M. Kantarcioglu, B. Malin, Private medical record linkage with approximate matching, in: AMIA Annual Symposium, Washington, DC, 2010, p. 182.
114. R. Schnell, T. Bachteler, J. Reiher, Privacy-preserving record linkage using bloom filters, BMC Medical Informatics and Decision Making 9 (1) (2009).
115. A. Karakasidis, V.S. Verykios, Secure blocking+secure matching = secure record linkage, Journal of Computing Science and Engineering 5 (2011) 223-235.
116. P. Lai, S. Yiu, K. Chow, C. Chong, L. Hui, An efficient Bloom filter based solution for multiparty private matching, in: SAM, Las Vegas, 2006, p. 7.
117. D. Vatsalan, P. Christen, An iterative two-party protocol for scalable privacy-preserving record linkage, in: AusDM, CRPIT, vol. 134, Sydney, Australia, 2012.
118. H. Kargupta, S. Datta, Q. Wang, K. Sivakumar, On the privacy preserving properties of random data perturbation techniques, in: IEEE ICDM, Florida, USA, 2003, pp. 99-106.
119. A. Inan, M. Kantarcioglu, G. Ghinita, E. Bertino, Private record matching using differential privacy, in: EDBT, Lausanne, Switzerland, 2010, pp. 123-134.
120. C. Dwork, Differential privacy, in: International Colloquium on Automata, Languages and Programming, 2006, pp. 1-12.
121. C. Papadimitriou, Computational Complexity, John Wiley and Sons Ltd., 2003.
122. M. Kuzu, M. Kantarcioglu, E. Durham, B. Malin, A constraint satisfaction cryptanalysis of Bloom filters in private record linkage, in: Privacy Enhancing Technologies, Springer, 2011, pp. 226-245.
123. C. Shannon, W. Weaver, The Mathematical Theory of Communication, vol. 19, University of Illinois Press, Urbana, 1962.
124. P. Christen, A. Pudjijono, Accurate synthetic generation of realistic personal information, in: PAKDD, Lecture Notes in Artificial Intelligence, vol. 5476, Springer, Bangkok, Thailand, 2009, pp. 507-514.
125. J. Hoag, C. Thompson, A parallel general-purpose synthetic data generator, ACM SIGMOD 36 (1) (2007) 19-24.
126. E. Van Eycken, K. Haustermans, F. Buntinx, A. Ceuppens, J. Weyler, E. Wauters, O. Van, et al., Evaluation of the encryption procedure and record linkage in the Belgian National Cancer Registry, Archives of Public Health 58 (6) (2000) 281-294. (Pubitemid 32798834)
127. W. Du, M. Atallah, Protocols for secure remote database access with approximate matching, in: E-Commerce Security and Privacy, Springer, 2001.
128. E. Durham, A Framework for Accurate, Efficient Private Record Linkage, Ph.D. Thesis, Vanderbilt University, 2012.
129. M. Atallah, F. Kerschbaum, W. Du, Secure and private sequence comparisons, in: Workshop on Privacy in the Electronic Society, ACM, Washington, DC, USA, 2003.
130. P. Ravikumar, W. Cohen, S. Fienberg, A secure protocol for computing string distance metrics, in: Workshop on Privacy and Security Aspects of Data Mining held at IEEE ICDM, Brighton, UK, 2004.
131. F. Li, Y. Chen, B. Luo, D. Lee, P. Liu, Privacy preserving group linkage, in: Scientific and Statistical Database Management, Springer, 2011, pp. 432-450.
132. G. Hjaltason, H. Samet, Properties of embedding methods for similarity searching in metric spaces, IEEE Transactions on Pattern Analysis and Machine Intelligence 25 (5) (2003) 530-549.
133. D. Lin, An information-theoretic definition of similarity, in: ICML, vol. 1, Madison, WI, USA, 1998, pp. 296-304.
134. B. Hawashin, F. Fotouhi, T. Truta, A privacy preserving efficient protocol for semantic similarity join using long string attributes, in: ACM Workshop on Privacy and Anonymity in the Information Society, Sweden, 2011, p. 6.
135. R. Coifman, S. Lafon, Diffusion maps, Applied and Computational Harmonic Analysis 21 (1) (2006) 5-30. (Pubitemid 43947619)
136. S. Deerwester, S. Dumais, G. Furnas, T. Landauer, R. Harshman, Indexing by latent semantic analysis, Journal of the American Society for Information Science 41 (6) (1990) 391-407.
137. X. He, P. Niyogi, Locality Preserving Projections, vol. 103, MIT Press, Vancouver, Canada, 2004.
138. W. Jiang, C. Clifton, A secure distributed framework for achieving k-anonymity, International Journal on Very Large Data Bases 15 (4) (2006) 316-333.
139. M. Sadinle, R. Hall, S. Fienberg, Approaches to multiple record linkage, in: International Statistical Institute, Dublin, Ireland, 2011.
140. L. Wu, X. Ying, X. Wu, Reconstruction from randomized graph via low rank approximation, in: SIAM, Columbus, Ohio, USA, 2010, pp. 60-71.
141. E. Zheleva, L. Getoor, Preserving the privacy of sensitive relationships in graph data, in: 1st ACM SIGKDD Workshop on Privacy, Security, and Trust, Springer-Verlag, San Jose, USA, 2007, pp. 153-171.
142. M. Reiter, A. Rubin, Crowds: anonymity for web transactions, ACM Transactions on Information and System Security 1 (1) (1998) 66-92.
143. D. Barone, A. Maurino, F. Stella, C. Batini, A privacy-preserving framework for accuracy and completeness quality assessment, Emerging Paradigms in Informatics, Systems and Communication (2009) 83.