Database Paper Browser

Back to papers

Cryptographically Secure Private Record Linkage Using Locality-Sensitive Hashing

Summary: Cryptographically secure two‑party PRL that preserves the cryptographic no‑leakage guarantee while exploiting locality‑sensitive hashing for scalable blocking via oblivious algorithms. Prototype matches 40k records with 99.3%/99.9% accuracy in <1h, >10× faster than prior cryptographic LPH approaches. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13754
Venue
VLDB
Year
2024
Pagerank
4.4937074e-05
Overall Rank
8,528 | 40.68%
DOI
10.14778/3626292.3626293

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,672 Sectric: Towards Accurate, Privacy-preserving and Efficient Triangle Counting 2025 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
319 Evaluation of entity resolution approaches on real-world match problems 2010 VLDB 0.00027781866
2,670 Efficient Oblivious Database Joins 2020 VLDB 8.3379158e-05
Previous Page 1 / 1 Next

Semantically Similar Papers