Bilinear Pairing Based Encryption for Sensor Network

  • Kelechi Emerole Department of Electrical and Electronic Engineering, Federal Polytechnic Nekede, Owerri, Nigeria
  • Maurice Anyaehie Department of Electrical and Electronic Engineering, Federal Polytechnic Nekede, Owerri, Nigeria
  • Stanley Nwadike Department of Electrical and Electronic Engineering, Federal Polytechnic Nekede, Owerri, Nigeria
Keywords: network, sensor, cryptography, security, problem, diffie-hellman

Abstract

In this letter, we review some research efforts in the area of Pairing based encryption for data transmission and storage taking note of the computational overhead and consequently present a simple encryption scheme to buttress our initiative further.

References

A. Shamir, “Identity-based cryptosystems and signature schemes,” in Workshop on the theory and application of cryptographic techniques, pp. 47–53, Springer, 1984.

S. D. Galbraith, K. Harrison, and D. Soldera, “Implementing the tate pairing,” in International Algorithmic Number Theory Symposium, pp. 324–337, Springer, 2002.

S. D. Galbraith, K. G. Paterson, and N. P. Smart, “Pairings for cryptogra- phers,” Discrete Applied Mathematics, vol. 156, no. 16, pp. 3113–3121, 2008. [4] V. “The weil pairing, and its efficient calculation,” Journal of Cryptology, vol. 17, no. 4, pp. 235–261, 2004.

P. S. Barreto and M. Naehrig, “Pairing-friendly elliptic curves of prime order,” in International Workshop on Selected Areas in Cryptography, pp. 319–331, Springer, 2005.

E. Lee, H.-S. Lee, and C.-M. Park, “Efficient and generalized pairing computation on abelian varieties,” IEEE Transactions on Information Theory, vol. 55, no. 4, pp. 1793–1803, 2009.

F. Hess, N. P. Smart, and F. Vercauteren, “The eta pairing revisited,” IEEE Transactions on Information Theory, vol. 52, no. 10, pp. 4595– 4602, 2006.

J.-L. Beuchat, J. E. Gonza´lez-D´ıaz, S. Mitsunari, E. Okamoto,

F. Rodr´ıguez-Henr´ıquez, and T. Teruya, “High-speed software imple- mentation of the optimal ate pairing over barreto–naehrig curves,” in International Conference on Pairing-Based Cryptography, pp. 21–39, Springer, 2010.

Z. Wang, “An identity-based data aggregation protocol for the smart grid,” IEEE Transactions on Industrial Informatics, vol. 13, no. 5, pp. 2428–2435, 2017.

D. He, S. Zeadally, B. Xu, and X. Huang, “An efficient identity- based conditional privacy-preserving authentication scheme for vehicular ad hoc networks,” IEEE Transactions on Information Forensics and Security, vol. 10, no. 12, pp. 2681–2691, 2015.

Y. Yu, M. H. Au, G. Ateniese, X. Huang, W. Susilo, Y. Dai, and

G. Min, “Identity-based remote data integrity checking with perfect data privacy preserving for cloud storage,” IEEE Transactions on Information Forensics and Security, vol. 12, no. 4, pp. 767–778, 2016.

S. Peng, F. Zhou, Q. Wang, Z. Xu, and J. Xu, “Identity-based public multi-replica provable data possession,” IEEE Access, vol. 5, pp. 26990– 27001, 2017.

X. Jia, D. He, S. Zeadally, and L. Li, “Efficient revocable id-based signature with cloud revocation server,” IEEE Access, vol. 5, pp. 2945– 2954, 2017.

J. Liu, Y. Xiao, S. Li, W. Liang, and C. P. Chen, “Cyber security and privacy issues in smart grids,” IEEE Communications Surveys & Tutorials, vol. 14, no. 4, pp. 981–997, 2012.

L. Wu, Y. Zhang, K.-K. R. Choo, and D. He, “Efficient identity-based encryption scheme with equality test in smart city,” IEEE Transactions on Sustainable Computing, vol. 3, no. 1, pp. 44–55, 2017.

Q. Lin, H. Yan, Z. Huang, W. Chen, J. Shen, and Y. Tang, “An id- based linearly homomorphic signature scheme and its application in blockchain,” IEEE Access, vol. 6, pp. 20632–20640, 2018.

Published
2019-09-03
How to Cite
Emerole, K., Anyaehie, M., & Nwadike, S. (2019). Bilinear Pairing Based Encryption for Sensor Network. International Journal of Computer (IJC), 35(1), 19-25. Retrieved from https://ijcjournal.org/index.php/InternationalJournalOfComputer/article/view/1466
Section
Articles