Two-party Private Set Intersection with an Untrusted Third Party
Authors:
Open Access
- 6 November 2019
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 2403-2420
Abstract
No abstract availableKeywords
Funding Information
- Defense Advanced Research Projects Agency (DARPA) and Space and Naval Warfare Systems Center Pacific (SSC Pacific) (N66001-15-C-4070)
This publication has 28 references indexed in Scilit:
- Generalizing Efficient Multiparty Computation2015
- Scaling Private Set Intersection to Billion-Element Sets2014
- Efficient Three-Party Computation from Cut-and-ChooseLecture Notes in Computer Science, 2014
- When private set intersection meets big data2013
- Secure two-party computation in sublinear (amortized) time2012
- Fast and Private Computation of Cardinality of Set Intersection and Union2012
- Generalized oblivious transfer by secret sharingDesigns, Codes and Cryptography, 2010
- Privacy-Preserving Set Operations2005
- Efficient Private Matching and Set Intersection2004
- Fast modular transformsJournal of Computer and System Sciences, 1974