Efficient robust private set intersection (Q1758883)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient robust private set intersection |
scientific article; zbMATH DE number 6108307
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient robust private set intersection |
scientific article; zbMATH DE number 6108307 |
Statements
Efficient robust private set intersection (English)
0 references
16 November 2012
0 references
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.
0 references
set intersection
0 references
secure two-party computation
0 references
cryptographic protocols
0 references
privacy-preserving data mining
0 references
