Efficient scalable multiparty private set-intersection via garbled Bloom filters

DOI10.1007/978-3-319-98113-0_13OpenAlexW2887239198MaRDI QIDQ1796793

Eran Omri, Benny Pinkas, Roi Inbar

Publication date: 17 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-98113-0_13

zbMATH Keywords

private set intersectionconcrete efficiencymultiparty computationgarbled Bloom filters

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (5)

Oblivious key-value stores and amplification for private set intersection ⋮ Polynomial representation is tricky: maliciously secure private set intersection revisited ⋮ Privacy-preserving mixed set operations ⋮ Multi-party updatable delegated private set intersection ⋮ Feasible private set intersection in quantum domain

This page was built for publication: Efficient scalable multiparty private set-intersection via garbled Bloom filters