How to meet big data when private set intersection realizes constant communication complexity
type: Item
instance of: scholarly article
title: How to meet big data when private set intersection realizes constant communication complexity
zbMATH Open document ID: 1398.68132
DOI: 10.1007/978-3-319-50011-9_34
author: Sumit Kumar Debnath
author: Ratna Dutta
publication date: 2018-10-26T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6966775
zbMATH Keywords: PSI
zbMATH Keywords: SSB hash
zbMATH Keywords: iO
zbMATH Keywords: Bloom filter
MaRDI profile type: Publication
full work available at URL: 978-3-319-50011-9 34
OpenAlex ID: W2554425886
Recommended article: The communication complexity of threshold private set intersection
Recommended article: Threshold private set intersection with better communication complexity
Recommended article: Private set intersection: new generic constructions and feasibility results
Recommended article: Efficient private set intersection cardinality protocol in the reverse unbalanced setting
Recommended article: Scalable Multi-party Private Set-Intersection
Recommended article: Efficient Private Set Intersection Cardinality in the Presence of Malicious Adversaries
description: scientific article; zbMATH DE number 6966775