Untrusting network coding

In networks that perform linear network coding, an intermediate network node may receive a much larger number of linear equations of the source symbols than the number of messages it needs to send. For networks constructed by untrusted nodes, we propose a relaxed measure of security: we want to be untrusting, and allow each intermediate node to only learn as much information as the number of independent messages it needs to send. In this paper we formulate this problem and provide sufficient and necessary conditions for classes of combination networks. ©2012 IEEE.


Published in:
2012 International Symposium on Network Coding, NetCod 2012, null, null, 79-84
Presented at:
2012 International Symposium on Network Coding, NetCod 2012, Cambridge, Massachusetts, USA, June 29-30, 2012
Year:
2012
ISBN:
978-1-4673-1890-7
Laboratories:




 Record created 2013-03-20, last modified 2018-04-28

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)