• Corpus ID: 227015168

Asymmetric Private Set Intersection with Applications to Contact Tracing and Private Vertical Federated Machine Learning

  title={Asymmetric Private Set Intersection with Applications to Contact Tracing and Private Vertical Federated Machine Learning},
  author={Nick Angelou and Ayoub Benaissa and Bogdan Cebere and William Clark and Adam James Hall and Michael A. Hoeh and Daniel Liu and Pavlos Papadopoulos and Robin Roehm and Robert Sandmann and Phillipp Schoppmann and Tom Titcombe},
We present a multi-language, cross-platform, open-source library for asymmetric private set intersection (PSI) and PSI-Cardinality (PSI-C). Our protocol combines traditional DDH-based PSI and PSI-C protocols with compression based on Bloom filters that helps reduce communication in the asymmetric setting. Currently, our library supports C++, C, Go, WebAssembly, JavaScript, Python, and Rust, and runs on both traditional hardware (x86) and browser targets. We further apply our library to two use… 

Figures and Tables from this paper

ROTed: Random Oblivious Transfer for embedded devices
A 3-round Random Oblivious Transfer protocol is proposed, which achieves high computational efficiency, in the Random Oracle Model, and is suitable for a wide range of applications in embedded systems, IoT, desktop, and servers.
Syft 0.5: A Platform for Universally Deployable Structured Transparency
Syft is presented, a general-purpose framework that combines a core group of privacy-enhancing technologies that facilitate a universal set of structured transparency systems and evaluates the proposed flow with respect to its provision of the core structural transparency principles.
Comprehensive Analysis of Privacy Leakage in Vertical Federated Learning During Prediction
A comprehensive analysis of privacy leakage in VFL frameworks during the prediction phase is conducted and a general gradient-based reconstruction attack framework is designed that can be flexibly applied to simple logistic regression models as well as multi-layer neural networks.
Privacy and Trust Redefined in Federated Machine Learning
This paper presents a privacy-preserving decentralised workflow that facilitates trusted federated learning among participants and defines a trust framework instantiated using decentralised identity technologies being developed under Hyperledger projects Aries/Indy/Ursa.
PyVertical: A Vertical Federated Learning Framework for Multi-headed SplitNN
PyVertical, a framework supporting vertical federated learning using split neural networks, is introduced and the training of a simple dual-headed split neural network for a MNIST classification task is presented.
Multi-VFL: A Vertical Federated Learning System for Multiple Data and Label Owners
This paper proposes a novel method, Multi Vertical Federated Learning (Multi-VFL), to train VFL models when there are multiple data and label owners, and is the first to consider the setting where D-data owners and K-label owners exist.
Practical Defences Against Model Inversion Attacks for Split Neural Networks
A simple additive noise method to defend against model inversion is proposed, finding that the method can significantly reduce attack efficacy at an acceptable accuracy trade-off on MNIST.


Private Set Intersection in the Internet Setting From Lightweight Oblivious PRF
We present a new protocol for two-party private set intersection (PSI) with semi-honest security in the plain model and one-sided malicious security in the random oracle model. Our protocol achieves
Private Set Intersection for Unequal Set Sizes with Mobile Applications
This paper transforms four existing PSI protocols into the precomputation form such that in the setup phase the communication is linear only in the size of the larger input set, while in the online phase the Communication is linear in the sizes of the smaller input set.
Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?
This paper develops three classes of protocols targeted to different set sizes and domains, all based on Yao's generic garbled-circuit method, and compares the performance of these protocols to the fastest custom PSI protocols in the literature.
Scalable Private Set Intersection Based on OT Extension
This article focuses on PSI protocols that are secure against semi-honest adversaries and take advantage of the most recent efficiency improvements in Oblivious Transfer (OT) extension, proposes significant optimizations to previous PSi protocols, and suggests a new PSI protocol whose runtime is superior to that of existing protocols.
Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption
This work describes a three-party end-to-end solution in two phases ---privacy-preserving entity resolution and federated logistic regression over messages encrypted with an additively homomorphic scheme---, secure against a honest-but-curious adversary.
Practical Private Set Intersection Protocols with Linear Complexity
This paper explores some PSI variations and constructs several secure protocols that are appreciably more efficient than the state-of-the-art.
Fast and Private Computation of Cardinality of Set Intersection and Union
This paper explores a few PSI-CA variations and constructs several protocols that are more efficient than the state-of-the-art.
PIR-PSI: Scaling Private Contact Discovery
This work presents a system for private contact discovery, in which the client learnsonly the intersection of its own contact list and a server’s user database, and the server learns only the (approximate) size of the client's list.
On Deploying Secure Computing: Private Intersection-Sum-with-Cardinality
  • M. Ion, Ben Kreuter, M. Yung
  • Computer Science, Mathematics
    2020 IEEE European Symposium on Security and Privacy (EuroS&P)
  • 2020
Three PI-Sum with cardinality protocols are presented: the currently deployed protocol, which relies on a Diffie-Hellman style double masking, and two new protocols which leverage more recent techniques for private set intersection (PSI) that use Random Oblivious Transfer and encrypted Bloom filters.
Efficient Private Matching and Set Intersection
This work considers the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain, and presents protocols, based on the use of homomorphic encryption and balanced hashing, for both semi-honest and malicious environments.