Efficient robust private set intersection
type: Item
instance of: scholarly article
title: Efficient robust private set intersection
zbMATH Open document ID: 1271.94017
DOI: 10.1504/IJACT.2012.048080
author: Dana Dachman-Soled
author: Tal Malkin
author: Mariana Raykova
author: Moti Yung
published in: International Journal of Applied Cryptography
publication date: 2012-11-16T00:00:00Z
review text: Summary: Computing set intersection privately and efficiently between two mutually mistrusting parties is an important basic procedure in the area of private data mining. Assuring robustness, namely, coping with potentially arbitrarily misbehaving (i.e., malicious) parties, while retaining protocol efficiency (rather than employing costly generic techniques) is an open problem. In this work, the first solution to this problem is presented.
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 6108307
zbMATH Keywords: set intersection
zbMATH Keywords: secure two-party computation
zbMATH Keywords: cryptographic protocols
zbMATH Keywords: privacy-preserving data mining
MaRDI profile type: Publication
full work available at URL: ijact.2012.048080
OpenAlex ID: W2138684280
description: scientific article; zbMATH DE number 6108307