World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
34
Citations
4208
World Ranking
12273
National Ranking
141

Research.com Recognitions

  • Fellow of the Indian National Academy of Engineering (INAE)
  • Fellow of the Indian National Academy of Engineering (INAE)

Overview

C. Pandu Rangan is affiliated with the Indian Institute of Technology Madras in India. Their research primarily spans the field of Computer Science, with specific contributions to Artificial Intelligence, Computational Theory and Mathematics, Information Systems, and Computer Networks and Communications. Additionally, they have published work intersecting with Social Sciences and Sociology and Political Science.

The scientist's published works include papers in venues such as IET Information Security, Journal of Information Security and Applications, and the International Journal of Computer Mathematics Computer Systems Theory. Some of the recent papers include:

  • Lattice-based unidirectional Proxy Re-Encryption and Proxy Re-Encryption + schemes (2020), IET Information Security
  • Provably secure lattice based identity based unidirectional PRE and PRE + schemes (2020), Journal of Information Security and Applications
  • Efficient single round attribute-based authenticated key exchange protocol (2021), International Journal of Computer Mathematics Computer Systems Theory

Their body of work focuses extensively on topics related to cryptography and data security, with significant publications covering:

  • Cryptography and Data Security
  • Privacy-Preserving Technologies in Data
  • Complexity and Algorithms in Graphs
  • Cryptographic Implementations and Security
  • Privacy, Security, and Data Protection
  • Cryptography and Residue Arithmetic
  • Physical Unclonable Functions (PUFs) and Hardware Security

Frequent collaborators in their research include Arinjita Paul, S. Sharmila Deva Selvi, Kunwar Singh, Samir Sheshank, and Richa Agrawal. These coauthors have appeared together in multiple publications, indicating ongoing collaboration in related research areas.

The scientist has been recognized as a Fellow of the Indian National Academy of Engineering (INAE), reflecting their standing in the engineering and research community in India.

Best Publications

  • A unified approach to domination problems on interval graphs

    G. Ramalingam;C. Pandu Rangan

  • Linear algorithm for optimal path cover problem on interval graphs

    S. Rao Arikati;C. Pandu Rangan

  • Algorithmic aspects of clique-transversal and clique-independent sets

    Venkatesan Guruswami;C.Pandu Rangan

  • On perfectly secure communication over arbitrary networks

    M V N Ashwin Kumar;Pranava R. Goundan;K Srinathan;C. Pandu Rangan

  • Optimal Perfectly Secure Message Transmission

    K. Srinathan;Arvind Narayanan;C. Pandu Rangan

  • Rational secret sharing with repeated games

    Shaik Maleka;Amjed Shareef;C. Pandu Rangan

  • Round-Optimal and efficient verifiable secret sharing

    Matthias Fitzi;Juan Garay;Shyamnath Gollakota;C. Pandu Rangan

  • Progress in Cryptology – INDOCRYPT 2007

    K. Srinathan;C. Pandu Rangan;Moti Yung

  • Tree 3-spanners on interval, permutation and regular bipartite graphs

    M. S. Madanlal;G. Venkatesan;C. Pandu Rangan

  • Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction Without Pairing.

    S. Sharmila Deva Selvi;S. Sree Vivek;C. Pandu Rangan

  • Cryptanalysis of certificateless signcryption schemes and an efficient construction without pairing

    S. Sharmila Deva Selvi;S. Sree Vivek;C. Pandu Rangan

  • Clique transversal and clique independence on comparability graphs

    V. Balachandran;P. Nagavamsi;C. Pandu Rangan

  • Restrictions of minimum spanner problems

    G. Venkatesan;U. Rotics;M. S. Madanlal;J. A. Makowsky

  • Treewidth of Circular-Arc Graphs

    Ravi Sundaram;Karan Sher Singh;C. Pandu Rangan

  • Optimal path cover problem on block graphs and bipartite permutation graphs

    R. Srikant;Ravi Sundaram;Karan Sher Singh;C. Pandu Rangan

  • Identity Based Aggregate Signcryption Schemes

    S. Sharmila Selvi;S. Sree Vivek;J. Shriram;S. Kalaivani

  • Steganographic communication in ordered channels

    R. C. Chakinala;A. Kumarasubramanian;R. Manokaran;G. Noubir

  • The Round Complexity of Verifiable Secret Sharing Revisited

    Arpita Patra;Ashish Choudhary;Tal Rabin;C. Pandu Rangan

  • Weighted independent perfect domination on cocomparability graphs

    Gerard J. Chang;C. Pandu Rangan;Satyan R. Coorg

  • Edge domination on bipartite permutation graphs and cotriangulated graphs

    Anand Srinivasan;K. Madhukar;P. Nagavamsi;C. Pandu Rangan

  • On the Power of Computational Secret Sharing

    V. Vinod;Arvind Narayanan;K. Srinathan;C. Pandu Rangan

  • The Round Complexity of Verifiable Secret Sharing: The Statistical Case

    Ranjit Kumaresan;Arpita Patra;C. Pandu Rangan

Frequent Co-Authors

Kunwar P. Singh
Kunwar P. Singh National Institute of Technology Tiruchirappalli
Ravi Sundaram
Ravi Sundaram Northeastern University
Swarun Kumar
Swarun Kumar Carnegie Mellon University
Venkatesan Guruswami
Venkatesan Guruswami University of California, Berkeley
Arvind Narayanan
Arvind Narayanan Princeton University
Gerard J. Chang
Gerard J. Chang National Taiwan University
Rajmohan Rajaraman
Rajmohan Rajaraman Northeastern University
Ramarathnam Venkatesan
Ramarathnam Venkatesan Microsoft (United States)
Karan Singh
Karan Singh University of Toronto
Venkatesh Raman
Venkatesh Raman Indian Institute of Technology Palakkad

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Expanding your options after studying Computer Science in the USA is easier than ever through flexible online programs and certifications. For those interested in applied technology, you can broaden your expertise with an online bachelor’s in electrical engineering, which offers a strong foundation in both hardware and software systems.

If you’re looking for quick and effective ways to boost your credentials, consider exploring easy licenses and certifications to get. These can offer a fast track to higher-paying tech roles without the need for years of additional study.

Already have your bachelor’s degree? You might consider quick masters degrees online to accelerate your advancement. These programs can often be completed in a year or less, helping you move up the career ladder efficiently.

For long-term career growth, focusing on the best masters degree to get can maximize your earning potential and open doors to leadership opportunities in high-demand industries.

Best Scientists Citing C. Pandu Rangan

Trending Scientists

Recently Published Articles