Is PSI Really Faster Than PSU? Achieving Efficient PSU with Invertible Bloom Filters
- 7 May 2026
- book chapter
- Published by Springer Nature
- p. 438-467
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Private Set Operations from Multi-query Reverse Private Membership Test2024
- SoftSpokenOT: Quieter OT Extension from Small-Field Silent VOLE in the Minicrypt Model2022
- Partial Extraction from Invertible Bloom Filters2022
- Private Set Operations from Oblivious Switching2021
- Scalable Private Set Union from Symmetric-Key Techniques2019
- Secure Multiparty Computation for Cooperative Cyber Risk Assessment2016
- Invertible bloom lookup tables2011
- Privacy-Preserving Graph Algorithms in the Semi-honest Model2005
- Privacy-preserving distributed mining of association rules on horizontally partitioned dataIEEE Transactions on Knowledge and Data Engineering, 2004
- All-or-Nothing Disclosure of Secrets2000