期刊文献+

An efficient MAC scheme for secure network coding with probabilistic detection

An efficient MAC scheme for secure network coding with probabilistic detection
原文传递
导出
摘要 Network coding is vulnerable to pollution at- tacks, which prevent receivers from recovering the source message correctly. Most existing schemes against pollution attacks either bring significant redundancy to the original message or require a high computational complexity to ver- ify received blocks. In this paper, we propose an efficient scheme against pollution attacks based on probabilistic key pre-distribution and homomorphic message authentication codes (MACs). In our scheme, each block is attached with a small number of MACs and each node can use these MACs to verify the integrity of the corresponding block with a high probability. Compared to previous schemes, our scheme still leverages a small number of keys to generate MACs for each block, but more than doubles the detection probability. Mean- while, our scheme is able to efficiently restrict pollution prop- agation within a small number of hops. Experimental results show that our scheme is more efficient in verification than existing ones based on public-key cryptography. Network coding is vulnerable to pollution at- tacks, which prevent receivers from recovering the source message correctly. Most existing schemes against pollution attacks either bring significant redundancy to the original message or require a high computational complexity to ver- ify received blocks. In this paper, we propose an efficient scheme against pollution attacks based on probabilistic key pre-distribution and homomorphic message authentication codes (MACs). In our scheme, each block is attached with a small number of MACs and each node can use these MACs to verify the integrity of the corresponding block with a high probability. Compared to previous schemes, our scheme still leverages a small number of keys to generate MACs for each block, but more than doubles the detection probability. Mean- while, our scheme is able to efficiently restrict pollution prop- agation within a small number of hops. Experimental results show that our scheme is more efficient in verification than existing ones based on public-key cryptography.
出处 《Frontiers of Computer Science》 SCIE EI CSCD 2012年第4期429-441,共13页 中国计算机科学前沿(英文版)
关键词 secure network coding pollution attacks homo- morphic message authentication codes (MACs) probabilistic detection secure network coding, pollution attacks, homo- morphic message authentication codes (MACs), probabilistic detection
  • 相关文献

参考文献23

  • 1Ahlswede R,Cai N,Li S R,Yeung R W. Network information flow[J].IEEE Transactions on Information theory,2000,(04):1204-1216.doi:10.1109/18.850663.
  • 2Koetter R,Médard M. An algebraic approach to network coding[J].IEEE/ACM Transactions on Networking,2003,(05):782-795.doi:10.1109/TNET.2003.818197.
  • 3Li S.R,Yeung R W,Cai N. Linear network coding[J].IEEE Transactions on Information theory,2003,(02):371-381.doi:10.1109/TIT.2002.807285.
  • 4Ho T,Koetter R,Médard M,Karger D,Effros M. The benefits of coding over routing in a randomized setting[A].2003.
  • 5Ho T,Leong B,Koetter R,Médard M,Effros M,Karger D. Byzantine modification detection in multicast networks using randomized network coding[A].2004.
  • 6Jaggi S,Langberg M,Katti S,Ho T,Katabi D,Médard M. Resilient network coding in the presence of byzantine adversaries[A].2007.616-624.
  • 7Kehdi E,Li B. Null keys:limiting malicious at tacks via null space properties of network coding[A].2009.1224-1232.
  • 8Yeung.R W,Cai N. Network error correction,part Ⅰ:basic concepts and upper bounds[J].IEEE Communications in Information and Systems,2006,(01):19-36.
  • 9Cai N,Yeung R W. Network error correction,part Ⅱ:lower bounds[J].IEEE Communications in Information and Systems,2006,(01):37-54.
  • 10Silva D,Kschischang F,Koetter R. A rank-metric approach to error control in random network coding[A].2007.1-5.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部