期刊文献+

融合时间戳和同态签名的安全网络编码方法 被引量:14

Secure network coding method merged with timestamp and homomorphic signature
下载PDF
导出
摘要 针对无线多跳网络编码的安全性问题,提出了一种融合时间戳和同态签名的安全网络编码方法。在利用基于RSA的同态签名方案抵御污染攻击的基础上,引入时间戳设计新型同态签名方案来抵御网络中的重放攻击,以时间戳为源生成网络编码的随机系数来保证签名的同态性。重点分析了本方案产生随机系数的方式对网络编码解码概率的影响,并建立了攻击模型证明方案可同时抵御网络中的污染攻击和重放攻击。性能分析表明本方案与基于RSA的同态签名方案开销比值接近于1。 A secure network coding method merged with timestamp and homomorphic signature which can solve security issues in wireless multi-hop networks was proposed. The timestamp into RSA-based homomorphic signature scheme was brought and used to produce random coefficients of network coding, thus made it possible to defend pollution attacks and replay attacks simultaneously while maintaining the homomorphic property of the signature. The analysis that mainly fo- cus on was the influence of random coefficients on decoding probability of network coding and security of the proposed scheme. Results indicate that the proposed scheme can defend pollution attacks and replay attacks simultaneously, and the ratio of overhead between RSA-based homomorphic signature scheme and the proposed scheme is approximates 1.
出处 《通信学报》 EI CSCD 北大核心 2013年第4期28-35,共8页 Journal on Communications
基金 高等学校博士学科点专项科研基金资助项目(20091102110004) 国家重点基础研究发展计划("973"计划)基金资助项目(2012CB315900) 国家自然科学基金资助项目(61272501)~~
关键词 同态签名 时间戳 污染攻击 重放攻击 网络编码 无线多跳网络 homomorphic signature timestamp pollution attack replay attack network coding wireless multi-hop network
  • 相关文献

参考文献13

  • 1AHLSWEDE R, CAI N, LI S. Network information flow[J]. IEEE Transactions on Information Flow, 2000, 46(4):1204-1216.
  • 2曹张华,唐元生.安全网络编码综述[J].计算机应用,2010,30(2):499-505. 被引量:11
  • 3PERVAIZ M, CARDEI M, WU J. Routing security in ad hoc wireless networks[J]. Network Security, 2010, 117-142.
  • 4HO T, LEONG B, KOETTER R. Byzantine modification detection in multicast networks using randomized network coding[A]. Proceedings of IEEE International Symposium on Information Theory(ISIT)[C]. Massachusetts, USA, 2008. 2798-2803.
  • 5GKANTSIDIS C, RODRIGUEZ E Cooperative security for network coding file distribution[A]. Proceedings of International Conference on Computer 367-380. [M)[C]. Barcelona, Spain, 2006.
  • 6MENEZES A, OKAMOTO T, VANSTONE S. Reducing elliptic curve logorithms to logorithms in a finite field[J]. IEEE Transactions on Information Theory, 1993, 39(5):1639-1646.
  • 7YU Z, WEI Y, RAMKUMAR B. An efficient signature-based scheme for secttdng network coding against pollution attacks[A]. Proceedings of International Conference on Computer Communications (INFOCOM)[C]. Arizona, USA, 2008. 1409-1417.
  • 8GENNARO R, KATZ J, KRAWCZYK H. Secure network coding over the integers[J]. Public Key Cryptography, 2010, 60(56):142-160.
  • 9LIM S H, KIM Y H. Noisy network coding[J]. IEEE Transactions on Information Theory, 2011, 57(5):3132-3152.
  • 10LIM S H, GERLA M, KRAWCZYK H. Performance evaluation of secure network coding using homomorphic signature[A]. Proceedings of International Symposium on Network Coding(NetCod)[C]. Beijing, China, 2011.1-6.

二级参考文献5

共引文献11

同被引文献113

  • 1杨铭熙,罗蛟,李腊元.多源网络编码签名[J].China Communications,2010,7(1):131-137. 被引量:8
  • 2齐爱民.论个人信息的法律保护[J].苏州大学学报(哲学社会科学版),2005,21(2):30-35. 被引量:145
  • 3杜小勇,李曼,王珊.本体学习研究综述[J].软件学报,2006,17(9):1837-1847. 被引量:242
  • 4李小勇,桂小林.大规模分布式环境下动态信任模型研究[J].软件学报,2007,18(6):1510-1521. 被引量:138
  • 5Blaze M,Feigenbaum J,Lacy J.Decentralized Trust Management[C]//Dale J,Dinolt G,eds.Proceedings of the 17th Symposium on Security and Privacy.Washington:IEEE Computer Society Press,1996:164-173.
  • 6Cho J H,Swami A,Chen I R.Modeling and analysis of trust management with trust chain optimization in mobile Ad Hoc networks[J].Journal of Network and Computer Applications,2012,35(3):1001-1012.
  • 7Siddiqui M N,Saini V,Ahuja R.Trust management for grid environment using rule based fuzzy logic[J].Advances in Network Security and Applications,2011,196:649-657.
  • 8Devarakonda R,Palanisamy G,Green J M,et al.Data sharing and retrieval using OAI-PMH[J].Earth Science Informatics,2011,4(1):1-5.
  • 9AHLSWEDE R, CAI N, LI S. Network Information Flow [J].IEEE Trans.Info.Theory, 2000, 46(4); 1204-1216.
  • 10FORD L, FULKERSON D.Maximal Flow Through a Network [J].Can J.Math, 1956,8(3) : 399-404.

引证文献14

二级引证文献34

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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