| Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols D Stebila, L Kuppusamy, J Rangasamy, C Boyd, J Gonzalez Nieto Topics in Cryptology–CT-RSA 2011: The Cryptographers’ Track at the RSA …, 2011 | 75 | 2011 |
| An integrated approach to cryptographic mitigation of denial-of-service attacks J Rangasamy, D Stebila, C Boyd, JG Nieto Proceedings of the 6th ACM Symposium on Information, Computer and …, 2011 | 22 | 2011 |
| Publicly verifiable ciphertexts JM González Nieto, M Manulis, B Poettering, J Rangasamy, D Stebila Security and Cryptography for Networks: 8th International Conference, SCN …, 2012 | 17* | 2012 |
| CRT-based outsourcing algorithms for modular exponentiations L Kuppusamy, J Rangasamy International Conference on Cryptology in India, 81-98, 2016 | 16 | 2016 |
| Revisiting single-server algorithms for outsourcing modular exponentiation J Rangasamy, L Kuppusamy International Conference on Cryptology in India, 3-20, 2018 | 13 | 2018 |
| Efficient modular exponentiation-based puzzles for denial-of-service protection J Rangasamy, D Stebila, L Kuppusamy, C Boyd, J Gonzalez Nieto Information Security and Cryptology-ICISC 2011: 14th International …, 2012 | 13 | 2012 |
| Practical client puzzles in the standard model L Kuppusamy, J Rangasamy, D Stebila, C Boyd, JG Nieto Proceedings of the 7th ACM Symposium on Information, Computer and …, 2012 | 10 | 2012 |
| Hide the Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT O Uzunkol, J Rangasamy, L Kuppusamy Information Security: 21st International Conference, ISC 2018, Guildford, UK …, 2018 | 9 | 2018 |
| Decomposed s-boxes and DPA attacks: A quantitative case study using PRINCE R Selvam, D Shanmugam, S Annadurai, J Rangasamy Security, Privacy, and Applied Cryptography Engineering: 6th International …, 2016 | 6 | 2016 |
| Towards a provably secure DoS-resilient key exchange protocol with perfect forward secrecy L Kuppusamy, J Rangasamy, D Stebila, C Boyd, J Gonzalez Nieto Progress in Cryptology–INDOCRYPT 2011: 12th International Conference on …, 2011 | 5 | 2011 |
| Cryptographic approaches to denial-of-service resistance C Boyd, J Gonzalez-Nieto, L Kuppusamy, H Narasimhan, CP Rangan, ... An Investigation into the Detection and Mitigation of Denial of Service (DoS …, 2011 | 5 | 2011 |
| ES-HAS: ECC-based secure handover authentication scheme for roaming mobile user in global mobility networks S KS, J Rangasamy, S S. Kamath, CC Lee Cryptography 5 (4), 35, 2021 | 3 | 2021 |
| Evaluation of puzzle-enabled proxy-assisted denial-of-service protection for web services J Rangasamy, L Kuppusamy, G Krishnan, Velmurugan International Journal of Information and Computer Security 9 (1-2), 114-129, 2017 | 3 | 2017 |
| Practical and Efficient PUF-based Protocol for Authentication and Key Agreement in IoT S Manivannan, RS Chakraborty, I Chakrabarti, J Rangasamy IEEE Embedded Systems Letters, 2023 | 2 | 2023 |
| On secure outsourcing of cryptographic computations to cloud L Kuppusamy, J Rangasamy, P Gauravaram Proceedings of the 2nd international workshop on Security in cloud computing …, 2014 | 2 | 2014 |
| Effort-release public-key encryption from cryptographic puzzles J Rangasamy, D Stebila, C Boyd, JM González-Nieto, L Kuppusamy Information Security and Privacy: 17th Australasian Conference, ACISP 2012 …, 2012 | 2 | 2012 |
| Privacy-Preserving Outsourcing Algorithm for Solving Large Systems of Linear Equations S Rath, J Rangasamy SN Computer Science 4 (5), 656, 2023 | 1 | 2023 |
| Light-Weight Deep Learning Models for Visual Malware Classification E Akshay Kumar, J Rangasamy Advances in Signal Processing, Embedded Systems and IoT: Proceedings of …, 2023 | 1 | 2023 |
| Robust message authentication in the context of quantum key distribution D Shanmugam, J Rangasamy International Journal of Information and Computer Security 18 (3-4), 365-382, 2022 | 1 | 2022 |
| On “Practical and secure outsourcing algorithms for solving quadratic congruences in IoTs” from IEEE IoT journal J Rangasamy Discrete Applied Mathematics 302, 139-146, 2021 | 1 | 2021 |
