default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJothi Rangasamy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Sivappriya Manivannan
, Rajat Subhra Chakraborty, Indrajit Chakrabarti, Jothi Rangasamy:
Practical and Efficient PUF-Based Protocol for Authentication and Key Agreement in IoT. IEEE Embed. Syst. Lett. 16(2): 118-121 (2024)- 2023
- [j7]Satyabrat Rath, Jothi Rangasamy:
Privacy-Preserving Outsourcing Algorithm for Solving Large Systems of Linear Equations. SN Comput. Sci. 4(5): 656 (2023) - 2022
- [j6]Dillibabu Shanmugam, Jothi Rangasamy:
Robust message authentication in the context of quantum key distribution. Int. J. Inf. Comput. Secur. 18(3/4): 365-382 (2022) - 2021
- [j5]K. S. Suvidha, Jothi Rangasamy, Shyam S. Kamath, Cheng-Chi Lee:
ES-HAS: ECC-Based Secure Handover Authentication Scheme for Roaming Mobile User in Global Mobility Networks. Cryptogr. 5(4): 35 (2021) - [j4]Jothi Rangasamy:
On "Practical and secure outsourcing algorithms for solving quadratic congruences in IoTs" from IEEE IoT journal. Discret. Appl. Math. 302: 139-146 (2021)
2010 – 2019
- 2018
- [c12]Jothi Rangasamy, Lakshmi Kuppusamy:
Revisiting Single-Server Algorithms for Outsourcing Modular Exponentiation. INDOCRYPT 2018: 3-20 - [c11]Osmanbey Uzunkol, Jothi Rangasamy, Lakshmi Kuppusamy:
Hide the Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT. ISC 2018: 250-267 - [i6]Osmanbey Uzunkol, Jothi Rangasamy, Lakshmi Kuppusamy:
Hide The Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT. IACR Cryptol. ePrint Arch. 2018: 644 (2018) - [i5]Jothi Rangasamy, Lakshmi Kuppusamy:
Revisiting Single-server Algorithms for Outsourcing Modular Exponentiation. IACR Cryptol. ePrint Arch. 2018: 1053 (2018) - 2017
- [j3]Jothi Rangasamy, Lakshmi Kuppusamy, Gopi Krishnan, Velmurugan:
Evaluation of puzzle-enabled proxy-assisted denial-of-service protection for web services. Int. J. Inf. Comput. Secur. 9(1/2): 114-129 (2017) - 2016
- [j2]M. Prem Laxman Das, Jothi Rangasamy, R. Kabaleeshwaran:
Refined Shacham-Waters ring signature scheme in Seo-Cheon framework. Secur. Commun. Networks 9(13): 2122-2134 (2016) - [c10]Lakshmi Kuppusamy, Jothi Rangasamy:
CRT-Based Outsourcing Algorithms for Modular Exponentiations. INDOCRYPT 2016: 81-98 - [c9]Ravikumar Selvam, Dillibabu Shanmugam, Suganya Annadurai, Jothi Rangasamy:
Decomposed S-Boxes and DPA Attacks: A Quantitative Case Study Using PRINCE. SPACE 2016: 179-193 - [i4]Ravikumar Selvam, Dillibabu Shanmugam, Suganya Annadurai, Jothi Rangasamy:
Decomposed S-Boxes and DPA Attacks: A Quantitative Case Study using PRINCE. IACR Cryptol. ePrint Arch. 2016: 630 (2016) - 2014
- [c8]Lakshmi Kuppusamy, Jothi Rangasamy, Praveen Gauravaram:
On secure outsourcing of cryptographic computations to cloud. SCC@ASIACCS 2014: 63-68 - 2013
- [j1]Juan Manuel González Nieto, Mark Manulis, Bertram Poettering, Jothi Rangasamy, Douglas Stebila:
Publicly verifiable ciphertexts. J. Comput. Secur. 21(5): 749-778 (2013) - 2012
- [c7]Jothi Rangasamy, Douglas Stebila, Colin Boyd, Juan Manuel González Nieto, Lakshmi Kuppusamy:
Effort-Release Public-Key Encryption from Cryptographic Puzzles. ACISP 2012: 194-207 - [c6]Lakshmi Kuppusamy, Jothi Rangasamy, Douglas Stebila, Colin Boyd, Juan Manuel González Nieto:
Practical client puzzles in the standard model. AsiaCCS 2012: 42-43 - [c5]Juan Manuel González Nieto, Mark Manulis, Bertram Poettering, Jothi Rangasamy, Douglas Stebila:
Publicly Verifiable Ciphertexts. SCN 2012: 393-410 - [i3]Juan Manuel González Nieto, Mark Manulis, Bertram Poettering, Jothi Rangasamy, Douglas Stebila:
Publicly Verifiable Ciphertexts. IACR Cryptol. ePrint Arch. 2012: 357 (2012) - 2011
- [c4]Jothi Rangasamy, Douglas Stebila, Colin Boyd, Juanma González Nieto:
An integrated approach to cryptographic mitigation of denial-of-service attacks. AsiaCCS 2011: 114-123 - [c3]Douglas Stebila, Lakshmi Kuppusamy, Jothi Rangasamy, Colin Boyd, Juan Manuel González Nieto:
Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols. CT-RSA 2011: 284-301 - [c2]Jothi Rangasamy, Douglas Stebila, Lakshmi Kuppusamy, Colin Boyd, Juan Manuel González Nieto:
Efficient Modular Exponentiation-Based Puzzles for Denial-of-Service Protection. ICISC 2011: 319-331 - [c1]Lakshmi Kuppusamy, Jothi Rangasamy, Douglas Stebila, Colin Boyd, Juanma González Nieto:
Towards a Provably Secure DoS-Resilient Key Exchange Protocol with Perfect Forward Secrecy. INDOCRYPT 2011: 379-398 - [i2]Jothi Rangasamy, Douglas Stebila, Lakshmi Kuppusamy, Colin Boyd, Juan Manuel González Nieto:
Efficient Modular Exponentiation-based Puzzles for Denial-of-Service Protection. IACR Cryptol. ePrint Arch. 2011: 665 (2011) - 2010
- [i1]Douglas Stebila, Lakshmi Kuppusamy, Jothi Rangasamy, Colin Boyd, Juan Manuel González Nieto:
Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols. IACR Cryptol. ePrint Arch. 2010: 649 (2010)
Coauthor Index
aka: Juanma González Nieto
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
