pith. sign in

arxiv: 2604.08019 · v1 · submitted 2026-04-09 · 💻 cs.CR

xDup: Privacy-Preserving Deduplication for Humanitarian Organizations using Fuzzy PSI

Tim Rausch , Sylvain Chatel , Wouter Lueks This is my paper

Pith reviewed 2026-05-10 18:14 UTC · model grok-4.3

classification 💻 cs.CR
keywords privacy-preserving deduplicationfuzzy private set intersectionhumanitarian aidHamming distancecross-organizational data sharing
0
0 comments X

The pith

xDup lets humanitarian groups deduplicate aid recipients privately using a new fuzzy PSI protocol that runs two orders of magnitude faster than prior methods.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that current deduplication methods expose sensitive data on vulnerable people when organizations share lists to avoid double aid payments. xDup solves this by performing the check through fuzzy private set intersection so that only the duplicates are revealed and nothing else. The system rests on otFPSI, a new protocol for Hamming-distance fuzzy matching that needs no special assumptions on the input data. The authors report that the full pipeline finishes the task two orders of magnitude quicker than existing privacy-preserving alternatives while still satisfying the operational constraints of real field missions. A sympathetic reader cares because limited budgets can now reach more people without increasing privacy harm.

Core claim

We present xDup, a new practical deduplication system that meets the requirements of humanitarian organizations and is two orders of magnitude faster than current solutions. xDup builds on Fuzzy PSI, and we present otFPSI, a concretely efficient Fuzzy PSI protocol for Hamming Space without input assumptions. We show that it is more efficient than existing Fuzzy PSI protocols.

What carries the argument

otFPSI, a concretely efficient Fuzzy PSI protocol for Hamming Space without input assumptions, which performs the fuzzy matching that lets xDup reveal only duplicate registrations.

If this is right

  • Organizations can now cross-check lists without ever sending plaintext records or even full encrypted records to each other.
  • The same fuzzy-PSI building block can be reused for other humanitarian tasks that require approximate matching under privacy constraints.
  • Budget allocation improves because double registrations are removed without creating new data-protection liabilities.
  • Field teams avoid the legal and ethical overhead of obtaining broad consent for data sharing across borders.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If otFPSI scales to larger Hamming distances or other metrics, it could replace custom fuzzy matching in medical or census record linkage.
  • The absence of input assumptions makes the protocol attractive for settings where data distributions are unknown in advance.
  • Deployment would still require each organization to run its own secure hardware or trusted execution environment for the protocol steps.

Load-bearing premise

The requirements analysis accurately captures the operational constraints and privacy needs of real humanitarian missions, and the claimed efficiency gains hold under actual field data distributions and network conditions.

What would settle it

Run xDup and the fastest prior fuzzy-PSI deduplication system on the same real humanitarian registration data set over a typical field network and measure whether xDup finishes at least 50 times faster while still returning only the duplicate flags.

Figures

Figures reproduced from arXiv: 2604.08019 by Sylvain Chatel, Tim Rausch, Wouter Lueks.

Figure 1
Figure 1. Figure 1: High-level deduplication process Most organizations currently use an asynchronous dedupli￾cation process, which xDup supports. Yet, xDup can also pro￾vide an online deduplication mechanism (like Janus [33]), but this still requires asynchronous manual verification. Step 0. Registering Aid Recipients. Field teams register aid recipients for the aid programs they operate. As part of the registration process,… view at source ↗
Figure 2
Figure 2. Figure 2: Illustration of xDup. using generic Secure Multi-Party Computation (SMC) or Homomorphic Encryption (HE) are too costly to fulfill the scalability requirement (RQ.D4). This is especially the case for the online operation mode, where the responding party inherently needs to perform computation linear in the database size. Many existing mechanisms to reduce the number of comparisons typically assume that the … view at source ↗
Figure 3
Figure 3. Figure 3: FFPSI, Ideal functionality for FPSI between querier Q with input Q and responder R with input R. [n] = {1, ..., n}. brings challenges. First, the key management is non-trivial: under which key are the ciphertexts encrypted, who per￾forms the decryption, etc. Second, secret-key holders must be online for decryption. One potential solution would be to operate under the querying organization’s key. To guarant… view at source ↗
Figure 4
Figure 4. Figure 4: FssFPSI, Ideal secret-shared FPSI functionality between node S1 with input Q, R and node S2 with input Q, b Rb. The output is secret-shared across M and Mc. Ti: One-Time Setup L1, L2 ← [ ] for r ∈ Ri : s ←$ {0, 1} l L1.append(s) L2.append(s ⊕ E(r)) Send L1 to S1 and L2 to S2 Si: One-Time Setup for j ∈ [nT ] : Receive Dj from Tj [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: One-time setup procedures with embedding [PITH_FULL_IMAGE:figures/full_fig_p007_5.png] view at source ↗
Figure 7
Figure 7. Figure 7: To compare two sets Q and R, it loops over each q ∈ Q, computes the distances to all r ∈ R using batching, and compares each computed distance to the threshold τ . We proof correctness and security of otFPSI in Appendix B. Complexity. We analyze the asymptotic complexity of otF￾PSI. The distance computation step performs nQl 1-out-of-2 chosen OTs with a message length of nR log p. As p ∈ O(l), this results… view at source ↗
Figure 8
Figure 8. Figure 8: Full otFPSI-ss protocol. mod p ≤ τ ) ⊕ Pb for i ∈ Zp. Server S1 retrieves P = vD through OT and outputs P, S2 outputs Pb. Correctness. By construction, we have D − M mod p = dH(q⊕r, qb⊕rb) = dH(q, r) and P = (D−M mod p ≤ τ )⊕ Pb = (dH(q, r) ≤ τ ) ⊕ Pb, hence P ⊕ Pb = (dH(q, r) ≤ τ ). otFPSI-ss. Our first secret-shared FPSI protocol, otFPSI-ss, applies the single comparison outlined above to all pairs of re… view at source ↗
Figure 9
Figure 9. Figure 9: Full otFPSI-ssb protocol. 7. Evaluation Implementation. To demonstrate the performance of xDup, we implement the core FPSI construction in C++ and pro￾vide extensive benchmarks. We publish this implementation as part of our artifact [75]. For 1-out-of-2 OT, we use SilentOT [9] provided by the libOTe library [78] (in Ap￾pendix D.1, we also provide evaluations with SoftSpokenOT [79]). We implement the 1-out-… view at source ↗
Figure 10
Figure 10. Figure 10: Runtime otFPSI with SilentOT, DA-PSI, and Approx-PSI (nQ = nR = 100, 320 Mbit/s, 20 ms latency). TABLE 3. RUN TIME AND COMMUNICATION OF APPROX-PSI [19] (GAP t = log l) AND OTFPSI WITH SILENTOT BY SET SIZE n = nQ = nR (l = 128, τ = 4, GIGABIT NETWORK). Approx-PSI otFPSI n Run time Comm Run time Comm 256 38.7 s 466 MiB 0.310 s 9.22 MiB 1024 148 s 1.74 GiB 4.60 s 145 MiB 4096 570 s 6.71 GiB 72.8 s 2.27 GiB T… view at source ↗
Figure 11
Figure 11. Figure 11: Overview over 1-out-of-N OT variants. As for the single comparison (§6.3), # ”Di [k]− # ” Mi [k] mod p = dH(qi , rk) holds for i ∈ [nQ], k ∈ [nR]. Hence, (i, k) ∈ outotFPSI Q (Q, R) ⇐⇒ bi,k = 1 ⇐⇒ # ”Di [k] − # ” Mi [k] mod p ≤ τ ⇐⇒ dH(qi , rk) ≤ τ ⇐⇒ (i, k) ∈ FFPSI,Q(Q, R). Thus, outotFPSI-h(Q, R) = FFPSI(Q, R) and otFPSI is correct. Security. A party P’s view viewotFPSI-h P (Q, R) consists of its input … view at source ↗
Figure 12
Figure 12. Figure 12: Accuracy of classifying records as duplicate/non-duplicate in a [PITH_FULL_IMAGE:figures/full_fig_p019_12.png] view at source ↗
Figure 14
Figure 14. Figure 14: Run time of otFPSI for nQ = nR = 256 by dimension l (τ = 42, Gigabit, SoftSpoken OTe). OT block. Thus, for completeness, we also evaluate otFPSI with SoftSpokenOT [79]. SilentOT and SoftSpokenOT provide a different trade￾off in terms of communication and computation cost: While SilentOT is significantly more communication-efficient, it requires more computation and different cryptographic hard￾ness assump… view at source ↗
read the original abstract

Humanitarian organizations help to ensure people's livelihoods in crisis situations. Typically, multiple organizations operate in the same region. To ensure that the limited budget of these organizations can help as many people as possible, organizations perform cross-organizational deduplication to detect duplicate registrations and ensure recipients receive aid from at most one organization. Current deduplication approaches risk privacy harm to vulnerable aid recipients by sharing their data with other organizations. We analyzed the needs of humanitarian organizations to identify the requirements for privacy-friendly cross-organizational deduplication fit for real-life humanitarian missions. We present xDup, a new practical deduplication system that meets the requirements of humanitarian organizations and is two orders of magnitude faster than current solutions. xDup builds on Fuzzy PSI, and we present otFPSI, a concretely efficient Fuzzy PSI protocol for Hamming Space without input assumptions. We show that it is more efficient than existing Fuzzy PSI protocols.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript introduces xDup, a privacy-preserving cross-organizational deduplication system for humanitarian organizations. It first derives operational and privacy requirements from real humanitarian missions, then presents otFPSI, a new concretely efficient Fuzzy PSI protocol for Hamming space with no input assumptions, and builds xDup on top of it. The central claim is that xDup meets the derived requirements while delivering two orders of magnitude better performance than existing deduplication solutions.

Significance. If the concrete efficiency numbers and security arguments hold, the work directly addresses a high-stakes practical problem: enabling aid organizations to avoid duplicate registrations without exposing sensitive recipient data. The focus on humanitarian constraints and the removal of input assumptions in otFPSI are genuine strengths; reproducible code or machine-checked proofs would further elevate the contribution.

major comments (2)
  1. [§5] §5 (Performance Evaluation): The claim that xDup/otFPSI is two orders of magnitude faster than prior Fuzzy PSI protocols rests on benchmarks whose network parameters (bandwidth, latency) and input distributions are not shown to match the low-bandwidth, skewed-data conditions typical of crisis-zone deployments. Without this justification, the practicality assertion for the target humanitarian use case cannot be assessed from the reported numbers.
  2. [§4] §4 (otFPSI Protocol): The security argument for otFPSI is presented at a high level; a concrete reduction to the underlying oblivious-transfer or PSI assumptions, including the precise leakage profile under the Hamming-distance threshold, is needed to substantiate the privacy guarantees required by the humanitarian requirements analysis.
minor comments (2)
  1. A summary table comparing communication and computation costs of otFPSI against the most relevant prior Fuzzy PSI constructions (with exact bit lengths and party counts) would improve readability of the efficiency claims.
  2. The requirements section would benefit from an explicit mapping table showing which protocol features satisfy each identified humanitarian constraint.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their constructive comments on our manuscript. The feedback identifies key areas where additional detail will strengthen the presentation of our performance results and security arguments for xDup and otFPSI. We address each major comment below and commit to the indicated revisions.

read point-by-point responses

  1. Referee: [§5] §5 (Performance Evaluation): The claim that xDup/otFPSI is two orders of magnitude faster than prior Fuzzy PSI protocols rests on benchmarks whose network parameters (bandwidth, latency) and input distributions are not shown to match the low-bandwidth, skewed-data conditions typical of crisis-zone deployments. Without this justification, the practicality assertion for the target humanitarian use case cannot be assessed from the reported numbers.

    Authors: We acknowledge that our current benchmark description in §5 uses standard WAN parameters from the PSI literature without explicit mapping to humanitarian deployment conditions. To address this, we will revise §5 to add a dedicated paragraph justifying the chosen bandwidth and latency values based on publicly available connectivity reports from organizations such as UNHCR and WFP operating in crisis zones. We will also include additional micro-benchmark results and discussion for skewed input distributions that reflect typical aid-recipient data patterns. These changes will allow readers to directly assess practicality for the target setting. revision: yes

  2. Referee: [§4] §4 (otFPSI Protocol): The security argument for otFPSI is presented at a high level; a concrete reduction to the underlying oblivious-transfer or PSI assumptions, including the precise leakage profile under the Hamming-distance threshold, is needed to substantiate the privacy guarantees required by the humanitarian requirements analysis.

    Authors: We agree that the security argument in §4 would benefit from greater formality. In the revised manuscript we will expand this section to include an explicit security reduction of otFPSI to the assumptions of the underlying oblivious-transfer protocol and base PSI scheme. We will also state the precise leakage profile, clarifying exactly what information (if any) is revealed about pairs whose Hamming distance exceeds the threshold. This expanded treatment will directly tie the protocol's guarantees to the privacy requirements derived in §3. revision: yes

Circularity Check

0 steps flagged

No circularity: new protocol construction with empirical efficiency evaluation

full rationale

The paper introduces xDup and the otFPSI protocol as a fresh construction for fuzzy PSI in Hamming space without input assumptions. Efficiency claims rest on concrete implementation benchmarks and direct comparisons to prior protocols rather than any fitted parameters, self-definitional equations, or load-bearing self-citations that reduce the result to its own inputs. The humanitarian requirements are treated as external inputs used to guide design, and the performance advantage is presented as an empirical outcome, not a tautological renaming or prediction forced by construction. The derivation chain remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Based on abstract only; paper likely relies on standard cryptographic assumptions for PSI security and fuzzy matching but no specific free parameters, axioms, or invented entities are detailed in the provided text.

pith-pipeline@v0.9.0 · 5457 in / 1108 out tokens · 33588 ms · 2026-05-10T18:14:04.530059+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

109 extracted references · 109 canonical work pages

  1. [1]

    Hacking attack on red cross exposes data of 515,000 vulnerable people,

    “Hacking attack on red cross exposes data of 515,000 vulnerable people,” Accessed 2025-09-24, 2022, https: //www.theguardian.com/world/2022/jan/20/hacking-attack-on- red-cross-exposes-data-of-515000-vulnerable-people

    work page 2025

  2. [2]

    Ukraine cash working group task team 3: Deduplication and reg- istration potential solutions for deduplication april 2022,

    “Ukraine cash working group task team 3: Deduplication and reg- istration potential solutions for deduplication april 2022,” Accessed 2025-09-24, 2022, https://reliefweb.int/report/ukraine/ukraine- cash-working-group-task-team-3-deduplication-and-registration- potential-solutions-deduplication-april-2022

    work page 2022

  3. [3]

    Privacy-Preserving Record Linkage Using Local Sensitive Hash and Private Set Intersection,

    A. Adir, E. Aharoni, N. Drucker, E. Kushnir, R. Masalha, M. Mirkin, and O. Soceanu, “Privacy-Preserving Record Linkage Using Local Sensitive Hash and Private Set Intersection,” in ACNS, 2022

    work page 2022

  4. [4]

    Blocking-aware private record linkage,

    A. Al-Lawati, D. Lee, and P. D. McDaniel, “Blocking-aware private record linkage,” in IQIS, 2005

    work page 2005

  5. [5]

    Amazon EC2 instance types,

    Amazon Web Services, Inc, “Amazon EC2 instance types,” Accessed 2025-09-24, 2025, https://aws.amazon.com/ec2/instance-types/

    work page 2025

  6. [6]

    Assumption-Free Fuzzy PSI via Predicate Encryption,

    E. Blass and G. Noubir, “Assumption-Free Fuzzy PSI via Predicate Encryption,” IACR Cryptol. ePrint Arch. , 2025

    work page 2025

  7. [7]

    On Enforcing the Digital Immunity of a Large Humanitarian Organization,

    S. L. Blond, A. Cuevas, J. R. Troncoso-Pastoriza, P. Jovanovic, B. Ford, and J. Hubaux, “On Enforcing the Digital Immunity of a Large Humanitarian Organization,” in IEEE SP, 2018

    work page 2018

  8. [8]

    Frequent grams based embedding for privacy preserving record linkage,

    L. Bonomi, L. Xiong, R. Chen, and B. C. M. Fung, “Frequent grams based embedding for privacy preserving record linkage,” in ACM CIKM, 2012

    work page 2012

  9. [9]

    Efficient Two-Round OT Extension and Silent Non- Interactive Secure Computation,

    E. Boyle, G. Couteau, N. Gilboa, Y . Ishai, L. Kohl, P. Rindal, and P. Scholl, “Efficient Two-Round OT Extension and Silent Non- Interactive Secure Computation,” in ACM CCS, 2019

    work page 2019

  10. [10]

    GSHADE: faster privacy-preserving distance computa- tion and biometric identification,

    J. Bringer, H. Chabanne, M. Favre, A. Patey, T. Schneider, and M. Zohner, “GSHADE: faster privacy-preserving distance computa- tion and biometric identification,” in ACM IH&MMSec, 2014

    work page 2014

  11. [11]

    SHADE: Secure HAm- ming DistancE Computation from Oblivious Transfer,

    J. Bringer, H. Chabanne, and A. Patey, “SHADE: Secure HAm- ming DistancE Computation from Oblivious Transfer,” in Financial Cryptography, 2013

    work page 2013

  12. [12]

    Min-Wise Independent Permutations,

    A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher, “Min-Wise Independent Permutations,” J. Comput. Syst. Sci. , 2000

    work page 2000

  13. [13]

    Efficient Fuzzy Labeled PSI from Vector Ring-OLE,

    D. Bui and K. Cong, “Efficient Fuzzy Labeled PSI from Vector Ring-OLE,” IACR Cryptol. ePrint Arch. , 2025

    work page 2025

  14. [14]

    Registration, Targeting and Deduplication: Emergency Response inside Ukraine,

    CALP Network, “Registration, Targeting and Deduplication: Emergency Response inside Ukraine,” Accessed 2025-09-24, 2022, https://www.calpnetwork.org/wp-content/uploads/2022/09/ Registration-Targeting-and-Deduplication-Emergency-Response- inside-Ukraine-Thematic-paper-1.pdf

    work page 2025

  15. [15]

    A hybrid private record linkage scheme: Separating differentially private synopses from matching records,

    J. Cao, F. Rao, E. Bertino, and M. Kantarcioglu, “A hybrid private record linkage scheme: Separating differentially private synopses from matching records,” in ICDE, 2015

    work page 2015

  16. [16]

    Distance-Aware Private Set Intersection,

    A. Chakraborti, G. Fanti, and M. K. Reiter, “Distance-Aware Private Set Intersection,” in USENIX Security, 2023

    work page 2023

  17. [17]

    Similarity estimation techniques from rounding algo- rithms,

    M. Charikar, “Similarity estimation techniques from rounding algo- rithms,” in ACM STOC, 2002

    work page 2002

  18. [18]

    Perfectly secure and efficient two-party electronic-health-record linkage,

    F. Chen, X. Jiang, S. Wang, L. M. Schilling, D. Meeker, T. Ong, M. E. Matheny, J. N. Doctor, L. Ohno-Machado, and J. Vaidya, “Perfectly secure and efficient two-party electronic-health-record linkage,” IEEE internet computing , 2018

    work page 2018

  19. [19]

    Approximate PSI with Near-Linear Communication,

    W. Chongchitmate, S. Lu, and R. Ostrovsky, “Approximate PSI with Near-Linear Communication,” IACR Cryptol. ePrint Arch. , 2024

    work page 2024

  20. [20]

    The Simplest Protocol for Oblivious Transfer,

    T. Chou and C. Orlandi, “The Simplest Protocol for Oblivious Transfer,” in Latincrypt, 2015

    work page 2015

  21. [21]

    Christen, Data Matching - Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection , ser

    P. Christen, Data Matching - Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection , ser. Data- Centric Systems and Applications, 2012

    work page 2012

  22. [22]

    Efficient Cryptanalysis of Bloom Filters for Privacy-Preserving Record Link- age,

    P. Christen, R. Schnell, D. Vatsalan, and T. Ranbaduge, “Efficient Cryptanalysis of Bloom Filters for Privacy-Preserving Record Link- age,” in PAKDD, 2017

    work page 2017

  23. [23]

    How biometric devices are putting afghans in danger,

    R. Ciesielski and M. Zierer, “How biometric devices are putting afghans in danger,” Accessed 2025-09-24, 2022, https://interaktiv. br.de/biometrie-afghanistan/en/index.html

    work page 2025

  24. [24]

    The EpiLink Record Linkage Software,

    P. Contiero, A. Tittarelli, G. Tagliabue, A. Maghini, S. Fabiano, P. Crosignani, and R. Tessandori, “The EpiLink Record Linkage Software,” Methods of Information in Medicine , 2005

    work page 2005

  25. [25]

    Eyes wide shut: The challenge of hu- manitarian biometrics,

    P. Currion, “Eyes wide shut: The challenge of hu- manitarian biometrics,” Accessed 2025-09-24, 2015, https://www.thenewhumanitarian.org/opinion/2015/08/26/eyes- wide-shut-challenge-humanitarian-biometrics

    work page 2025

  26. [26]

    The necessary interoperability of systems between organisations,

    DIGID Consortium, “The necessary interoperability of systems between organisations,” Accessed 2025-09-24, 2023, https://interoperability.ifrc.org/2023/05/23/the-necessary- interoperability-of-systems-between-organisations/

    work page 2025

  27. [27]

    Humanitarian data models for deduplication in cash coordination - internal briefing note,

    ——, “Humanitarian data models for deduplication in cash coordination - internal briefing note,” Accessed 2025-09-24, 2024, https://interoperability.ifrc.org/wp-content/uploads/2024/10/ Deduplication briefing-note.pdf

    work page 2025

  28. [28]

    Standardising humanitarian deduplication and adjudi- cation processes in cash coordination,

    ——, “Standardising humanitarian deduplication and adjudi- cation processes in cash coordination,” Accessed 2025-09- 24, 2024, https://interoperability.ifrc.org/wp-content/uploads/2024/ 10/CCT-briefing 19092024.pdf

    work page 2025

  29. [29]

    Deduplicating humanitarian aid in nigeria – pilot report,

    L. Douglas, “Deduplicating humanitarian aid in nigeria – pilot report,” Accessed 2025-09-24, 2023, https://www.frontiertechhub. org/s/DeDuplicatePilotReport-v2.pdf

    work page 2025

  30. [30]

    De-duplicating aid to enhance the im- pact of humanitarian assistance,

    L. Douglas and T. White, “De-duplicating aid to enhance the im- pact of humanitarian assistance,” Accessed 2025-09-24, 2023, https: //www.frontiertechhub.org/pilot-portfolio/deduplicatingaid-nigeria

    work page 2025

  31. [31]

    Private med- ical record linkage with approximate matching,

    E. Durham, Y . Xue, M. Kantarcioglu, and B. Malin, “Private med- ical record linkage with approximate matching,” in AMIA Annual Symposium Proceedings, 2010

    work page 2010

  32. [32]

    Composite Bloom Filters for Secure Record Linkage,

    E. A. Durham, M. Kantarcioglu, Y . Xue, C. T ´oth, M. Kuzu, and B. A. Malin, “Composite Bloom Filters for Secure Record Linkage,” IEEE Trans. Knowl. Data Eng. , 2014

    work page 2014

  33. [33]

    Janus: Safe Biometric Deduplication for Humanitarian Aid Distribution,

    K. Edalatnejad, W. Lueks, J. Sukaitis, V . G. Narbel, M. Marelli, and C. Troncoso, “Janus: Safe Biometric Deduplication for Humanitarian Aid Distribution,” in IEEE SP, 2024

    work page 2024

  34. [34]

    Efficient Private Match- ing and Set Intersection,

    M. J. Freedman, K. Nissim, and B. Pinkas, “Efficient Private Match- ing and Set Intersection,” in Eurocrypt, 2004

    work page 2004

  35. [35]

    Efficient Fuzzy Private Set Intersection from Fuzzy Mapping,

    Y . Gao, L. Qi, X. Liu, Y . Luo, and L. Wang, “Efficient Fuzzy Private Set Intersection from Fuzzy Mapping,” in Asiacrypt, 2024

    work page 2024

  36. [36]

    6 facts about GenKey’s ABIS – lightning fast dedupli- cation,

    GenKey, “6 facts about GenKey’s ABIS – lightning fast dedupli- cation,” Accessed 2025-09-24, 2016, https://www.genkey.com/wp- content/uploads/2016/12/GenKey-ABIS-eBook-version-2.0-1.pdf

    work page 2025

  37. [37]

    Modern Privacy-Preserving Record Linkage Techniques: An Overview,

    A. Gkoulalas-Divanis, D. Vatsalan, D. Karapiperis, and M. Kantar- cioglu, “Modern Privacy-Preserving Record Linkage Techniques: An Overview,” IEEE Trans. Inf. Forensics Secur., 2021

    work page 2021

  38. [38]

    Pancake: Frequency Smoothing for En- crypted Data Stores,

    P. Grubbs, A. Khandelwal, M. Lacharit ´e, L. Brown, L. Li, R. Agar- wal, and T. Ristenpart, “Pancake: Frequency Smoothing for En- crypted Data Stores,” in USENIX Security, 2020

    work page 2020

  39. [39]

    (1/3) Deep dive into beneficiary de-duplication in the nigerian context: Data management workflows,

    S. Haffar, “(1/3) Deep dive into beneficiary de-duplication in the nigerian context: Data management workflows,” Accessed 2025-09- 24, 2022, https://medium.com/frontier-technologies-hub/1-3-deep- dive-into-beneficiary-de-duplication-in-the-nigerian-context-data- management-workflows-261181d03da9

    work page 2025

  40. [40]

    Testing a new blockchain-based solution for addressing the beneficiary de-duplication problem,

    ——, “Testing a new blockchain-based solution for addressing the beneficiary de-duplication problem,” Accessed 2025-09-24, 2022, https://medium.com/frontier-technologies-hub/testing-a- new-blockchain-based-solution-for-addressing-the-beneficiary-de- duplication-problem-ce0cc352df6

    work page 2025

  41. [41]

    Blockchain-based deduplication: Towards a standardized data management practice,

    ——, “Blockchain-based deduplication: Towards a standardized data management practice,” Accessed 2025-09-24, 2023, https://medium.com/frontier-technologies-hub/blockchain-based- deduplication-towards-a-standardized-data-management-practice- 32f80fb5c78c

    work page 2025

  42. [42]

    Humanitarian aid deduplication using blockchain technol- ogy,

    ——, “Humanitarian aid deduplication using blockchain technol- ogy,” Accessed 2025-09-24, 2023, https://www.frontiertechhub.org/ insights/blockchain-de-duplication-6

    work page 2025

  43. [43]

    Private Computation on Common Fuzzy Records,

    K. Han, S. Kim, and Y . Son, “Private Computation on Common Fuzzy Records,” Proc. Priv. Enhancing Technol., 2025

    work page 2025

  44. [44]

    Com- posing Differential Privacy and Secure Computation: A Case Study on Scaling Private Record Linkage,

    X. He, A. Machanavajjhala, C. J. Flynn, and D. Srivastava, “Com- posing Differential Privacy and Secure Computation: A Case Study on Scaling Private Record Linkage,” in ACM SIGSAC, 2017

    work page 2017

  45. [45]

    Digital identity, biomet- rics and inclusion in humanitarian responses to refugee crises,

    K. Holloway, R. A. Masri, and A. A. Yahia, “Digital identity, biomet- rics and inclusion in humanitarian responses to refugee crises,” Ac- cessed 2025-09-24, 2021, https://www.calpnetwork.org/wp-content/ uploads/2021/10/Digital IP Biometrics case study web.pdf

    work page 2025

  46. [46]

    UN Shared Rohingya Data Without Informed Consent,

    Human Rights Watch, “UN Shared Rohingya Data Without Informed Consent,” Accessed 2025-09-24, 2021, https://www.hrw.org/news/ 2021/06/15/un-shared-rohingya-data-without-informed-consent

    work page 2025

  47. [47]

    Funshade: Function Secret Sharing for Two-Party Secure Thresholded Distance Eval- uation,

    A. Ibarrondo, H. Chabanne, and M. ¨Onen, “Funshade: Function Secret Sharing for Two-Party Secure Thresholded Distance Eval- uation,” Proc. Priv. Enhancing Technol., 2023

    work page 2023

  48. [48]

    Policy on the processing of biometric data by the ICRC,

    ICRC, “Policy on the processing of biometric data by the ICRC,” Accessed 2025-09-24, 2019, https://www.icrc.org/sites/default/ files/document/file list/icrc biometrics policy adopted 29 august 2019 .pdf

    work page 2025

  49. [49]

    Cyber attack on ICRC: What we know,

    ——, “Cyber attack on ICRC: What we know,” Accessed 2025-08- 04, 2022, https://www.icrc.org/en/document/cyber-attack-icrc-what- we-know

    work page 2025

  50. [50]

    Deduplication of people, families or households,

    IFRC, “Deduplication of people, families or households,” Accessed 2025-09-24, 2023, https://interoperability.ifrc. org/wp-content/uploads/2023/11/DIGIDInteroperability- Deduplicationofpeoplefamiliesorhouseholds.pdf

    work page 2025

  51. [51]

    A Hybrid Approach to Private Record Linkage,

    A. Inan, M. Kantarcioglu, E. Bertino, and M. Scannapieco, “A Hybrid Approach to Private Record Linkage,” in ICDE, 2008

    work page 2008

  52. [52]

    A Hybrid Approach to Private Record Matching,

    A. Inan, M. Kantarcioglu, G. Ghinita, and E. Bertino, “A Hybrid Approach to Private Record Matching,” IEEE Trans. Dependable Secur. Comput., 2012

    work page 2012

  53. [53]

    Extending Oblivious Transfers Efficiently,

    Y . Ishai, J. Kilian, K. Nissim, and E. Petrank, “Extending Oblivious Transfers Efficiently,” in Crypto, 2003

    work page 2003

  54. [54]

    Secure Blocking + Secure Matching = Secure Record Linkage,

    A. Karakasidis and V . S. Verykios, “Secure Blocking + Secure Matching = Secure Record Linkage,” J. Comput. Sci. Eng. , 2011

    work page 2011

  55. [55]

    An LSH-Based Blocking Approach with a Homomorphic Matching Technique for Privacy- Preserving Record Linkage,

    D. Karapiperis and V . S. Verykios, “An LSH-Based Blocking Approach with a Homomorphic Matching Technique for Privacy- Preserving Record Linkage,” IEEE Trans. Knowl. Data Eng. , 2015

    work page 2015

  56. [56]

    Privacy-preserving Fuzzy Name Matching for Sharing Financial Intelligence,

    H. Kasyap, U. I. Atmaca, C. Maple, G. Cormode, and J. He, “Privacy-preserving Fuzzy Name Matching for Sharing Financial Intelligence,” arXiv preprint, 2024

    work page 2024

  57. [57]

    White paper: AON-PRISMA all-or-nothing private similarity matching,

    F. Kerschbaum, H. Zhang, J. Premkumar, X. Li, F. Ebrahimi- anghazani, L. Gamez, K. Karabina, and P. Kotian, “White paper: AON-PRISMA all-or-nothing private similarity matching,” Accessed 2025-09-24, 2023, https://aon-prisma.dev/aonprisma.pdf

    work page 2025

  58. [58]

    Efficient Batched Oblivious PRF with Applications to Private Set Intersec- tion,

    V . Kolesnikov, R. Kumaresan, M. Rosulek, and N. Trieu, “Efficient Batched Oblivious PRF with Applications to Private Set Intersec- tion,” in ACM CCS, 2016

    work page 2016

  59. [59]

    Evaluation of entity resolution approaches on real-world match problems,

    H. K ¨opcke, A. Thor, and E. Rahm, “Evaluation of entity resolution approaches on real-world match problems,” Proc. VLDB Endow. , 2010

    work page 2010

  60. [60]

    Efficient Oblivious Database Joins,

    S. Krastnikov, F. Kerschbaum, and D. Stebila, “Efficient Oblivious Database Joins,” Proc. VLDB Endow., 2020

    work page 2020

  61. [61]

    Identifying Harmful Media in End- to-End Encrypted Communication: Efficient Private Membership Computation,

    A. Kulshrestha and J. R. Mayer, “Identifying Harmful Media in End- to-End Encrypted Communication: Efficient Private Membership Computation,” in USENIX Security, 2021

    work page 2021

  62. [62]

    A Constraint Satisfaction Cryptanalysis of Bloom Filters in Private Record Linkage,

    M. Kuzu, M. Kantarcioglu, E. Durham, and B. A. Malin, “A Constraint Satisfaction Cryptanalysis of Bloom Filters in Private Record Linkage,” in PETS, 2011

    work page 2011

  63. [63]

    Efficient privacy-aware record integration,

    M. Kuzu, M. Kantarcioglu, A. Inan, E. Bertino, E. Durham, and B. A. Malin, “Efficient privacy-aware record integration,” in EDBT, 2013

    work page 2013

  64. [64]

    An Efficient Bloom Filter Based Solution for Multiparty Private Matching,

    P. K. Y . Lai, S. Yiu, K. Chow, C. F. Chong, and L. C. K. Hui, “An Efficient Bloom Filter Based Solution for Multiparty Private Matching,” in SAM, 2006

    work page 2006

  65. [65]

    Privacy Preserving Probabilistic Record Linkage Without Trusted Third Party,

    I. Lazrig, T. C. Ong, I. Ray, I. Ray, X. Jiang, and J. Vaidya, “Privacy Preserving Probabilistic Record Linkage Without Trusted Third Party,” in PST, 2018

    work page 2018

  66. [66]

    Supporting Efficient Record Linkage for Large Data Sets Using Mapping Techniques,

    C. Li, L. Jin, and S. Mehrotra, “Supporting Efficient Record Linkage for Large Data Sets Using Mapping Techniques,” World Wide Web, 2006

    work page 2006

  67. [67]

    Detecting near-duplicates for web crawling,

    G. S. Manku, A. Jain, and A. D. Sarma, “Detecting near-duplicates for web crawling,” in WWW, 2007

    work page 2007

  68. [68]

    Oblivious Transfer and Polynomial Eval- uation,

    M. Naor and B. Pinkas, “Oblivious Transfer and Polynomial Eval- uation,” in STOC, 1999

    work page 1999

  69. [69]

    Efficient oblivious transfer protocols,

    ——, “Efficient oblivious transfer protocols,” in ACM SODA, 2001, http://dl.acm.org/citation.cfm?id=365411.365502

    work page arXiv 2001

  70. [70]

    Crypt- analysis of Basic Bloom Filters Used for Privacy Preserving Record Linkage,

    F. Niedermeyer, S. Steinmetzer, M. Kroll, and R. Schnell, “Crypt- analysis of Basic Bloom Filters Used for Privacy Preserving Record Linkage,” J. Priv. Confidentiality, 2014

    work page 2014

  71. [71]

    V oter Registration Data,

    North Carolina State Board of Elections, “V oter Registration Data,” Accessed 2025-09-24, 2025, https://www.ncsbe.gov/results- data/voter-registration-data

    work page 2025

  72. [72]

    Scalable Private Set Intersection Based on OT Extension,

    B. Pinkas, T. Schneider, and M. Zohner, “Scalable Private Set Intersection Based on OT Extension,”ACM Trans. Priv. Secur., 2018

    work page 2018

  73. [73]

    Biometrics in the humanitarian sector,

    Z. Rahman, P. Verhaert, and C. Nyst, “Biometrics in the humanitarian sector,” Accessed 2025-09-24, 2018, https://policy-practice.oxfam.org/resources/biometrics-in-the- humanitarian-sector-620454/

    work page 2025

  74. [74]

    Tree Based Scalable Indexing for Multi-Party Privacy-Preserving Record Linkage,

    T. Ranbaduge, P. Christen, and D. Vatsalan, “Tree Based Scalable Indexing for Multi-Party Privacy-Preserving Record Linkage,” in AusDM, 2014

    work page 2014

  75. [75]

    Artifact: xDup: Privacy- Preserving Deduplication for Humanitarian Organizations using Fuzzy PSI,

    T. Rausch, S. Chatel, and W. Lueks, “Artifact: xDup: Privacy- Preserving Deduplication for Humanitarian Organizations using Fuzzy PSI,” Apr. 2026, https://doi.org/10.5281/zenodo.19480020

    work page doi:10.5281/zenodo.19480020 2026

  76. [76]

    How a fingerprint can change an asylum seeker’s life,

    E. Reidy, “How a fingerprint can change an asylum seeker’s life,” Accessed 2025-09-24, 2017, https://webarchive.archive.unhcr.org/ 20230518182616/https://www.refworld.org/docid/5a1694724.html

    work page 2025

  77. [77]

    Fuzzy PSI via Oblivious Protocol Routing,

    D. Richardson, M. Rosulek, and J. Xu, “Fuzzy PSI via Oblivious Protocol Routing,” IACR Cryptol. ePrint Arch. , 2024

    work page 2024

  78. [78]

    libOTe: an efficient, portable, and easy to use Oblivious Transfer Library,

    P. Rindal and L. Roy, “libOTe: an efficient, portable, and easy to use Oblivious Transfer Library,” https://github.com/osu-crypto/libOTe

    work page

  79. [79]

    SoftSpokenOT: Communication-Computation Tradeoffs in OT Extension,

    L. Roy, “SoftSpokenOT: Communication-Computation Tradeoffs in OT Extension,” IACR Cryptol. ePrint Arch. , 2022

    work page 2022

  80. [80]

    Privacy preserving schema and data matching,

    M. Scannapieco, I. Figotin, E. Bertino, and A. K. Elmagarmid, “Privacy preserving schema and data matching,” in ACM SIGMOD, 2007

    work page 2007

Showing first 80 references.