1. R. Fotohi, Y. Ebazadeh, and M. S. Geshlag, “A New Approach for Improvement Security against DoS Attacks in Vehicular Ad-hoc Network,” arXiv, 2020, doi: 10.14569/ijacsa.2016.070702.
2. Y. Ebazadeh and R. Fotohi, “A reliable and secure method for network‐layer attack discovery and elimination in mobile ad‐hoc networks based on a probabilistic threshold,” Secur. Priv., vol. 5, no. 1, p. e183, 2022.
3. Y. Salami, F. Taherkhani, Y. Ebazadeh, M. Nemati, V. Khajehvand, and E. Zeinali, “Blockchain-Based Internet of Vehicles in Green Smart City: Applications and Challenges and Solutions,” Anthropog. Pollut., vol. 7, no. 1, 2023.
4. Y. Salami and V. Khajehvand, “LSKE: Lightweight Secure Key Exchange Scheme in Fog Federation,” Complexity, vol. 2021, p. 4667586, 2021.
5. M. Wazid and P. Gope, “BACKM-EHA: A novel blockchain-enabled security solution for IoMT-based e-healthcare applications,” ACM Trans. Internet Technol., vol. 23, no. 3, pp. 1–28, 2023.
6. C.-M. Chen, S. Liu, X. Li, S. K. H. Islam, and A. K. Das, “A provably-secure authenticated key agreement protocol for remote patient monitoring IoMT,” J. Syst. Archit., vol. 136, p. 102831, 2023.
7. H. Corrigan-Gibbs and D. Kogan, “The discrete-logarithm problem with preprocessing,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, 2018, pp. 415–447.
8. D. Boneh, “The Decision Diffie-Hellman problem,” in Algorithmic Number Theory, J. P. Buhler, Ed., Berlin, Heidelberg: Springer Berlin Heidelberg, 1998, pp. 48–63.
9. P. C. van Oorschot and M. J. Wiener, “On Diffie-Hellman Key Agreement with Short Exponents,” in Advances in Cryptology --- EUROCRYPT ’96, U. Maurer, Ed., Berlin, Heidelberg: Springer Berlin Heidelberg, 1996, pp. 332–343.
10. R. L. Rivest, a Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Commun. ACM, vol. 21, no. 2, pp. 120–126, 1978, doi: 10.1145/359340.359342.
11. Y. Salami, V. Khajevand, and E. Zeinali, “Cryptographic Algorithms: A Review of the Literature, Weaknesses and Open Challenges,” J. Comput. Robot., vol. 16, no. 2, pp. 46–56, 2023.
12. D. Pointcheval, “Rabin Cryptosystem,” in Encyclopedia of Cryptography and Security, H. C. A. van Tilborg, Ed., Boston, MA: Springer US, 2005, pp. 501–502. doi: 10.1007/0-387-23483-7_339.
13. K. S. Selvi and T. Vaishnavi, “Rabin PublicKey Cryptosystem for mobile authentication,” in IEEE-International Conference On Advances In Engineering, Science And Management (ICAESM -2012), Mar. 2012, pp. 854–860.
14. Y. Salami, V. Khajehvand, and E. Zeinali, “SOS-FCI: a secure offloading scheme in fog–cloud-based IoT,” J. Supercomput., pp. 1–31,
Comput. Robot., vol. 13, no. 1, pp. 11–20, 2020.
15. Y. Salami, Y. Ebazadeh, and V. Khajehvand, “CE-SKE: cost-effective secure key exchange scheme in Fog Federation,” Iran J. Comput. Sci., vol. 4, no. 3, pp. 1–13, 2021.
16. G. Lowe, “Breaking and fixing the Needham-Schroeder public-key protocol using FDR,” in International Workshop on Tools and Algorithms for the Construction and Analysis of Systems, Springer, 1996, pp. 147–166.
17. Y. Salami, V. Khajehvand, and E. Zeinali, “E3C: A Tool for Evaluating Communication and Computation Costs in Authentication and Key Exchange Protocol,” 2022, doi: 10.48550/ARXIV.2212.03308.
18. M. Burrows, K. Kas, and T. Ta, “Wide mouthed frog,” Secur. Protoc. Open Repos. http//www. lsv. ens-cachan. fr/Software/spore/wideMouthedFrog. html, 1989.