CMU-CS-04-182Computer Science Department School of Computer Science, Carnegie Mellon University
CMU-CS-04-182
Lea Kissner, Dawn Song November 2004
CMU-CS-04-182.ps
Keywords: Set-intersection, secure multi-party computation,
privacy, cardinality, threshold
We propose protocols that are more e cient than those previously known for set-intersection in the malicious case, as well as new protocols for problems which had no previous solution that did not utilize general secure circuit computation: - Set-intersection protocols for the case of:
*n = 2*malicious parties that do not utilize the cut-and-choose technique;*n ≥ 3*; malicious parties, for which there was no previous efficient solution; and multisets, in which elements may appear more than once. - Cardinality set-intersection protocols secure against
*n ≥ 2*malicious parties and*n ≥ 3*honest-but-curious parties, for which there were no previous efficient solutions - Threshold set-intersection protocols for
*n ≥ 2*honest-but-curious parties, for which there was no previous efficient solution - Over-threshold set-intersection protocols for the case of
*n ≥ 2*honest-but-curious parties and the case of*n ≥ 2*malicious parties, for which there was no previous efficient solution - Fair protocols for all problems (when fairness in decryption is enforced)
- Protocols which are secure against even
*n − 1*dishonest colluding parties
43 pages
| |

Return to:
SCS Technical Report Collection This page maintained by reports@cs.cmu.edu |