Dr. R. Kabaleeshwaran

Dr. R. KABALEESHWARAN, PhD

Assistant Professor,

Department of Computer Science and Engineering,

IIITDM Kurnool.

Email: kabaleesh@iiitk.ac.in


Educational Qualifications

  • Ph.D. in Computer Science and Engineering from Indian Institute of Science, Bangalore.

  • M.Tech (IT) from The School of Computer and Information Sciences (SCIS), University of Hyderabad.

  • M.Sc. (Mathematics), School of Mathematics, Madurai Kamaraj University, Madurai

  • B.Sc. (Mathematics), Department of Mathematics, Gandhigram Rural Institute (Deemed University), Dindigul

Areas of Interest/Specialization

  • Broadly working on Cryptography. In particular, Cryptographic Protocols, Post Quantum Cryptography and Blockchain Application 

  • I am interested in working on exotic signature schemes, privacy-preserving cryptography and zero-knowledge proof systems.

Professional /Teaching Experience

  • Research Associate in Dept. of CSA, IISc.

  • Senior Research Fellow, C.R. Rao AIMSCS, Hyderabad.

Publication Profiles

Projects

  • MeitY, GoI Sponsored Project:     

    • Title :Development of Secure Post Quantum Public Key Infrastructure
      A multi-institutional research project along with IIT Madras, SETS Chennai,CDAC Bangalore and CDAC Noida.

    • IIIT Kurnool budget is Rs. 76.37 lakhs.

    • Our Role: To develop post-quantum signatures in the lattice-setting and analyze its security.

    • Openings: Looking for Research Associate, Junior Research Fellow and Project Associate positions. Interested candidates can mail me.

Research Publications

  List of International Journal:

  • Sanjit Chatterjee, M. Prem Laxman Das and R. Kabaleeshwaran, “Converting pairing-based cryptosystems from composite to prime order setting - a comparative analysis”, Journal of Mathematical Cryptology, 2018. [Scopus]

  • M. Prem Laxman Das, Jothi Rangasamy and R. Kabaleeshwaran, “Refined Shacham Waters ring signature scheme in Seo-Cheon framework”, Journal of Secure Communication Networks, 2016. [SCI]

Peer Reviewed Conferences:

  • R. Kabaleeshwaran and Bachala Khandava Kishan#, “Efficient Revocable Linkable Ring Signatures" accepted in INDOCRYPT 2024 [25th International Conference on Cryptology in India, Chennai] (#Work done during his M.Tech. Final Year project)

  • R. Kabaleeshwaran and P.V. Shanmukh Sai*, “Synchronized Aggregate Signature under Standard Assumption in the Random Oracle Model", INDOCRYPT 2023 [24th International Conference on Cryptology in India, Goa]. (*Work done during his BTech Final Year project)

  • Sanjit Chatterjee and R. Kabaleeshwaran, “Towards Static Assumption Based Cryptosystem in Pairing Setting: Further Applications of Déjà Q and Dual-Form Signature”, ProvSec 2018 [12th International Conference on Provable Security, Jeju Island, Republic of Korea].

  • Sanjit Chatterjee and R. Kabaleeshwaran, “Rerandomizable signatures under standard assumption”, INDOCRYPT 2019 [20th International Conference on Cryptology in India, Hyderabad].

  • Sanjit Chatterjee and R. Kabaleeshwaran, “From rerandomizability to sequential aggregation: Efficient signature schemes based on SXDH assumption”, ACISP 2020 [25th Australasian Conference on Information Security and Privacy, Perth, Australia]. 

Talks

  • Presented “Synchronized Aggregate Signature under Standard Assumption in the Random Oracle Model” in INDOCRYPT 2023. 

  • Presented “From rerandomizability to sequential aggregation: Efficient signature schemes based on SXDH assumption” in ACISP 2020. (30 November 2020)

  • Presented “Rerandomizable signatures under standard assumption”, in INDOCRYPT 2019. (17 December 2019)

  •  Presented “Converting cryptographic schemes from composite-order to prime-order pairing”, in EECS Symposium, 2017 at IISc. (7 April 2017)

Courses Handled: 

  • Cryptography and Network Security (B.Tech. )

  • Blockchain Design and Architecture (B.Tech.)

  • Discrete Mathematics (B.Tech.)

  • Theory of Computation (B.Tech.)

  • Statistical Learning (M.Tech.)

  • Data Privacy (M.Tech.)

  • Design and Analysis of Algorithms (B.Tech.)

  • Mathematical Foundations for Computer Science (M.Tech.)