Show simple item record

dc.contributor.authorLiang, Gangen_US
dc.contributor.authorChawathe, Sudarshan S.en_US
dc.date.accessioned2004-05-31T23:35:53Z
dc.date.available2004-05-31T23:35:53Z
dc.date.created2004-02en_US
dc.date.issued2004-03-25en_US
dc.identifier.urihttp://hdl.handle.net/1903/1339
dc.description.abstractWe 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.extent183166 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-4564en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-2004-09en_US
dc.titlePrivacy-Preserving Inter-Database Operationsen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record