Efficient circuit-based PSI with linear communication
From MaRDI portal
Publication:2292690
DOI10.1007/978-3-030-17659-4_5OpenAlexW2922077514MaRDI QIDQ2292690
Oleksandr Tkachenko, Thomas Schneider, Benny Pinkas, Avishay Yanai
Publication date: 4 February 2020
Full work available at URL: https://encrypto.de/papers/PSTY19.pdf
Related Items (17)
Oblivious key-value stores and amplification for private set intersection ⋮ SE-PSI: fog/cloud server-aided enhanced secure and effective private set intersection on scalable datasets with Bloom Filter ⋮ MPCCache: privacy-preserving multi-party cooperative cache sharing at the edge ⋮ Hiding the input-size in multi-party private set intersection ⋮ Private polynomial commitments and applications to MPC ⋮ Mixed-technique multi-party computations composed of two-party computations ⋮ Finding one common item, privately ⋮ Private join and compute from PIR with default ⋮ Linear-time 2-party secure merge from additively homomorphic encryption ⋮ Malicious secure, structure-aware private set intersection ⋮ \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing ⋮ Amortizing rate-1 OT and applications to PIR and PSI ⋮ VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE ⋮ Private set operations from oblivious switching ⋮ PSI-stats: private set intersection protocols supporting secure statistical functions ⋮ Two-sided malicious security for private intersection-sum with cardinality ⋮ PSI from PaXoS: fast, malicious private set intersection
This page was built for publication: Efficient circuit-based PSI with linear communication
