An efficient toolkit for computing private set operations

DOI10.1007/978-3-319-59870-3_15zbMath1426.94093OpenAlexW2617299507MaRDI QIDQ2014617

Carlos Cid, Alex Davidson

Publication date: 25 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-59870-3_15

zbMATH Keywords

data miningsecure computationBloom filtersadditively homomorphic encryptionprivate set operations

Mathematics Subject Classification ID

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

Related Items (4)

Hiding the input-size in multi-party private set intersection ⋮ Mixed-technique multi-party computations composed of two-party computations ⋮ Efficient private set intersection cardinality protocol in the reverse unbalanced setting ⋮ Secure and efficient multiparty private set intersection cardinality

This page was built for publication: An efficient toolkit for computing private set operations