How to meet big data when private set intersection realizes constant communication complexity

DOI10.1007/978-3-319-50011-9_34zbMath1398.68132OpenAlexW2554425886MaRDI QIDQ1989531

Ratna Dutta, Sumit Kumar Debnath

Publication date: 26 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-50011-9_34

zbMATH Keywords

Bloom filterPSIiOSSB hash

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Data structures (68P05) Network protocols (68M12)

Related Items (1)

Secure and efficient multiparty private set intersection cardinality

This page was built for publication: How to meet big data when private set intersection realizes constant communication complexity