Efficient scalable multiparty private set-intersection via garbled Bloom filters
type: Item
instance of: scholarly article
title: Efficient scalable multiparty private set-intersection via garbled Bloom filters
DOI: 10.1007/978-3-319-98113-0_13
author: Roi Inbar
author: Eran Omri
author: Benny Pinkas
publication date: 2018-10-17T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6957556
zbMATH Keywords: multiparty computation
zbMATH Keywords: private set intersection
zbMATH Keywords: concrete efficiency
zbMATH Keywords: garbled Bloom filters
MaRDI profile type: Publication
full work available at URL: 978-3-319-98113-0 13
OpenAlex ID: W2887239198
description: scientific article; zbMATH DE number 6957556