Skip to main content

PRES\(^3\): Private Record Linkage Using Services, Spark and Soundex

  • Conference paper
  • First Online:
Service-Oriented Computing – ICSOC 2022 Workshops (ICSOC 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13821))

Included in the following conference series:

  • 632 Accesses

Abstract

One of the most challenging tasks that emerged in the last few years is linking records from distinct organizations, while maintaining privacy. Private Record Linkage is by definition a resource demanding task. Considering the continuously increasing volumes of data that have to be linked is a fact leading us to develop solutions that will conclude the process in a timely manner. To this end, we demonstrate PRES\(^3\), a system for performing private record linkage based on a service-oriented architecture, harvesting the power of Apache Spark.

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 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.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

Notes

  1. 1.

    Implementation available at: https://github.com/kostasrazgkelis/PRES3.

References

  1. Christen, P.: Data Matching - Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection. Springer, Data-Centric Systems and Applications (2012)

    Book  Google Scholar 

  2. Efthymiou, V., Stefanidis, K., Pitoura, E., Christophides, V.: FairER: entity resolution with fairness constraints. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pp. 3004–3008 (2021)

    Google Scholar 

  3. Heng, Y., Armknecht, F., Chen, Y., Schnell, R.: On the effectiveness of graph matching attacks against privacy-preserving record linkage. PLoS ONE 17(9), e0267893 (2022)

    Article  Google Scholar 

  4. Karakasidis, Alexandros, Koloniari, Georgia: Phonetics-based parallel privacy preserving record linkage. In: Xhafa, Fatos, Caballé, Santi, Barolli, Leonard (eds.) 3PGCIC 2017. LNDECT, vol. 13, pp. 179–190. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-69835-9_16

    Chapter  Google Scholar 

  5. Stammler, S., et al.: Mainzelliste secureepilinker (MainSEL): privacy-preserving record linkage using secure multi-party computation. Bioinformatics 38(6), 1657–1668 (2022)

    Article  Google Scholar 

  6. Tóth, C., Durham, E.A., Kantarcioglu, M., Xue, Y., Malin, B.A.: SOEMPI: a secure open enterprise master patient index software toolkit for private record linkage. In: AMIA Annual Symposium Proceedings, pp. 1105–1114 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Konstantinos Razgkelis .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Razgkelis, K., Karakasidis, A. (2023). PRES\(^3\): Private Record Linkage Using Services, Spark and Soundex. In: Troya, J., et al. Service-Oriented Computing – ICSOC 2022 Workshops. ICSOC 2022. Lecture Notes in Computer Science, vol 13821. Springer, Cham. https://doi.org/10.1007/978-3-031-26507-5_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-26507-5_37

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-26506-8

  • Online ISBN: 978-3-031-26507-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics