期刊文献+

Ad-hoc路由协议的串空间安全性扩展 被引量:1

Security Extension on Strand Space Model for Ad-hoc Routing Protocols
下载PDF
导出
摘要 根据Ad-hoc移动网络特点,深入分析了串空间模型的一致性条件,提出路由五段式模型,将中继者可信条件修改为任意中继者可信条件,使串空间适用于Ad-hoc安全路由协议分析。然后以一个攻击实例验证路由五段式模型的正确性和优越性。 Abstract based on the characteristics of Ad-hoc mobile network and detail analysis of the consistency condition in strand space model,a concept of five routing segments model was brought up and intermediator credibility condition was changed into the arbitrary intermediator credibility condition,thus the strand space model was adapted to the security analysis for Ad-hoc routing protocols.Then an attack was brought to verify the correctness and superiority of the five routing segments model.
出处 《计算机科学》 CSCD 北大核心 2011年第7期51-54,共4页 Computer Science
基金 国家自然科学基金重点项目(60633020) 国家自然科学基金项目(60573036 60702059 60503012 60872041) 国家高技术研究发展计划(863)(2007AA01Z429) 国家科技重大专项(2009ZX03004-003) 中央高校基本科研业务费专项资金(JY10000903006 JY10000903012)资助
关键词 串空间 安全协议 一致性条件 任意中继者可信条件 Sstrand space model Security protocol Consistency condition Arbitrary intermediator credibility condition
  • 相关文献

参考文献14

  • 1Buttyan L, Vajda I. Towards provable security for Ad hoc rou- ting protocols[C]//Proc of SASN' 04. Washington IX;, USA, 2004:94-105.
  • 2毛立强,马建峰.可证明安全的MANET按需距离矢量路由协议分析[J].西安电子科技大学学报,2008,35(6):1063-1068. 被引量:4
  • 3Burrows M, Abadi M, Needham R. A logic of authentication[C]. ACM Transactions in Computer Systems, 1990,8 ( 1 ) : 18-36.
  • 4Wang Ying long, Wang Ji-zhi. The Security Analysis for Ad hoc Routing Protocols Based on Improved Strand Space [C]// SP- CA06: 1st International Symposium on Pervasive Computing and Applications. 2006 (1) : 585-588.
  • 5Fdbrega F J T, Herzog J C, Guttman J D. Strand spaces: Why is a security protocol correct? [C]// Proc. of the 1998 IEEE Syrup. on Security and Privacy. Los Alamitos: IEEE Computer Society Press, 1998:160-171.
  • 6Faibrega F J T, Herzog J C, G uttman J D. Strand spaces~ Proving security protocols correct[J]. Journal of Computer Security, 1999,7(2/3) : 191-230.
  • 7Paulson L C. The inductive approach to verifying cryptographic protocols[J]. Journal of Computer Security, 1998,6 (1) : 85-128.
  • 8Guttman J D, Fdbrega F J T. Authentication tests[C]// Proc. of the 2000 IEEE Syrup. on Security and Privacy. Los Alamitos: IEEE Computer Society Press, 2000 : 96-109.
  • 9Guttman J D, Fdbrega F J T. Authentication tests and the struc ture of bundles [J]. Theoretical Computer Science, 2002, 283 (2):333-380.
  • 10Perkins C E,Royer E M. Ad-hoc on demand distance vector rou ting[C]// Proc. of the 2nd IEEE Workshop on Mobile Compu- ting Systems and Applications. New Orleans, 1999:90-100.

二级参考文献47

  • 1慕建君.一种形式化分析安全协议的新模型[J].西安电子科技大学学报,2006,33(3):381-385. 被引量:2
  • 2Argyroudis P G, O'Mahony D. Secure Routing for Mobile Ad Hoe Networks[J]. IEEE Communication Surveys &Tutorials, 2005, 7(3): 2-21.
  • 3Perkins C E, Royer E M. Ad-hoc On-demand Distance Vector Routing[C]//Proc of WMCSA'99. New Orleans: IEEE Press, 1999: 90-100.
  • 4Papadimitratos P, Haas Z J. Secure Routing for Mobile Ad Hoc Networks[C]//Proc of CNDS2002. San Antonio: Sage Science Press, 2002: 1-13.
  • 5Marshall J D. An Analysis of the Secure Routing Protocol for Mobile Ad Hoc Network Route Discovery: Using Intuitive Reasoning and Formal Verification to Identify Flaws[D]. Florida: Florida State University, 2003.
  • 6Yang S H, Baras J S. Modeling Vulnerabilities of Ad Hoc Routing Protocols[C]//Proc of the 1st ACM Workshop on Security of Ad Hoc and Sensor Networks. Fairfax: ACM Press, 2003: 12-20.
  • 7Zapata M G, Asokan N. Securing Ad Hoe Routing Protocols[C]//Proc of WiSe'02. Atlanta: ACM Press, 2002: 1-10.
  • 8Buttyan L, Vajda I. Towards Provable Security for Ad Hoe Routing Protocols[C]//Proe of SASN'04. Washington DC: ACM Press, 2004:94-105.
  • 9Acs G, Buttyan L, Vajda I. Provably Secure On-demand Source Routing in Mobile Ad Hoe Networks[EB/OL]. [2008- 06-07]. http://www, hit. brae. hu.
  • 10Hu Y C, Perrig A, Johnson D. Ariadne: a Secure On-demand Routing Protocol for Ad Hoe Networks[C]//Proc of MobiCom2002. Atlanta: ACM Press, 2002.. 12-23.

共引文献6

同被引文献19

  • 1周亚军,李晖,马建峰.防污染和防窃听的网络编码[D].西安:西安电子科技大学,2009.
  • 2Ahlswede R, Ning Cai, Li S Y R, et al. Network Information Flow [J].IEEE Transactions on Information Theory, 2000,46 (4):1204-1216.
  • 3Li S-Y R, Yeung R W, Cai Ning. Linear Network Coding [J]. IEEE Transactions on Information Theory, 2003,49 (2) : 371-381.
  • 4Koetter R,Medard M. An algebraic approach to network coding [J]. IEEE/ACM Transaction on Networking, 2003,11 (5) : 782- 795.
  • 5Jaggi S, Sanders P, Chou P A, et al. Polynomial time algorithms for multicast network code construction [J]. IEEE Transactions on Information Theory, 2005,51(6) : 1973-1982.
  • 6Cai N, Yeung R. Secure network coding [C]//IEEE Internatio- nal Symposium Information Theory. 2002,2 : 323.
  • 7Ho T. Networking from a network coding perspective [D]. MIT, 2004.
  • 8赵慧,卓新建.等.一种基于网络拓扑的安全网络编码算法分析[C]∥通信理论与技术新进展一第十三届全国青少年通信学术会议论文集.2008:844-846.
  • 9Jain K. Security based on network topology against the wiretap- ping attack [J]. IEEE Wireless Communication, 2004, 11 ( 1 ) : 68-71.
  • 10Jaggi S, Langberg M, Ho T, et al. Correction of Adversarial Errors in Networks [C]//International Symposium on Informa- tion Theory. Sept. 2005:1455-1459.

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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