The secure pairing cryptographic protocols have become a strong paradigm to offer possessing security facilities of high level including identity-based encryptions, short signature and an effective key exchange in a distributed set up. The paper below gives a sketch of how to achieve secure two-way communication protocols based on the theory of bilinear maps and hardness assumptions such as Bilinear Diffie Hellman (BDH), Computational Diffie Hellman (CDH) and Decisional Diffie Hellman (DDH). The proposed architecture possesses a strong key generation, secure distribution as well as effective encryption-decryption at the small scale (resource constrained) and large scale. Analytical analysis shows that security resiliency is better with adaptive adversaries and ensuring computational efficiency. Compared ideas provide less complexity of significant administration and greater scalability in contrast to customary public key infrastructures. This model can be applied to cloud security, IoT networks and decentralized systems and this provides a solid guideline on how to develop the next-generation cryptographic protocols.