Name
Abstract | ||
|---|---|---|
Content distribution systems benefit from network coding in terms of error/loss protection and faster dissemination at the cost of exposing the data to intermediate nodes that are not the intended recipients. In these systems data secrecy is at risk and it can be guaranteed by using encryption as a straightforward method. However, this inevitably increases the communication costs and decreases the willingness to cooperate of intermediate nodes, which have no expectation of recovering the file.In this paper we propose an incentive secrecy preserving scheme based on obfuscation for time-sensitive data. The source intentionally obscures the original file and informs only the intended recipients which file blocks are corrupted. This scheme, combined with network coding, preserves the data secrecy and, in the meantime, fosters the cooperation of intermediate nodes. The evaluation of our solution shows that the proposed scheme is more efficient than encryption based secrecy preserving methods. In particular, the distribution of content in term of downloading speed is greatly enhanced. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/WD.2008.4812894 | 2008 1ST IFIP WIRELESS DAYS (WD) |
Keywords | DocType | Citations |
network coding,encryption,data mining,cryptography,encoding,pollution,probability density function,data privacy,security,obfuscation | Conference | 0 |
PageRank | References | Authors |
0.34 | 8 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roberto G. Cascella | 1 | 39 | 4.97 |
| Zhen Caoy | 2 | 0 | 0.34 |
| Mario Gerlay | 3 | 0 | 0.34 |
| Bruno Crispo | 4 | 1829 | 237.11 |
| Roberto Battiti | 5 | 1937 | 262.40 |