Oblivious Key-Value Stores and Amplification for Private Set Intersection
- 11 August 2021
- book chapter
- Published by Springer Nature
- p. 395-425
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- Practical perfect hashing in nearly optimal spaceInformation Systems, 2013
- When private set intersection meets big data2013
- Privacy-Preserving Group Discovery with Linear Complexity2010
- More Robust Hashing: Cuckoo Hashing with a StashSIAM Journal on Computing, 2010
- Privacy-Preserving Set Operations2005
- Efficient Private Matching and Set Intersection2004
- Extending Oblivious Transfers Efficiently2003
- Oblivious transfer and polynomial evaluation1999
- “Balls into Bins” — A Simple and Tight Analysis1998
- THE USE OF CONFIDENCE OR FIDUCIAL LIMITS ILLUSTRATED IN THE CASE OF THE BINOMIALBiometrika, 1934