### Private Matching for Compute

Prasad Buddhavarapu, Andrew Knox, Payman Mohassel, Shubho Sengupta, Erik Taubeneck, and Vlad Vlaskin

##### Abstract

We revisit the problem of two-party private set intersection for aggregate computation which we refer to as private matching for compute. In this problem, two parties want to perform various downstream computation on the intersection of their two datasets according to a previously agreed-upon identifier. We observe that prior solutions to this problem have important limitations. For example, any change or update to the records in either party's dataset triggers a rerun of the private matching component; and it is not clear how to support a streaming arrival of one party's set in small batches without revealing the match rate for each individual batch. We introduce two new formulations of the private matching for compute problem meeting these requirements, called private-ID and streaming private secret shared set intersection, and design new DDH-based constructions for both. Our implementation shows that when taking advantage of the inherent parallelizability of these solutions, we can execute the matching for datasets of size upto 100 million records within an hour.

##### Metadata
Available format(s)
Category
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Keywords
private set operationssecure two-party computationprivate matching
Contact author(s)
paymanm @ fb com
History
2020-05-22: received
Short URL
https://ia.cr/2020/599
License

CC BY

BibTeX

@misc{cryptoeprint:2020/599,
author = {Prasad Buddhavarapu and Andrew Knox and Payman Mohassel and Shubho Sengupta and Erik Taubeneck and Vlad Vlaskin},
title = {Private Matching for Compute},
howpublished = {Cryptology ePrint Archive, Paper 2020/599},
year = {2020},
note = {\url{https://eprint.iacr.org/2020/599}},
url = {https://eprint.iacr.org/2020/599}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.