Sensornet - A Key Predistribution Scheme for Distributed Sensors using Nets

Deepak Kumar Dalai, Pinaki Sarkar

2017

Abstract

Key management is an essential functionality for developing secure cryptosystems; particularly for implementations to low cost devices of a distributed sensor networks (DSN)–a prototype of Internet of Things (IoT). Low cost leads to constraints in various resources of constituent devices of a IoT (sensors of a DSN); thereby restricting implementations of computationally heavy public key cryptosystems. This leads to adaptation of the novel key predistribution trick in symmetric key platform to efficiently tackle the problem of key management for these resource starved networks. After a few initial proposals based on random graphs, most key predistribution schemes (KPS) use deterministic (combinatorial) approaches to assure essential design properties. Combinatorial designs like a (v;b; r;k)􀀀configuration which forms a μ(v;b; r;k)􀀀CID are effective schemes to design KPS (Lee and Stinson, 2005). A net in a vector space is a set of cosets of certain kind of subspaces called partial spread. A μ(v;b; r;k)􀀀CID can be formed from a net. In this paper, we propose a key predistribution scheme for DSN, named as sensornet, using net. Effectiveness of sensornet in term of crucial metrics in comparison to other prominent schemes has been theoretically established.

References

  1. Bag, S., Dhar, A., and Sarkar, P. (2012). 100% connectivity for location aware code based kpd in clustered wsn: Merging blocks. In Information Security Conference, ISC 2012, number 7483 in Lecture Notes in Computer Science, pages 136-150. Springer-Verlag.
  2. Blom, R. (1985). An optimal class of symmetric key generation systems. In Advances in Cryptology - Eurocrypt 1984, number 209 in Lecture Notes in Computer Science, pages 335-338. Springer-Verlag.
  3. Bose, M., Dey, A., and Mukerjee, R. (2013). Key predistribution schemes for distributed sensor networks via block designs. Design, Codes and Cryptography, 67(1):111-136.
  4. Bu, T. (1980). Partitions of a vector space. Discrete Mathematics, 31:79-83.
  5. C¸amtepe, S. A. and Yener, B. (2004). Combinatorial design of key distribution mechanisms for wireless sensor networks. In 9th European Symposium on Research Computer Security, ESORICS 2004, number 3193 in Lecture Notes in Computer Science, pages 293-308. Springer-Verlag.
  6. C¸amtepe, S. A. and Yener, B. (2005). Key distribution mechanisms for wireless sensor networks: a survey. Technical report, Rensselaer Polytechnic Institute. Available at www.cs.rpi.edu/research/pdf/05- 07.pdf.
  7. C¸es¸melio g?lu, A., Meidl, W., and Pott, A. (2015). Bent functions, spreads, and o-polynomials. SIAM Journal of Discrete Mathematics, 29(2):854-867.
  8. Chen, C. Y. and Chao, H. C. (2011). A survey of key predistribution in wireless sensor networks. Security and Communication Networks, 7(12).
  9. Dhar, A. and Sarkar, P. (2011). Full communication in a wireless sensor network by merging blocks of a key predistribution using reed solomon code. In Proceedings of CCSEA 2011, CS & IT 02, pages 389-400.
  10. Dong, J. W., Pei, D. Y., and Wang, X. L. (2011). A class of key predistribution schemes based on orthogonal arrays. Journal of Computer Science and Technology, 23:825-831.
  11. Eisfeld, J. and Storme, L. (2000). (partial) t-spreads and minimal t-covers in finite projective spaces. In Lecture notes for the Socrates Intensive Course on Finite Geometry and its Applications, University of Ghent.
  12. Erdo?s, P. and Rényi, A. (1960). On the evolution of random graphs. Publication of the Mathematical Institute of the Hungarian Academy of Sciences.
  13. Eschenauer, L. and Gligor, V. (2002). A key-management scheme for distributed sensor networks. In Proceedings of 9th ACM conference on computer and communications security, pages 41-47. ACM press.
  14. Henry, K. J., Paterson, M. B., and Stinson, D. R. (2014). Practical approaches to varying network size in combinatorial key predistribution schemes. In Selected Areas in Cryptography (SAC) 2013, number 8282 in Lecture Notes in Computer Science, pages 89-117. Springer-Verlag.
  15. Johnson, N. L. (2010). Combinatorics of Spreads and Parallelisms. CRC Press.
  16. Johnson, N. L., Jha, V., and Biliotti, M. (2007). Handbook of Finite Translation Planes, volume 289 of Pure and Applied Mathematics. Chapman & Hall/CRC.
  17. Lee, J. and Stinson, D. R. (2004). Deterministic key predistribution schemes for distributed sensor networks. In Selected Areas in Cryptography (SAC) 2004, number 3357 in Lecture Notes in Computer Science, pages 294-307. Springer-Verlag.
  18. Lee, J. and Stinson, D. R. (2005). A combinatorial approach to key predistribution for distributed sensor networks. In IEEE Wireless Communications and Networking Conference, WCNC-2005, pages 1200-1205.
  19. Lee, J. and Stinson, D. R. (2008). On the construction of practical key predistribution schemes for distributed sensor networks using combinatorial designs. ACM Transactions on Information and System Security, 11(2):854-867.
  20. Lidl, R. and Niederreiter, H. (1997). Finite fields. Encyclopaedia of mathematics and its applications. Cambridge University Press.
  21. Lu, H. Y. (2008). Partial spreads and hyperbent functions in odd characteristic. Master's thesis, Simon Fraser University.
  22. Paterson, M. B. and Stinson, D. R. (2014). A unified approach to combinatorial key predistribution schemes for sensor networks. Design, Codes and Cryptography, 71(3):433-457.
  23. Ruj, S. and Pal, A. (2016). Preferential attachment model with degree bound and its application to key predistribution in WSN. In IEEE Conference on Advanced Information Networking and Applications, AINA 2016, pages 677-683.
  24. Ruj, S. and Roy, B. K. (2008). Key predistribution schemes using codes in wireless sensor networks. In Information Security and Cryptology, Inscrypt 2008, number 5487 in Lecture Notes in Computer Science, pages 275-288. Springer-Verlag.
  25. Wei, R. and Wu, J. (2004). Product construction of key distribution schemes for sensor networks. In Selected Areas in Cryptography (SAC) 2004, number 3357 in Lecture Notes in Computer Science, pages 280-293. Springer-Verlag.
  26. Wu, B. (2013). Ps bent functions constructed from finite pre-quasifield spreads. Available at http://arxiv. org/pdf/1308.3355.pdf.
Download


Paper Citation


in Harvard Style

Dalai D. and Sarkar P. (2017). Sensornet - A Key Predistribution Scheme for Distributed Sensors using Nets . In Proceedings of the 6th International Conference on Sensor Networks - Volume 1: SENSORNETS, ISBN 978-989-758-211-0, pages 49-58. DOI: 10.5220/0006132700490058


in Bibtex Style

@conference{sensornets17,
author={Deepak Kumar Dalai and Pinaki Sarkar},
title={Sensornet - A Key Predistribution Scheme for Distributed Sensors using Nets},
booktitle={Proceedings of the 6th International Conference on Sensor Networks - Volume 1: SENSORNETS,},
year={2017},
pages={49-58},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006132700490058},
isbn={978-989-758-211-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Sensor Networks - Volume 1: SENSORNETS,
TI - Sensornet - A Key Predistribution Scheme for Distributed Sensors using Nets
SN - 978-989-758-211-0
AU - Dalai D.
AU - Sarkar P.
PY - 2017
SP - 49
EP - 58
DO - 10.5220/0006132700490058