PULSE: Parallel Private Set Union for Large-Scale Entities
summary
PULSE presents a PKE-based mPSU that parallelizes all party work so no participants sit idle, uses membership-OT plus additive homomorphic (ElGamal) operations, and separates shuffling from decryption to push most steps to one communication round while leaving an unavoidable sequential shuffle phase. It is secure against up to n−1 semi-honest corruptions, is implemented, and reports 1.91–3.57× speedups for n=8 on typical 64/120-bit items.
AI-written summary · about
chapters (14)
- 0:00Introduction
- 1:04Private set union basics
- 3:52PSU research state of the art
- 6:01Two-party vs multi-party PSU gap
- 8:30Two-party PSU protocol
- 12:13Extending to multiple parties
- 14:49Multi-party PSU building blocks
- 17:02Round complexity and efficiency
- 19:13Membership oblivious transfer
- 21:03One-round message modification
- 23:39Parallel shuffling and decryption
- 25:04Performance results
- 26:08Open PSU problems
- 27:22Q&A
related talks
01h 31mIntroduction to Secure Multi-Party Computation
22mNext-Gen PeT: the Future of Multi-Party Computation Software
25mFaster Malicious 2-Party Secure Computation with Online/Offline Dual Execution
20mEnabling Low-Cost Secure Computing on Untrusted In-Memory Architectures
38mDemystifying Privacy Preserving Computing
15mAccelerating Encrypted Deduplication via SGX
33mInteraction Preserving Compilers for Secure Computation
37mPETs of the world unite! Conquer the middle ground in the performance vs...