Function Secret Sharing for PSI-CA: With Applications to Private Contact Tracing

This research was developed with funding from the Defense Advanced Research Projects Agency (DARPA). This work was supported by DARPA and NIWC Pacific under contract N66001-15-C-4065 and by DARPA, AFRL/RIKD, USAF, and AFMC under FA8750-18-C-0054. The U.S. Government is authorized to reproduce and distribute reprints for Governmental purposes not withstanding any copyright notation thereon. The views, opinions and/or findings expressed are those of the author and should not be interpreted as representing the official views or policies of the Department of Defense or the U.S. Government. Work done while consulting for Stealth

[1]  Yuval Ishai,et al.  Function Secret Sharing , 2015, EUROCRYPT.

[2]  Johan van Leeuwaarden,et al.  Analytic Computation Schemes for the Discrete-Time Bulk Service Queue , 2005, Queueing Syst. Theory Appl..

[3]  Benny Pinkas,et al.  Efficient Private Matching and Set Intersection , 2004, EUROCRYPT.

[4]  Hao Chen,et al.  Labeled PSI from Fully Homomorphic Encryption with Malicious Security , 2018, IACR Cryptol. ePrint Arch..

[5]  Moni Naor,et al.  Private Information Retrieval by Keywords , 1998, IACR Cryptol. ePrint Arch..

[6]  Yuval Ishai,et al.  Function Secret Sharing: Improvements and Extensions , 2016, CCS.

[7]  Moti Yung,et al.  Private Intersection-Sum Protocol with Applications to Attributing Aggregate Ad Conversions , 2017, IACR Cryptol. ePrint Arch..

[8]  Catherine A. Meadows,et al.  A More Efficient Cryptographic Matchmaking Protocol for Use in the Absence of a Continuously Available Third Party , 1986, 1986 IEEE Symposium on Security and Privacy.

[9]  Herwig Bruneel,et al.  Analysis of discrete-time multiserver queueing models with constant service times , 1994, Oper. Res. Lett..

[10]  Ion Stoica,et al.  DORY: An Encrypted Search System with Distributed Trust , 2020, IACR Cryptol. ePrint Arch..

[11]  Benny Pinkas,et al.  SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension , 2019, IACR Cryptol. ePrint Arch..

[12]  B. Eisenberg.  On the expectation of the maximum of IID geometric random variables , 2008 .

[13]  Tobias Nilges,et al.  An Algebraic Approach to Maliciously Secure Private Set Intersection , 2019, IACR Cryptol. ePrint Arch..

[14]  Srinath T. V. Setty,et al.  PIR with Compressed Queries and Amortized Query Processing , 2018, 2018 IEEE Symposium on Security and Privacy (SP).

[15]  Eli Upfal,et al.  Balanced Allocations , 1999, SIAM J. Comput..

[16]  Rafail Ostrovsky,et al.  Private Searching on Streaming Data , 2005, Journal of Cryptology.

[17]  Duong Hieu Phan,et al.  Catalic: Delegated PSI Cardinality with Applications to Contact Tracing , 2020, IACR Cryptol. ePrint Arch..

[18]  Mariana Raykova,et al.  Distributed Vector-OLE: Improved Constructions and Implementation , 2019, IACR Cryptol. ePrint Arch..

[19]  Rafail Ostrovsky,et al.  Batch codes and their applications , 2004, STOC '04.

[20]  Vladimir Kolesnikov,et al.  Efficient Batched Oblivious PRF with Applications to Private Set Intersection , 2016, CCS.

[21]  J. Little.  A Proof for the Queuing Formula: L = λW , 1961 .

[22]  Dan Boneh,et al.  Riposte: An Anonymous Messaging System Handling Millions of Users , 2015, 2015 IEEE Symposium on Security and Privacy.

[23]  Dawn Song,et al.  Epione: Lightweight Contact Tracing with Strong Privacy , 2020, IEEE Data Eng. Bull..

[24]  Hao Chen,et al.  Fast Private Set Intersection from Homomorphic Encryption , 2017, CCS.

[25]  Yuval Ishai,et al.  Distributed Point Functions and Their Applications , 2014, EUROCRYPT.

[26]  Michael Mitzenmacher,et al.  Studying Balanced Allocations with Differential Equations , 1999, Combinatorics, Probability and Computing.