The communication complexity of threshold private set intersection

DOI10.1007/978-3-030-26951-7_1zbMath1478.68092OpenAlexW2967222818MaRDI QIDQ2304976

Satrajit Ghosh, Mark Simkin

Publication date: 9 March 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-26951-7_1

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Communication complexity, information complexity (68Q11)

Related Items (12)

Oblivious key-value stores and amplification for private set intersection ⋮ SE-PSI: fog/cloud server-aided enhanced secure and effective private set intersection on scalable datasets with Bloom Filter ⋮ Polynomial representation is tricky: maliciously secure private set intersection revisited ⋮ Two-Round Oblivious Linear Evaluation from Learning with Errors ⋮ Multi-party updatable delegated private set intersection ⋮ Hiding the input-size in multi-party private set intersection ⋮ Improved private set intersection for sets with small entries ⋮ Threshold private set intersection with better communication complexity ⋮ Structure-aware private set intersection, with applications to fuzzy matching ⋮ Robust property-preserving hash functions for Hamming distance and more ⋮ Multiparty cardinality testing for threshold private intersection ⋮ Multi-party threshold private set intersection with sublinear communication

This page was built for publication: The communication complexity of threshold private set intersection