Fast Private Set Operations with SEPIA

By Martin Burkhart, Xenofontas Dimitropoulos fontas. 2012

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Katsunari Shishido
2. Atsuko Miyaji
3. Dan Boneh
4. Paulo L. Barreto
5. Huaqun Wang

Citations in the corpus

• Secure Federated Submodel Learning (2019, neutral): “In the cryptography field, according to the representation format of a set, the protocols can be generally divided into two categories: polynomial based [87]–[91] and Bloom filter based [92]–[94].”
• Strathprints Institutional Repository (unknown): “In [32], the parties AND their Bloom filters by a secure multiplication protocol and each party obtains an intersection Bloom filter.”
• Efficient and Quasi-accurate Multiparty Private Set Union (2018, methodology): “In [7] and [4], Bloom filter (BF) and Counting Bloom filter (CBF) are used to represent”