Double Blind Comparisons Matching database records without database aggregation

William R. Lorimer, Michael J. Jacobson · 2012

This paper presents a protocol to conduct automated matches of records relating to the same subject across multiple databases, administered by different agencies, without compromising the anonymity or secrecy of the subject. The protocol uses a new cryptographic primitive, Double Blind Comparisons (DBC), and introduces a binary search capability to make these comparisons more efficient.

Read the paper · More papers on PaperTik