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

  • K. N. Sridharan Namboodiri
  • Praveen I.Email author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1118)


Vehicle-to-vehicle (V-to-V) communication is an emerging technology for sensing and collecting issues related to traffic. This method revolutionises the traffic control system and human driving experience. At the same time, there is main security concern in the validation of source of messages. In this communication, verification of information is very important to avoid any malicious attack and resource abuse. Some literature used cryptographic primitives like identity-based encryption (IBE) and signatures to accomplish this need. These primitives use the mathematical function bilinear pairings. We propose a similar scheme for authenticated key agreement with the vehicles and roadside unit (RSU) using vector decomposition problem (VDP) which reduces data exchange traffic considerably. The proposed method supports batch verification.


V-to-V communications Pairings Vector decomposition problem 


  1. 1.
    Praveen, I., Rajeev, K., Sethumadhavan, M.: An authenticated key agreement scheme using vector decomposition. Defence Sci. J. 66(6), 594 (2016)CrossRefGoogle Scholar
  2. 2.
    Al-Riyami, S.S., Paterson, K.G.: Certificateless public key cryptography. In: Advances in Cryptology-ASIACRYPT 2003, pp. 452–473. Springer (2003)Google Scholar
  3. 3.
    Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Advances in Cryptology CRYPTO 2001, pp. 213–229. Springer (2001)Google Scholar
  4. 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)Google Scholar
  5. 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)Google Scholar
  6. 6.
    Yoshida, M.: Vector decomposition problem and the trapdoor inseparable multiplex transmission scheme based the problem. In: The 2003 Symposium on Cryptography and Information Security, SCIS’2003 (2003)Google Scholar
  7. 7.
    Okamoto, T., Takashima, K.: Homomorphic encryption and signatures from vector decomposition. In: Pairing-Based Cryptography–Pairing 2008, pp. 57–74. Springer (2008)Google Scholar
  8. 8.
    Galbraith, S.D., Verheul, E.R.: An analysis of the vector decomposition problem. In: Public Key Cryptography–PKC 2008, pp. 308–327. Springer (2008)Google Scholar
  9. 9.
    Praveen, I., Sethumadhavan, M.: A more efficient and faster pairing computation with cryptographic security. In: Proceedings of the First International Conference on Security of Internet of Things, pp. 145–149. ACM (2012)Google Scholar
  10. 10.
    Okamoto, T., Takashima, K.: Hierarchical predicate encryption for inner-products. In: Advances in Cryptology–ASIACRYPT 2009, pp. 214–231. Springer (2009)Google Scholar
  11. 11.
    Nidhin, D., Praveen, I., Praveen, K.: Role-based access control for encrypted data using vector decomposition. In: Proceedings of the International Conference on Soft Computing Systems, pp. 123–131. Springer (2016)Google Scholar
  12. 12.
    Kumar, M., Praveen, I.: A fully simulatable oblivious transfer scheme using vector decomposition. In: Intelligent Computing, Communication and Devices, pp. 131–137. Springer (2015)Google Scholar
  13. 13.
    Duursma, I.M., Kiyavash, N.: The vector decomposition problem for elliptic and hyperelliptic curves. IACR Cryptol. ePrint Arch. 2005, 31 (2005)zbMATHGoogle Scholar
  14. 14.
    Takashima, K.: Efficiently computable distortion maps for supersingular curves. In: Algorithmic Number Theory, pp. 88–101. Springer (2008)Google Scholar
  15. 15.
    Lim, S., Lee, E., Park, C.-M.: Equivalent public keys and a key substitution attack on the schemes from vector decomposition. Secur. Commun. Netw. 7(8), 1274–1282 (2014)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.Department of MathematicsAmrita School of Engineering, Amrita Vishwa VidyapeethamCoimbatoreIndia

Personalised recommendations