Threshold private set intersection with better communication complexity

DOI10.1007/978-3-031-31371-4_9OpenAlexW4367593104MaRDI QIDQ6067362

Satrajit Ghosh, Mark Simkin

Publication date: 16 November 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-31371-4_9

Mathematics Subject Classification ID

Cryptography (94A60) Communication theory (94A05) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• Multiparty cardinality testing for threshold private intersection
• Multi-party threshold private set intersection with sublinear communication
• PSI from PaXoS: fast, malicious private set intersection
• SpOT-light: lightweight private set intersection from sparse OT extension
• The communication complexity of threshold private set intersection
• \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing
• How to Simulate It – A Tutorial on the Simulation Proof Technique
• Advances in Cryptology - EUROCRYPT 2004
• Privacy-Preserving Set Operations

This page was built for publication: Threshold private set intersection with better communication complexity