WSN中基于乱序多项式对偶密钥的攻击方案

王爱文; 温涛; 张永; 朱奉梅; 吴镝

doi:10.11959/j.issn.1000-436x.2015116

您当前的位置：

首页 >

文章列表页 >

WSN中基于乱序多项式对偶密钥的攻击方案

学术论文 | 更新时间：2024-06-05

- WSN中基于乱序多项式对偶密钥的攻击方案
- Attacking scheme against the permutation-based multi-polynomial scheme for pair-wise key establishment in wireless sensor networks
- 通信学报 2015年36卷第8期页码：110-117
- 作者机构：
  
  1. 东北大学软件中心，辽宁沈阳 110819
  2. 沈阳化工大学计算机科学与技术学院，辽宁沈阳 110142
  3. 大连东软信息学院计算机科学与技术系，辽宁大连 116023
  4. 辽宁金融职业学院信息技术系，辽宁沈阳 110122
- 作者简介：
  
  [ "王爱文（1979-），男，湖北蕲春人，东北大学博士生，沈阳化工大学工程师，主要研究方向为无线网络安全。" ]
  [ "温涛（1962-），男，陕西宝鸡人，东北大学教授、博士生导师，主要研究方向为网络安全、知识组织。" ]
  [ "张永（1981-），男，山东莱芜人，大连东软信息学院副教授，主要研究方向为无线网络安全。" ]
  [ "朱奉梅（1980-），女，辽宁沈阳人，辽宁金融职业学院讲师，主要研究方向为网络安全。" ]
  [ "吴镝（1979-），男，辽宁辽阳人，东北大学博士生，主要研究方向为网络安全。" ]
- 基金信息：
  
  国家自然科学基金资助项目(61170168);国家自然科学基金资助项目(61170169);辽宁省教育厅科学技术基金资助项目(L2013517);大连市科技计划基金资助项目(2013A16GX115)
- DOI：10.11959/j.issn.1000-436x.2015116
  中图分类号： TP393
- 网络出版日期：2015-08，
  
  纸质出版日期：2015-08-25
- 稿件说明：
移动端阅览
王爱文, 温涛, 张永, 等. WSN中基于乱序多项式对偶密钥的攻击方案[J]. 通信学报, 2015,36(8):110-117.

Ai-wen WANG, Tao WEN, Yong ZHANG, et al. Attacking scheme against the permutation-based multi-polynomial scheme for pair-wise key establishment in wireless sensor networks[J]. Journal on communications, 2015, 36(8): 110-117.
王爱文, 温涛, 张永, 等. WSN中基于乱序多项式对偶密钥的攻击方案[J]. 通信学报, 2015,36(8):110-117. DOI： 10.11959/j.issn.1000-436x.2015116.

Ai-wen WANG, Tao WEN, Yong ZHANG, et al. Attacking scheme against the permutation-based multi-polynomial scheme for pair-wise key establishment in wireless sensor networks[J]. Journal on communications, 2015, 36(8): 110-117. DOI： 10.11959/j.issn.1000-436x.2015116.

摘要

针对Guo等的WSN中基于乱序对称多项式的对偶密钥方案提出一种攻击方案。通过构造黑盒的方式，对多项式进行攻击，通过整体求解多项式集合，而不是求解单个多项式的方式，使多项式的排列顺序在多项式的破解中失去作用，从而实现乱序多项式的破解。定理证明和实例分析表明Guo等的方案不能抵御大规模节点俘获攻击，未能突破多项式的容忍门限，是一种不安全的方案。

Abstract

An attacking scheme was proposed against the permutation-based multi-polynomial scheme proposed by Guo

et al for pair-wise key establishment in wireless sensor networks.Attacks on polynomials were carried out by constructing a black-box to integrally solve the set of polynomials rather than a single polynomial.The results show that this scheme can break the symmetric polynomials and make the permutation of polynomials lose its function.The proven theorems and instance analysis indicate that the scheme proposed by Guo

et al can’t frustrate the large-scale node capture attack and can’t break the tolerance threshold of polynomials.Therefore

the scheme is insecure.

关键词

Keywords

references

RAGHINI M , MAHESWARI N U , VENKATESH R . Overview on key distribution primitives in wireless sensor network [J ] . Journal of Computer Science , 2013 , 9 ( 5 ): 543 .

BARUA M P , INDORA M S . Overview of security threats in WSN [J ] . International Journal of Computer Science and Mobile Computing,ISSN , 2013 , 2 ( 7 ): 422 - 426 .

ESCHENAUER L , GLIGOR V D . A key-management scheme for distributed sensor networks [A ] . Proceedings of the 9th ACM Conference on Computer and Communicalion Security [C ] . Washington,DC,USA , 2002 . 41 - 47 .

CHAN H , PERRIG A , SONG D . Random key predistribution schemes for sensor networks [A ] . Proceedings of the 2003 Symposium on Security and Privacy [C ] . Carnegie Mellon,PA,USA , 2003 . 197 - 213 .

LIU D , NING P . Location-based pairwise key establishments for static sensor networks [A ] . Proceedings of the 1st ACM Workshop on Security of Ad Hoc and Sensor Networks [C ] . New York,NY,USA , 2003 . 72 - 82 .

LIU D , NING P , LI R . Establishing pairwise keys in distributed sensor networks [J ] . ACM Transactions on Information and System Security(TISSEC) , 2005 , 8 ( 1 ): 41 - 77 .

DU W , DENG J , HAN Y S . A key predistribution scheme for sensor networks using deployment knowledge [J ] . IEEE Transactions on Dependable and Secure Computing , 2006 , 3 ( 1 ): 62 - 77 .

BLOM R . An optimal class of symmetric key generation systems [A ] . Proceedings of the EUROCRYPT 84 Workshop on Advances in Cryptology:Theory and Application of Cryptographic Techniques [C ] . New York,USA , 1985 . 335 - 338 .

BLUNDO C , DE SANTIS A , HERZBERG A . Perfectly-secure key distribution for dynamic conferences [A ] . Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology [C ] . London,UK , 1993 . 471 - 486 .

YU C M , LU C S , KUO S Y . Noninteractive pairwise key establishment for sensor networks [J ] . IEEE Transactions on Information Forensics and Security , 2010 , 5 ( 3 ): 556 - 569 .

ZHANG W , TRAN M , ZHU S . A random perturbation-based scheme for pairwise key establishment in sensor networks [A ] . Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing [C ] . New York,USA , 2007 . 90 - 99 .

GUO S , LEUNG V , QIAN Z . A permutation-based multi-polynomial scheme for pairwise key establishment in sensor networks [A ] . 2010 IEEE International Conference on Proceedings of the Communications(ICC) [C ] . Cape Town,SouthAfrica , 2010 . 1 - 5 .

ALBRECHT M , GENTRY C , HALEVI S . Attacking cryptographic schemes based on perturbation polynomials [A ] . Proceedings of the 16th ACM Conference on Computer and Communications Security [C ] . 2009 . 1 - 10 .

MEIJERING E . A chronology of interpolation:from ancient astronomy to modern signal and image processing [J ] . Proceedings of the IEEE , 2002 , 90 ( 3 ): 319 - 342 .

AR S , LIPTON R J , RUBINFELD R . Reconstructing algebraic functions from mixed data [J ] . SIAM Journal on Computing , 1998 , 28 ( 2 ): 487 - 510 .

FENG K , YU H . Integers and Polynomials [M ] . Beijing : Higher Education Press , 1999 .

GATHEN J . Algebraic complexity theory [J ] . Annual Review of Computer Science , 1988 , 3 ( 1 ): 317 - 348 .

GRIGOR'EV D Y E . Factoring polynomials over a finite field and solving systems of algebraic equations [J ] . Zapiski Nauchnykh Seminarov POMI , 1984 , 137 : 20 - 79 .

KALTOFEN E . A polynomial-time reduction from bivariate to univariate integral polynomial factorization [A ] . Proceedings of the 23rd Annual Symposium on Foundations of Computer Science [C ] . Washington,DC,USA , 1982 . 57 - 64 .

WAN D Q . Factoring multivariate polynomials over large finite fields [J ] . Mathematics of Computation , 1990 , 54 ( 190 ): 755 - 770 .

浏览量

685

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

基于多分布密度位置指纹的高效室内定位算法研究

网络欺骗技术综述

基于FPGA WSN轮询接入控制协议的研究

MR-MC无线传感器网络基于森林的数据收集研究

新的基于变色龙的车载通信安全与隐私保护