New key pre-distribution scheme using symplectic geometry over finite fields for wireless sensor networks

doi:10.1016/S1005-8885(17)60229-2

中国邮电高校学报(英文) ›› 2017, Vol. 24 ›› Issue (5): 16-22.doi: 10.1016/S1005-8885(17)60229-2

New key pre-distribution scheme using symplectic geometry over finite fields for wireless sensor networks

Chen Shangdi, Wen Jiejing

1. College of Science, Civil Aviation University of China, Tianjin 300300, China
2. The Chern Institute of Mathematics, Nankai University, Tianjin 300071, China

收稿日期:2017-06-26 修回日期:2017-09-25 出版日期:2017-10-30 发布日期:2017-12-18
通讯作者: Chen Shangdi, E-mail: 11csd@163.com E-mail:11csd@163.com
作者简介:Chen Shangdi, E-mail: 11csd@163.com
基金资助:
This work was supported by the National Natural Science Foundation of China (61179026), and the Fundamental Research Funds for the Central Universities (3122016L005).

New key pre-distribution scheme using symplectic geometry over finite fields for wireless sensor networks

Chen Shangdi, Wen Jiejing

1. College of Science, Civil Aviation University of China, Tianjin 300300, China
2. The Chern Institute of Mathematics, Nankai University, Tianjin 300071, China

Received:2017-06-26 Revised:2017-09-25 Online:2017-10-30 Published:2017-12-18
Contact: Chen Shangdi, E-mail: 11csd@163.com E-mail:11csd@163.com
About author:Chen Shangdi, E-mail: 11csd@163.com
Supported by:
This work was supported by the National Natural Science Foundation of China (61179026), and the Fundamental Research Funds for the Central Universities (3122016L005).

摘要/Abstract

摘要：

To achieve secure communication in wireless sensor networks (WSNs), where sensor nodes with limited computation capability are randomly scattered over a hostile territory, various key pre-distribution schemes (KPSs) have been proposed. In this paper, a new KPS is proposed based on symplectic geometry over finite fields. A fixed dimensional subspace in a symplectic space represents a node, all 1-dimensional subspaces represent keys and every pair of nodes has shared keys. But this naive mapping does not guarantee a good network resiliency. Therefore, it is proposed an enhanced KPS where two nodes have to compute a pairwise key, only if they share at least q common keys. This approach enhances the resilience against nodes capture attacks. Compared with the existence of solution, the results show that new approach enhances the network scalability considerably, and achieves good connectivity and good overall performance.

关键词: pre-distribution scheme, symplectic geometry, WSNs

Abstract:

Key words: pre-distribution scheme, symplectic geometry, WSNs

中图分类号:

TP309.7

Chen Shangdi, Wen Jiejing. New key pre-distribution scheme using symplectic geometry over finite fields for wireless sensor networks[J]. JOURNAL OF CHINA UNIVERSITIES OF POSTS AND TELECOM, 2017, 24(5): 16-22.

参考文献

References

1. Perrig A, Stankovic J A, Wagner D A. Security in sensor networks. Communication of the ACM, 2004, 47(6): 53-57

2. Akyildiz I F, Su W L, Sankarasubramaniam Y, et al. Survey on sensor networks. IEEE Communications, 2002, 40(8): 102-114

3. Eschenauer L, Gligor V. A key management scheme for distributed sensor networks. Proceedings of the 9th ACM Conference on Computer and Communication Security (CCS’02), Nov 18-22, 2002, Washington, DC, USA. New York, NY, USA: ACM, 2002: 41-47

4. Chan H W, Perrig A, Song D. Random key predistribution schemes for sensor netwoks. Proceedings of the 2003 Symposium on Security and Priacy, May 11-14, 2003, Berkeley, CA, USA. Piscataway, NJ, USA: IEEE, 2003: 197-213

5. Çamtepe S A, Yener B. Combinatorial design of key distribution mechanisms for wireless sensor networks. Proceedings of the 9th European Symposium on Research Computer Security (ESORICS’04), Sept 13-15, 2004, Sophia Antipolis, France. LNCS 3193. Berlin, Germany: Springer-Verlag, 2004: 293-308

6. Camtepe S A, Yener B. Combinatorial design of key distribution mechanisms for wireless sensor networks. IEEE/ACM Transactions on Network, 2007, 15(2): 346-358

7. Lee J, Stinson D R. On the construction of practical key predistribution schemes for distributed sensor networks using combinatorial designs. Transactions on Information and System Security, 2008, 11(2): Article 1

8. Lee J, Stinson D R. Acombinatorial approach to key predistribution for distributed sensor networks. IEEE Wireless Communications and Networking Conference (WCNC'05): Vol 2, Mar 13-17, 2005, New Orleans, LA, USA. Piscataway, NJ, USA: IEEE, 2005: 1200-1205

9. Bose M A, Mukerjee R. Key pre-distribution schemes for distributed sensor networks via block designs. Designs, Codes and Cryptography, 2003, 67(1): 111-136

10. Bechkit W, Challal Y, Bouabdallah A, et al. A highly scalable key pre-distribution scheme for wireless sensor networks. IEEE Transactions on Wireless Communications, 2013, 12(2): 948-959

11. Kendall M, Martin K M. Graph-theoretic design and analysis of key predistribution schemes. Designs, Codes and Cryptography, 2016, 81(1): 11-34

12. Chen S D, Wei H H. Constructions for key distribution patterns. Frontiers of Mathematics in China, 2017, 12(2): 301-323

13. Wan Z X. Geometry of classical group over finite field. Beijing, China: Science Press, 2002

[1]	Tao Yunting, Kong Fanyu, Yu Jia. EPMDA: an efficient privacy-preserving multi-dimensional data aggregation scheme for edge computing-based IoT system [J]. 中国邮电高校学报(英文版), 2021, 28(6): 26-35.
[2]	谢佳胡予濮高军涛高雯李雪莲. Attribute-based signatures on lattices[J]. 中国邮电高校学报(英文版), 2016, 23(4): 83-90.
[3]	陈毅成，邹雪城，刘政林，陈晓飞，韩煜. Dynamic inhomogeneous S-Boxes design for efficient AES masking mechanisms[J]. Acta Metallurgica Sinica(English letters), 2008, 15(2): 72-76.

New key pre-distribution scheme using symplectic geometry over finite fields for wireless sensor networks

New key pre-distribution scheme using symplectic geometry over finite fields for wireless sensor networks

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 3

编辑推荐

Metrics

本文评价