全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

采用可净化签名的OSPF协议安全保护机制

DOI: 10.13190/jbupt.201103.79.lidf, PP. 79-83

Keywords: 开放式最短路径优先协议,可净化签名,最大年龄攻击,变色龙哈希函数

Full-Text   Cite this paper   Add to My Lib

Abstract:

为了实现对变化的Age域值的签名和验证,利用可净化签名技术提出一种新的开放式最短路径优先(OSPF)路由协议安全保护机制.改进了可净化签名方案,结合其弱透明性的安全属性,并将其用于保护OSPF协议路由信息的安全.分析结果表明,所提的OSPF协议安全机制能有效抵制最大年龄(MaxAge)攻击和早熟MaxAge攻击.

References

[1]  Matsuda T, Attrapadung N, Hanaoka G, et al. A CDH-based strongly unforgeable signature without collision resistant Hash function// ProvSec2007.Berlin:Springer-Verlag, 2007: 68-84.
[2]  Sato C, Okamoto T, Okamoto E. Strongly unforgeable ID-based signatures without random oracles//ISPEC 2009. Berlin: Springer-Verlag, 2009: 35-46.
[3]  Paterson K G, Schuldt J C N. Efficient identity-based signatures secure in the standard model//ACISP 2006. Berlin: Springer-Verlag, 2006: 207-222.
[4]  孙华,姚宣霞,刘行兵,等.标准模型下可证安全的基于身份门限签密方案[J]. 北京邮电大学学报,2010, 33(2): 11-15. Sun Hua, Yao Xuanxia, Liu Xingbing, et al. Provably secure identity-based threshold signcryption scheme in the standard model[J]. Journal of Beijing University of Posts and Telecommunications, 2010, 33(2): 11-15.
[5]  Vetter B, Wang Feiyi, Wu S F. An experimental study of insider attacks for OSPF routing protocol//ICNP 1997. Atlanta: , 1997: 293-300.
[6]  Xu Shidi, Mu Yi, Susilo W. Secure AODV routing protocol using one-time signature// MSN 2005. : Springer, 2005: 288-297 .
[7]  Reyzin L, Reyzin N. Better than BIBA: short one-time signatures with fast signing and verifying//ACISP’02. Melbourne: , 2002: 144-153.
[8]  Micali S, Rivest R. Transitive signature schemes// CT-RSA 2002. : Springer-Verlag, 2002: 236-243.
[9]  Xu Shidi. Authenticated AODV routing protocol using one-time signature and transitive signature schemes[J]. Journal of Networks, 2006, 1(1): 47-53.
[10]  Perlman R. Network layer protocols with byzantine robustness. Cambridge: Massachusetts Institute of Technology, 1998.
[11]  Perlman R. Interconnections: bridges and routers[M]. Boston: Addison-Wesley, 1992.
[12]  Murphy S, Badger M, Wellington B. OSPF with digital signatures. (1997-07). http://www. faqs. org/rfcs/rfc2154. html.
[13]  Murphy S, Badger M R. Digital signature protection of the OSPF routing protocol//SNDSS’96. Washington D C: IEEE Computer Society, 1996: 93-102.
[14]  Deccio C T, Clement M, Seamons K. Securing OSPF using digital signatures and neighbor checking. (2003) . http://dna. cs. byu. edu/papers/pdf/ospf. pdf.
[15]  Ateniese G, Chou D H, DeMedeiros B, et al. Sanitizable signatures//ESORICS 2005. Milan: , 2005: 159-177.
[16]  Brzuska C, Fischlin M, Freudenreich T, et al. Security of sanitizable signatures revisited//PKC 2009. California: , 2009: 317-336.
[17]  NIST. Digital signature standard (DSS) . (1994-11).
[18]  Hoffstein J, Howgrave-Graham N, Pipher J, et al. NTRUSign: digital signatures using the NTRU lattice//CT-RSA 2003. San Francisco: , 2003: 122-140. (上接第74页)
[19]  Boneh D, Shen E, Waters B. Strongly unforgeable signatures based on computational Diffie-Hellman//PKC 2006. Berlin: Springer-Verlag, 2006: 229-240.
[20]  Huang Qiong, Wong D S, Zhao Yiming. Generic transformation to strongly unforgeable signatures//ACNS 2007. Berlin: Springer-Verlag, 2007: 1-17.
[21]  Steinfeld R, Pieprzyk J, Wang Huaxiong. How to strengthen any weakly unforgeable signature into a strongly unforgeable signature//CT-RSA 2007. Berlin: Springer-Verlag, 2007: 357-371.
[22]  Teranishi I, Oyama T, Ogata W. General conversion for obtaining strongly existentially unforgeable signatures//INDOCRYPT 2006. Berlin: Springer-Verlag, 2006: 191-205.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133