Privacy-Preserving Inter-Database Operations
| dc.contributor.author | Liang, Gang | en_US |
| dc.contributor.author | Chawathe, Sudarshan S. | en_US |
| dc.date.accessioned | 2004-05-31T23:35:53Z | |
| dc.date.available | 2004-05-31T23:35:53Z | |
| dc.date.created | 2004-02 | en_US |
| dc.date.issued | 2004-03-25 | en_US |
| dc.description.abstract | We present protocols for distributed computation of relational intersections and equi-joins such that each site gains no information about the tuples at the other site that do not intersect or join with its own tuples. Such protocols form the building blocks of distributed information systems that manage sensitive information, such as patient records and financial transactions, that must be shared in only a limited manner. We discuss applications of our protocols, outlining the ramifications of assumptions such as semi-honesty. In addition to improving on the efficiency of earlier protocols, our protocols are asymmetric, making them especially applicable to applications in which a low-powered client interacts with a server in a privacy-preserving manner. We present a brief experimental study of our protocols. (UMIACS-TR-2004-09) | en_US |
| dc.format.extent | 183166 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/1339 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-4564 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-2004-09 | en_US |
| dc.title | Privacy-Preserving Inter-Database Operations | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1