Efficient determination of equivalence for encrypted data. Issue 97 (October 2020)

• Record Type: Journal Article
• Authors: Doctor, Jason N.; Vaidya, Jaideep; Jiang, Xiaoqian; Wang, Shuang; Schilling, Lisa M.; Ong, Toan; Matheny, Michael E.; Ohno-Machado, Lucila; Meeker, Daniella
• Is Part Of: Computers & security. Issue 97(2020)
• Publication Date: 2020-10
• Subjects: Secure computation -- Encrypted data -- Set intersection -- Socialist millionaires' problem -- Record linkage; Computer security -- Periodicals; Electronic data processing departments -- Security measures -- Periodicals; 005.805
• DOI: 10.1016/j.cose.2020.101939
• Languages: English
• ISSNs: 0167-4048

Abstract

Highlights: This work provides an alternative approach to record linkage that may be preferred in many settings. The approach is less computationally intensive than previous ones. Precomputation significantly reduces the computational load during matching. The integrity of the security model is also fully preserved. Abstract: Secure computation of equivalence has fundamental application in many different areas, including healthcare. We study this problem in the context of matching an individual's identity to link medical records across systems under the socialist millionaires' problem: Two millionaires wish to determine if their fortunes are equal without disclosing their net worth (Boudot, et al. 2001). In Theorem 2, we show that when a "greater than" algorithm is carried out on a totally ordered set it is easy to achieve secure matching without additional rounds of communication. We present this efficient solution to assess equivalence using a set intersection algorithm designed for "greater than" computation and demonstrate its effectiveness on equivalence of arbitrary data values, as well as demonstrate how it meets regulatory criteria for risk of disclosure.