Information Sharing Across Private Databases: Secure Union Revisited

There is a growing demand for sharing information across multiple autonomous and private databases. The problem is usually formulated as a secure multi-party computation problem in which a set of parties wish to jointly compute a function of their private inputs such that the parties learn only the result of the function but nothing else. In this paper the authors perform an analysis and an experimental evaluation of existing and potential solutions for secure multi-party computation of union.

Provided by: Emory University Topic: Big Data Date Added: Aug 2011 Format: PDF

Find By Topic