An Efficient Batch Verification Scheme for Secure Vehicular Communication Using Bilinear Pairings-Reference-Cited by-同舟云学术

An Efficient Batch Verification Scheme for Secure Vehicular Communication Using Bilinear Pairings

Published:2020 Issue: Volume: Page:711-720
ISSN:2194-5357
Container-title:Advances in Intelligent Systems and Computing
language:
Short-container-title:

Author:

Sridharan Namboodiri K. N.,Praveen I.

Publisher

Springer Singapore

Link

http://link.springer.com/content/pdf/10.1007/978-981-15-2475-2_65

Reference15 articles.

1. Praveen, I., Rajeev, K., Sethumadhavan, M.: An authenticated key agreement scheme using vector decomposition. Defence Sci. J. 66(6), 594 (2016)

2. Al-Riyami, S.S., Paterson, K.G.: Certificateless public key cryptography. In: Advances in Cryptology-ASIACRYPT 2003, pp. 452–473. Springer (2003)

3. Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Advances in Cryptology CRYPTO 2001, pp. 213–229. Springer (2001)

4. Zhang, C., Lu, R., Lin, X., Ho, P.-H., Shen, X.: An efficient identity-based batch verification scheme for vehicular sensor networks. In: IEEE INFOCOM 2008—The 27th Conference on Computer Communications, pp. 246–250. IEEE (2008)

5. Yoshida, M.: Inseparable multiplex transmission using the pairing on elliptic curves and its application to watermarking. In: Proceedings of Fifth Conference on Algebraic Geometry, Number Theory, Coding Theory and Cryptography, University of Tokyo (2003)

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Proxy Re-Encryption Using Vector Decomposition;Emerging Research in Computing, Information, Communication and Applications;2021-12-01