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

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

Abstract

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.

Key words: WSN, pair-wise key establishment, polynomial, attack, black-box

Ai-wen WANG,Tao WEN,Yong ZHANG,Feng-mei ZHU,Di WU. 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.

Figures/Tables 2

Y = [y^{m} (- 1) y^{m - 1} y^{m - 2} \dots {(- 1)}^{m} y^{0}]

参数	参数含义	参数取值
m	节点部署多项式个数
t	多项式阶数
p	素数
n	节点个数
GF(p)	特征为 p的有限域
ID	节点标识	ID∈[1,p?1]
N	节点ID集合	{ID₁,ID₂,…,ID_n?1,ID_n}
F	被俘获节点ID集合	${I D_{c_{1}}, I D_{c_{2}}, \dots, I D_{c_{m t}}, I D_{c_{m t + 1}}} (c_{i} \in [1, n], 1 \leq i \leq m t + 1)$
E	(m+1)×(mt+1)矩阵	$E (i, j) = e_{i - 1, j - 1}$
X	关于变量x的向量	$X = {[x^{0} x^{1} x^{2} \dots x^{m t - 1} x^{m t}]}^{'}$
Y	关于变量y的向量
UP(ID_i)	ID_i上m个一元t阶多项式系数矩阵	size(UP(ID_i))=[m t+1]
CUP	由mt+1个UP(ID_i)矩阵组成的三维矩阵	$C P U = [U P (I D_{c_{1}}) U P (I D_{c_{2}}) \dots U P (I D_{c_{m t + 1}})]$

References 20

[1]	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.
[2]	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.
[3]	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.
[4]	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.
[5]	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.
[6]	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.
[7]	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.
[8]	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.
[9]	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.
[10]	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.
[11]	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.
[12]	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.
[13]	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.
[14]	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.
[15]	AR S , LIPTON R J , RUBINFELD R . Reconstructing algebraic functions from mixed data[J]. SIAM Journal on Computing, 1998,28(2): 487-510.
[16]	FENG K , YU H . Integers and Polynomials[M]. Beijing: Higher Education Press, 1999.
[17]	GATHEN J . Algebraic complexity theory[J]. Annual Review of Computer Science, 1988,3(1): 317-348.
[18]	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.
[19]	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.
[20]	WAN D Q . Factoring multivariate polynomials over large finite fields[J]. Mathematics of Computation, 1990,54(190): 755-770.

Metrics

Recommended 0

No Suggested Reading articles found!

m	t=2	t=3	t=4	t=5	t=6	t=7	t=8
2	4	8	16	32	64	128	256
3	36	216	1 296	7 776	46 656	279 936	1.7 ×10⁶
4	576	13 824	331 776	8.0×10⁶	1.9×10⁸	4.6×10⁹	1.1×10¹¹
5	14 400	1.7 ×10⁶	2.1×10⁸	2.5×10¹⁰	3.0×10¹²	3.6×10¹⁴	4.3×10¹⁶
6	518 400	3.7 ×10⁸	2.7 ×10¹¹	1.9×10¹⁴	1.4×10¹⁷	1.0×10²⁰	7.2×10²²
7	2.5×10⁷	1.3×10¹¹	6.5×10¹⁴	3.3×10¹⁸	1.6×10²²	8.3×10²⁵	4.2×10²⁹
8	1.6×10⁹	6.6×10¹³	2.6×10¹⁸	1.1×10²³	4.3×10²⁷	1.7×10³²	7.0×10³⁶

Attacking scheme against the permutation-based multi-polynomial scheme for pair-wise key establishment in wireless sensor networks

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 2

References 20

Related Articles 15

Metrics

Recommended 0

[1]	Xindi MA, Qinghua LI, Qi JIANG, Zhuo MA, Sheng GAO, Youliang TIAN, Jianfeng MA. Byzantine-robust federated learning over Non-IID data [J]. Journal on Communications, 2023, 44(6): 138-153.
[2]	Jiale ZHANG, Chengcheng ZHU, Xiaobing SUN, Bing CHEN. Membership inference attack and defense method in federated learning based on GAN [J]. Journal on Communications, 2023, 44(5): 193-205.
[3]	Shengxing YU, Zekai CHEN, Zhong CHEN, Ximeng LIU. DAGUARD: distributed backdoor attack defense scheme under federated learning [J]. Journal on Communications, 2023, 44(5): 110-122.
[4]	Shaoyu DU. Improved integral attack——random linear distinguish and key recovery attack [J]. Journal on Communications, 2023, 44(4): 145-153.
[5]	Jinyin CHEN, Haiyang XIONG, Haonan MA, Yayu ZHENG. CLB-Defense: based on contrastive learning defense for graph neural network against backdoor attack [J]. Journal on Communications, 2023, 44(4): 154-166.
[6]	Zhiyong LUO, Yu ZHANG, Qing WANG, Weiwei SONG. Study of SDN intrusion intent identification algorithm based on Bayesian attack graph [J]. Journal on Communications, 2023, 44(4): 216-225.
[7]	Ming XU, Baojun ZHANG, Yiming WU, Chenduo YING, Ning ZHENG. Cyber attacks and privacy protection distributed consensus algorithm for multi-agent systems [J]. Journal on Communications, 2023, 44(3): 117-127.
[8]	Huawei HUANG. Security analysis of public-key cryptosystems based on matrix action problem against quantum attack [J]. Journal on Communications, 2023, 44(3): 220-226.
[9]	Dongbin WANG, Dongzhe WU, Hui ZHI, Kun GUO, Xu ZHANG, Jinqiao SHI, Yu ZHANG, Yueming LU. Preventing flow table overflow against denial of service attack in software defined network [J]. Journal on Communications, 2023, 44(2): 1-11.
[10]	Haiyan KANG, Molan LONG. Research on network attack analysis method based on attack graph of absorbing Markov chain [J]. Journal on Communications, 2023, 44(2): 122-135.
[11]	Youliang TIAN, Maoqing TIAN, Hongfeng GAO, Miao HE, Jinbo XIONG. Cooperation-based location authentication scheme for crowdsensing applications [J]. Journal on Communications, 2022, 43(9): 121-133.
[12]	Jing ZHAO, Jun LI, Chun LONG, Wei WAN, Jinxia WEI, Kai CHEN. Unsupervised detection method of RoQ covert attacks based on multilayer features [J]. Journal on Communications, 2022, 43(9): 224-239.
[13]	Manman LI, Shaozhen CHEN. Improved meet-in-the-middle attack on reduced-round Kiasu-BC algorithm [J]. Journal on Communications, 2022, 43(7): 41-48.
[14]	Xinchun YIN, Mengyu WANG, Jianting NING. Lightweight searchable medical data sharing scheme [J]. Journal on Communications, 2022, 43(5): 110-122.
[15]	Haili SUN, Xiang LONG, Lansheng HAN, Yan HUANG, Qingbo LI. Overview of anomaly detection techniques for industrial Internet of things [J]. Journal on Communications, 2022, 43(3): 196-210.