41 Matching Annotations
  1. Mar 2021
  2. Sep 2020
  3. Aug 2020
  4. Jul 2020
  5. Jun 2020
  6. May 2020
  7. Apr 2020
    1. Our approach strikes a balance between privacy, computation overhead, and network latency. While single-party private information retrieval (PIR) and 1-out-of-N oblivious transfer solve some of our requirements, the communication overhead involved for a database of over 4 billion records is presently intractable. Alternatively, k-party PIR and hardware enclaves present efficient alternatives, but they require user trust in schemes that are not widely deployed yet in practice. For k-party PIR, there is a risk of collusion; for enclaves, there is a risk of hardware vulnerabilities and side-channels.
  8. Feb 2020
  9. Sep 2017
  10. Apr 2016
  11. Dec 2015