We consider the problem of computing the intersection of private datasets of two parties,
where the datasets contain lists of elements taken from a large domain. This problem has …

We describe a simple and novel cryptographic construction that we refer to as a fuzzy vault.
A player Alice may place a secret value κ in a fuzzy vault and “lock” it using a set A of …

In many important applications, a collection of mutually distrustful parties must perform
private computation over multisets. Each party's input to the function is his private input …

Motivated by recent revelations of widespread state surveillance of personal communication,
many solutions now claim to offer secure and private messaging. This includes both a large …

We study privacy-preserving tests for proximity: Alice can test if she is close to Bob without
either party revealing any other information about their location. We describe several secure …

The central theme of this paper is that we propose an efficient protocol for comparing the
equal information with the help of a third party (TP). We assume that TP is semi-honest, ie …

We examine the feasibility of private set intersection (PSI) over massive datasets. PSI, which
allows two parties to find the intersection of their sets without revealing them to each other …

Based on EPR pairs, this paper proposes a different quantum private comparison (QPC)
protocol enabling two parties to compare the equality of their information without revealing …

Computing set intersection privately and efficiently between two mutually mistrusting parties
is an important basic procedure in the area of private data mining. Assuring robustness …

Abstract k-anonymity provides a measure of privacy protection by preventing re-identification
of data to fewer than a group of k data items. While algorithms exist for producing k …