Jothi Rangasamy
Orcid: 0000-0001-9830-021X
According to our database1,
Jothi Rangasamy
authored at least 19 papers
between 2010 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Practical and Efficient PUF-Based Protocol for Authentication and Key Agreement in IoT.
IEEE Embed. Syst. Lett., June, 2024
2023
Privacy-Preserving Outsourcing Algorithm for Solving Large Systems of Linear Equations.
SN Comput. Sci., September, 2023
2022
Int. J. Inf. Comput. Secur., 2022
2021
On "Practical and secure outsourcing algorithms for solving quadratic congruences in IoTs" from IEEE IoT journal.
Discret. Appl. Math., 2021
ES-HAS: ECC-Based Secure Handover Authentication Scheme for Roaming Mobile User in Global Mobility Networks.
Cryptogr., 2021
2018
Hide The Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT.
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
2017
Evaluation of puzzle-enabled proxy-assisted denial-of-service protection for web services.
Int. J. Inf. Comput. Secur., 2017
2016
Secur. Commun. Networks, 2016
IACR Cryptol. ePrint Arch., 2016
Proceedings of the Progress in Cryptology - INDOCRYPT 2016, 2016
2014
Proceedings of the Second International Workshop on Security in Cloud Computing, 2014
2013
2012
Proceedings of the 7th ACM Symposium on Information, Compuer and Communications Security, 2012
Proceedings of the Information Security and Privacy - 17th Australasian Conference, 2012
2011
IACR Cryptol. ePrint Arch., 2011
Towards a Provably Secure DoS-Resilient Key Exchange Protocol with Perfect Forward Secrecy.
Proceedings of the Progress in Cryptology - INDOCRYPT 2011, 2011
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security, 2011
2010
Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols.
IACR Cryptol. ePrint Arch., 2010