By Topic

Weak data secrecy via obfuscation in network coding based content distribution

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Cascella, R.G. ; Dipt. di Ing. e Scienza dell''Inf., Univ. di Trento, Trento, Italy ; Zhen Cao ; Gerla, M. ; Crispo, B.
more authors

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 terms of downloading speed is greatly enhanced.

Published in:

Wireless Days, 2008. WD '08. 1st IFIP

Date of Conference:

24-27 Nov. 2008