By Topic

Double Blind Comparisons Matching database records without database aggregation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
William R. Lorimer ; Department of Computer Science, University of Calgary, Canada ; Michael J. Jacobson

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.

Published in:

Homeland Security (HST), 2012 IEEE Conference on Technologies for

Date of Conference:

13-15 Nov. 2012