Fast private set intersection from homomorphic encryption

H Chen, K Laine, P Rindal - Proceedings of the 2017 ACM SIGSAC …, 2017 - dl.acm.org
Private Set Intersection (PSI) is a cryptographic technique that allows two parties to compute
the intersection of their sets without revealing anything except the intersection. We use fully …

Efficient circuit-based PSI with linear communication

B Pinkas, T Schneider, O Tkachenko… - Advances in Cryptology …, 2019 - Springer
We present a new protocol for computing a circuit which implements the private set
intersection functionality (PSI). Using circuits for this task is advantageous over the usage of …

{Near-Optimal} Oblivious {Key-Value} Stores for Efficient {PSI},{PSU} and {Volume-Hiding}{Multi-Maps}

A Bienstock, S Patel, JY Seo, K Yeo - 32nd USENIX Security Symposium …, 2023 - usenix.org
In this paper, we study oblivious key-value stores (OKVS) that enable encoding n key-value
pairs into length m encodings while hiding the input keys. The goal is to obtain high rate …

Scalable multi-party private set-intersection

C Hazay, M Venkitasubramaniam - IACR international workshop on public …, 2017 - Springer
In this work we study the problem of private set-intersection in the multi-party setting and
design two protocols with the following improvements compared to prior work. First, our …

An algebraic approach to maliciously secure private set intersection

S Ghosh, T Nilges - Annual international conference on the theory and …, 2019 - Springer
Private set intersection (PSI) is an important area of research and has been the focus of
many works over the past decades. It describes the problem of finding an intersection …

Privately computing set-union and set-intersection cardinality via bloom filters

R Egert, M Fischlin, D Gens, S Jacob, M Senker… - Information Security and …, 2015 - Springer
In this paper we propose a new approach to privately compute the set-union cardinality and
the set-intersection cardinality among multiple honest-but-curious parties. Our approach is …

Scalable private set union from symmetric-key techniques

V Kolesnikov, M Rosulek, N Trieu, X Wang - International Conference on …, 2019 - Springer
We present a new efficient protocol for computing private set union (PSU). Here two semi-
honest parties, each holding a dataset of known size (or of a known upper bound), wish to …

An efficient toolkit for computing private set operations

A Davidson, C Cid - Information Security and Privacy: 22nd Australasian …, 2017 - Springer
Private set operation (PSO) protocols provide a natural way of securely performing
operations on data sets, such that crucial details of the input sets are not revealed. Such …

Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs

C Hazay - Journal of Cryptology, 2018 - Springer
In this paper, we study the two fundamental functionalities oblivious polynomial evaluation in
the exponent and set-intersection and introduce a new technique for designing efficient …

Detecting stuffing of a {User's} credentials at her own accounts

KC Wang, MK Reiter - 29th USENIX Security Symposium (USENIX …, 2020 - usenix.org
We propose a framework by which websites can coordinate to detect credential stuffing on
individual user accounts. Our detection algorithm teases apart normal login behavior …