We introduce Private Collection Matching (PCM) problems, in which a client aims to determine whether a collection of sets owned by a server matches their interests. Existing privacy-preserving cryptographic primitives cannot solve PCM problems efficiently without harming privacy. We propose a modular framework that enables designers to build privacy-preserving PCM systems that output one bit: whether a collection of server sets matches the client's set. The communication cost of our protocols scales linearly with the size of the client's set and is independent of the number of server elements. We demonstrate the potential of our framework by designing and implementing novel solutions for two real-world PCM problems: determining whether a dataset has chemical compounds of interest, and determining whether a document collection has relevant documents. Our evaluation shows that we offer a privacy gain with respect to existing works at a reasonable communication and computation cost.
翻译:我们引入私人收藏匹配(PCM)问题, 客户在其中要确定服务器拥有的数据集集是否与其利益相符; 现有的隐私保存加密原始材料无法在不损害隐私的情况下有效解决PCM问题; 我们提议一个模块框架,使设计者能够建立只产生一个部分的隐私保存PCM系统: 服务器集集是否与客户集相吻合; 我们协议的通信成本线性比值与客户集的大小一致,并且独立于服务器元素的数量。 我们通过设计和实施两个真实世界的PCM问题的新解决方案,展示了我们框架的潜力: 确定数据集是否含有相关化学化合物, 以及确定文件收集是否有相关文件。 我们的评估显示,我们以合理的通信和计算成本为现有工程提供隐私收益。