Skip to main content

Towards Privacy-Preserving Record Linkage with Record-Wise Linkage Policy

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10438))

Included in the following conference series:

  • 1090 Accesses

Abstract

We consider a situation that a large number of individuals contribute their personal data to multiple databases, and an analyst is allowed to issue a request of record linkage across any two of these databases. In such a situation, one concern is that very detailed information about individuals can be eventually obtained by analysts through sequential requests of record linkage across various database pairs. To resolve this privacy concern, we introduce a novel privacy notion for record linkage, record-wise linkage policy, with which each data contributor can individually designate database pairs that are allowed (resp. banned) to process record linkage by whitelist (resp. blacklist). We propose a secure multi-party computation to achieve record linkage with record-wise linkage policies. Also, we prove that our protocol can securely evaluate PPRL without violating given linkage policies and evaluate the efficiency of our protocol with experiments.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory (TOCT) 6(3), 13 (2014)

    MathSciNet  MATH  Google Scholar 

  2. Churches, T., Christen, P.: Blind data linkage using n-gram similarity comparisons. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS, vol. 3056, pp. 121–126. Springer, Heidelberg (2004). doi:10.1007/978-3-540-24775-3_15

    Chapter  Google Scholar 

  3. ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10–18. Springer, Heidelberg (1985). doi:10.1007/3-540-39568-7_2

    Chapter  Google Scholar 

  4. Elmagarmid, A.K., Ipeirotis, P.G., Verykios, V.S.: Duplicate record detection: a survey. IEEE Trans. Knowl. Data Eng. 19(1), 1–16 (2007)

    Article  Google Scholar 

  5. Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, Cambridge (2009)

    MATH  Google Scholar 

  6. Halevi, S., Shoup, V.: HELib. (2017). http://shaih.github.io/HElib. Accessed 10 Apr 2017

  7. Hall, R., Fienberg, S.E.: Privacy-preserving record linkage. In: Domingo-Ferrer, J., Magkos, E. (eds.) PSD 2010. LNCS, vol. 6344, pp. 269–283. Springer, Heidelberg (2010). doi:10.1007/978-3-642-15838-4_24

    Chapter  Google Scholar 

  8. Han, S., Shen, D., Nie, T., Kou, Y., Yu, G.: Scalable private blocking technique for privacy-preserving record linkage. In: Li, F., Shim, K., Zheng, K., Liu, G. (eds.) APWeb 2016. LNCS, vol. 9932, pp. 201–213. Springer, Cham (2016). doi:10.1007/978-3-319-45817-5_16

    Chapter  Google Scholar 

  9. Higham, N.J.: Accuracy and stability of numerical algorithms (2002)

    Google Scholar 

  10. Hore, B., Mehrotra, S., Tsudik, G.: A privacy-preserving index for range queries. In: Proceedings of 30th International Conference on Very Large Data Bases, VLDB Endowment, vol. 30, pp. 720–731 (2004)

    Google Scholar 

  11. Inan, A., Kantarcioglu, M., Bertino, E., Scannapieco, M.: A hybrid approach to private record linkage. In: IEEE 24th International Conference on Data Engineering, pp. 496–505. IEEE (2008)

    Google Scholar 

  12. Karakasidis, A., Verykios, V.S.: Privacy preserving record linkage using phonetic codes. In: Fourth Balkan Conference on Informatics, BCI 2009, pp. 101–106. IEEE (2009)

    Google Scholar 

  13. Karakasidis, A., Verykios, V.S.: Secure blocking + secure matching = secure record linkage. J. Comput. Sci. Eng. 5(3), 223–235 (2011)

    Article  Google Scholar 

  14. Kissner, L., Song, D.: Private and threshold set-intersection. Technical report, DTIC Document (2004)

    Google Scholar 

  15. Kum, H.C., Krishnamurthy, A., Machanavajjhala, A., Reiter, M.K., Ahalt, S.: Privacy preserving interactive record linkage (PPIRL). J. Am. Med. Inform. Assoc. 21(2), 212–220 (2014)

    Article  Google Scholar 

  16. Kuzu, M., Kantarcioglu, M., Inan, A., Bertino, E., Durham, E., Malin, B.: Efficient privacy-aware record integration. In: Proceedings of 16th International Conference on Extending Database Technology, pp. 167–178. ACM (2013)

    Google Scholar 

  17. Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: Proceedings of 3rd ACM Workshop on Cloud Computing Security Workshop, pp. 113–124. ACM (2011)

    Google Scholar 

  18. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999). doi:10.1007/3-540-48910-X_16

    Google Scholar 

  19. Sakazaki, H., Anzai, K.: Proposal of secret computation scheme corresponding to many-to-many encryption and decryption. In: Proceedings of Computer Security Symposium 2016, vol. 2016, pp. 53–59, October 2016

    Google Scholar 

  20. Scannapieco, M., Figotin, I., Bertino, E., Elmagarmid, A.K.: Privacy preserving schema and data matching. In: Proceedings of 2007 ACM SIGMOD International Conference on Management of Data, pp. 653–664. ACM (2007)

    Google Scholar 

  21. Schnell, R., Bachteler, T., Reiher, J.: Privacy-preserving record linkage using bloom filters. BMC Med. Inform. Decis. Mak. 9(1), 41 (2009)

    Article  Google Scholar 

  22. Vatsalan, D., Christen, P., Verykios, V.S.: A taxonomy of privacy-preserving record linkage techniques. Inf. Syst. 38(6), 946–969 (2013)

    Article  Google Scholar 

  23. Verykios, V.S., Karakasidis, A., Mitrogiannis, V.K.: Privacy preserving record linkage approaches. Int. J. Data Min. Model. Manag. 1(2), 206–221 (2009)

    MATH  Google Scholar 

  24. di Vimercati, S.D.C., Foresti, S., Jajodia, S., Paraboschi, S., Samarati, P.: Controlled information sharing in collaborative distributed query processing. In: 28th International Conference on Distributed Computing Systems, ICDCS 2008, pp. 303–310. IEEE (2008)

    Google Scholar 

  25. Yakout, M., Atallah, M.J., Elmagarmid, A.: Efficient private record linkage. In: IEEE 25th International Conference on Data Engineering, pp. 1283–1286. IEEE (2009)

    Google Scholar 

Download references

Acknowledgement

This research was partly supported by the program “Research and Development on Real World Big Data Integration and Analysis” of the Ministry of Education, Culture, Sports, Science and Technology, Japan and RIKEN and JST CREST Grant Number JPMJCR1302, Japan.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wen-jie Lu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Kaiho, T., Lu, Wj., Amagasa, T., Sakuma, J. (2017). Towards Privacy-Preserving Record Linkage with Record-Wise Linkage Policy. In: Benslimane, D., Damiani, E., Grosky, W., Hameurlain, A., Sheth, A., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2017. Lecture Notes in Computer Science(), vol 10438. Springer, Cham. https://doi.org/10.1007/978-3-319-64468-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-64468-4_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-64467-7

  • Online ISBN: 978-3-319-64468-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics