Ajoy Kumar Khan
Orcid: 0000-0003-1568-7872
According to our database1,
Ajoy Kumar Khan
authored at least 18 papers
between 2018 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Investigation on storage level data integrity strategies in cloud computing: classification, security obstructions, challenges and vulnerability.
J. Cloud Comput., December, 2024
Addressing data scarcity issue for English-Mizo neural machine translation using data augmentation and language model.
J. Intell. Fuzzy Syst., March, 2024
Multi-level Data Integrity Model with Dual Immutable Digital Key Based Forensic Analysis in IoT Network.
SN Comput. Sci., January, 2024
J. Inf. Secur. Appl., 2024
Stub Signature-Based Efficient Public Data Auditing System Using Dynamic Procedures in Cloud Computing.
IEEE Access, 2024
2023
IEEE Access, 2023
2022
Int. J. Inf. Secur. Priv., 2022
Computación y Sistemas, 2022
CoRR, 2022
An ECDH and AES Based Encryption Approach for Prevention of MiTM in SDN Southbound Communication Interface.
Proceedings of the 13th International Conference on Computing Communication and Networking Technologies, 2022
2021
Resisting HODPA attacks in modular exponentiation using inner product with differential evolution.
Innov. Syst. Softw. Eng., 2021
Quantum Resistance for Cryptographic Keys in Classical Cryptosystems: A Study on QKD Protocols.
Proceedings of the 12th International Conference on Computing Communication and Networking Technologies, 2021
2020
Innov. Syst. Softw. Eng., 2020
A secured modular exponentiation for RSA and CRT-RSA with dual blinding to resist power analysis attacks.
Int. J. Inf. Comput. Secur., 2020
IET Inf. Secur., 2020
Proceedings of the Machine Learning, Image Processing, Network Security and Data Sciences, 2020
2018
Improving Power Analysis Peak Distribution Using Canberra Distance to Address Ghost Peak Problem.
Int. J. Inf. Secur. Priv., 2018
Securing RSA against power analysis attacks through non-uniform exponent partitioning with randomisation.
IET Inf. Secur., 2018