Fast private set intersection from homomorphic encryption
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 …
the intersection of their sets without revealing anything except the intersection. We use fully …
Scalable private set intersection based on OT extension
Private set intersection (PSI) allows two parties to compute the intersection of their sets
without revealing any information about items that are not in the intersection. It is one of the …
without revealing any information about items that are not in the intersection. It is one of the …
PIR with compressed queries and amortized query processing
Private information retrieval (PIR) is a key building block in many privacy-preserving
systems. Unfortunately, existing constructions remain very expensive. This paper introduces …
systems. Unfortunately, existing constructions remain very expensive. This paper introduces …
Phasing: Private set intersection using permutation-based hashing
Private Set Intersection (PSI) allows two parties to compute the intersection of private sets
while revealing nothing more than the intersection itself. PSI needs to be applied to large …
while revealing nothing more than the intersection itself. PSI needs to be applied to large …
Online stochastic matching: Online actions based on offline statistics
We consider the online stochastic matching problem proposed by Feldman et al.[Feldman J,
Mehta A, Mirrokni VS, Muthukrishnan S (2009) Online stochastic matching: Beating 1− 1/e …
Mehta A, Mirrokni VS, Muthukrishnan S (2009) Online stochastic matching: Beating 1− 1/e …
Invertible bloom lookup tables
We present a version of the Bloom filter data structure that supports not only the insertion,
deletion, and lookup of key-value pairs, but also allows a complete listing of the pairs it …
deletion, and lookup of key-value pairs, but also allows a complete listing of the pairs it …
PIR-PSI: scaling private contact discovery
An important initialization step in many social-networking applications is contact discovery,
which allows a user of the service to identify which of its existing social contacts also use the …
which allows a user of the service to identify which of its existing social contacts also use the …
[LIVRE][B] Small summaries for big data
The massive volume of data generated in modern applications can overwhelm our ability to
conveniently transmit, store, and index it. For many scenarios, building a compact summary …
conveniently transmit, store, and index it. For many scenarios, building a compact summary …
Backyard cuckoo hashing: Constant worst-case operations with a succinct representation
The performance of a dynamic dictionary is measured mainly by its update time, lookup time,
and space consumption. In terms of update time and lookup time there are known …
and space consumption. In terms of update time and lookup time there are known …
Ribbon filter: practically smaller than Bloom and Xor
PC Dillinger, S Walzer - arxiv preprint arxiv:2103.02515, 2021 - arxiv.org
Filter data structures over-approximate a set of hashable keys, ie set membership queries
may incorrectly come out positive. A filter with false positive rate $ f\in (0, 1] $ is known to …
may incorrectly come out positive. A filter with false positive rate $ f\in (0, 1] $ is known to …