期刊文献+

ECC结合ID签名的WSN广播安全认证方案 被引量:2

Security Authentication Scheme of WSN Broadcast Based on ECC and ID Signature
下载PDF
导出
摘要 广播认证是无线传感器网络(Wireless Sensor Networks,WSN)的1种基本安全服务,针对现有认证方案的计算量大、认证速度慢等问题,提出1种基于椭圆曲线加密(Elliptic Curve Cryptography,ECC)和身份(ID)签名的WSN广播快速安全认证方案。对现有EIBAS签名认证方案进行改进,通过节点间的合作,共享中间计算结果来减少邻居节点的计算量,以此提高认证速度,减少能量消耗。同时,提出1种安全机制,通过对多个邻居共享数据的对比来抵御恶意节点的攻击。实验结果表明,该方案能够提高约42%的签名认证速度,降低约36%的能耗,大大延长了网络生命周期。 The broadcast authentication is a fundamental security service in wireless sensor network (WSN). For the issues that the existing authentication schemes have the disadvantages such as large amount of calculation, slow authentication and so on, a fast authentication scheme of WSN broadcast based on ECC and ID signature is proposed. The scheme is an improvement of the existing EIBAS signature authentication scheme. In this scheme, the calculation amount of neighbor nodes is reduced through sharing intermediate computing results between nodes, in order to improve the speed of certification and reduce energy consumption. At the same time, a security mechanism is proposed to resist the attack of the malicious nodes by comparing the data from the multiple neighbors. Experimental results show that the proposed scheme can improve the speed of signature verification by about 42 %, and reduce the energy consumption by about 36 %, which greatly prolongs the network life cycle.
出处 《控制工程》 CSCD 北大核心 2017年第4期863-869,共7页 Control Engineering of China
关键词 信息安全 无线传感器网络 广播安全认证 椭圆曲线加密 身份签名 Information security wireless sensor network security authentication of broadcast elliptic curve cryptography identity signature
  • 相关文献

参考文献7

二级参考文献115

  • 1隋爱芬,杨义先,钮心忻,罗守山.基于椭圆曲线密码的可认证密钥协商协议的研究[J].北京邮电大学学报,2004,27(3):28-32. 被引量:27
  • 2王尚平,侯红霞,李敏.基于椭圆曲线的前向安全数字签名方案[J].计算机工程与应用,2006,42(18):150-151. 被引量:4
  • 3KOBLITZ N. Elliptic curve cryptosystems[J]. Mathematics of Compution American Mathematical Society, 1987(48): 203-309. 被引量:1
  • 4MILLER V. Use of elliptic curves in cryptography[A]. Advance in Cryptology-Proceedings of CRYPTO 1985, Lecture Notes in Computer Science[C]. Springer, 1986. 417-426. 被引量:1
  • 5MONTGOMERY P L. Speeding the pollard and elliptic curve methods of factorizations[J]. Math. Comp, 1987, 48: 243-264. 被引量:1
  • 6MONTGOMERY P L. Modular multiplication without trial division[J]. Mathematics of Computation, 1985, 44(170): 519-521. 被引量:1
  • 7LOPEZ J, DAHAB R. Fast Multiplication on elliptic curves over GF(2^m) without precomputation[A]. Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems[C]. London, UK: Springer Verlag, 1999.316-327. 被引量:1
  • 8OKEYA K, SAKURAI K. Use of Montgomery trick in precomputation of multi-scalar multiplication in elliptic curve cryptosystems[J]. IFACE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2003,86(1): 98-112. 被引量:1
  • 9IZU T. Elliptic curve exponentiation for cryptosystem[A]. SCIS'99[C]. 1999.275-280. 被引量:1
  • 10OKEYA K, SAKURAI K. A scalar multiplication algorithm with recovery of y-coordinate on the Montgomery form and analysis of efficiency for elliptic curve cryptosystem[J]. IEICE Trans Fundamental, 2002, 85(1): 84-93. 被引量:1

共引文献50

同被引文献24

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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