Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/59463
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sang, Y. | - |
dc.contributor.author | Shen, H. | - |
dc.date.issued | 2008 | - |
dc.identifier.citation | Proceedings of the Inaugural Symposium on Parallel Algorithms, Architectures and Programming: 16-18 September, 2008 (PAAP'08), Hefei, China., 2008. | - |
dc.identifier.isbn | 9787312022524 | - |
dc.identifier.uri | http://hdl.handle.net/2440/59463 | - |
dc.description.abstract | In this paper we discuss the research challenges in secure distributed data sharing, including the conflict between the requirements of security and accuracy, and the difficulty to achieve efficiency. We then give a detailed survey on related work of the specific problems in secure distributed data sharing, including privacy-preserving set operations, secure two-party vector dominance and privacy-preserving data mining. We summarize the advantages and disadvantages of the techniques used in the previous work, compare the costs of the solutions, and propose some potential improvement directions. | - |
dc.description.statementofresponsibility | Yingpeng Sang and Hong Shen | - |
dc.language.iso | en | - |
dc.publisher | University of Science and Technology of China Press | - |
dc.source.uri | http://www.cs.adelaide.edu.au/~yingpeng/publications.html | - |
dc.subject | distributed database, data mining, e-bidding, privacy preservation. | - |
dc.title | On secure distributed data sharing | - |
dc.type | Conference paper | - |
dc.contributor.conference | Inaugural Symposium on Parallel Algorithms, Architectures and Programming (2008 : Hefei, China) | - |
dc.publisher.place | China | - |
pubs.publication-status | Published | - |
dc.identifier.orcid | Shen, H. [0000-0002-3663-6591] [0000-0003-0649-0648] | - |
Appears in Collections: | Aurora harvest 5 Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.