| 2023 | CANS | Forward Security Under Leakage Resilience, Revisited. | Suvradip Chakraborty, Harish Karthikeyan, Adam O'Neill, C. Pandu Rangan |
| 2020 | INDOCRYPT | Efficient Attribute-Based Proxy Re-Encryption with Constant Size Ciphertexts. | Arinjita Paul, S. Sharmila Deva Selvi, C. Pandu Rangan |
| 2020 | ISNCC | Improving Accuracy of Differentially Private Kronecker Social Networks via Graph Clustering. | Arinjita Paul, Vorapong Suppakitpaisarn, Mitali Bafna, C. Pandu Rangan |
| 2019 | COCOON | Reoptimization of Path Vertex Cover Problem. | Mehul Kumar, Amit Kumar, C. Pandu Rangan |
| 2018 | ProvSec | A CCA-Secure Collusion-Resistant Identity-Based Proxy Re-Encryption Scheme. | Arinjita Paul, Varshika Srinivasavaradhan, S. Sharmila Deva Selvi, C. Pandu Rangan |
| 2017 | ACISP | Efficient Compilers for After-the-Fact Leakage: From CPA to CCA-2 Secure PKE to AKE. | Suvradip Chakraborty, Goutam Paul, C. Pandu Rangan |
| 2017 | ICICS | Identity-Based Group Encryption Revisited. | Kanika Gupta, S. Sharmila Deva Selvi, C. Pandu Rangan, Shubham Sopan Dighe |
| 2017 | ProvSec | Leakage-Resilient Non-interactive Key Exchange in the Continuous-Memory Leakage Setting. | Suvradip Chakraborty, Janaka Alawatugoda, C. Pandu Rangan |
| 2015 | CCS | Certificateless Proxy Re-Encryption Without Pairing: Revisited. | Akshayaram Srinivasan, C. Pandu Rangan |
| 2015 | ProvSec | Forward-Secure Authenticated Symmetric Key Exchange Protocol: New Security Model and Secure Construction. | Suvradip Chakraborty, Goutam Paul, C. Pandu Rangan |
| 2015 | SECRYPT | Practical IBE Secure under CBDH - Encrypting Without Pairing. | S. Sree Vivek, S. Sharmila Deva Selvi, Aanchal Malhotra, C. Pandu Rangan |
| 2014 | SECRYPT | Pairing-free Single Round Certificateless and Identity Based Authenticated Key Exchange Protocols. | Saikrishna Badrinarayanan, C. Pandu Rangan |
| 2013 | ICISC | A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory. | K. Preetha Mathew, Sachin Vasant, C. Pandu Rangan |
| 2013 | ICISC | Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model. | K. Preetha Mathew, Sachin Vasant, C. Pandu Rangan |
| 2013 | ProvSec | Efficient, Pairing-Free, Authenticated Identity Based Key Agreement in a Single Round. | S. Sree Vivek, S. Sharmila Deva Selvi, Layamrudhaa Renganathan Venkatesan, C. Pandu Rangan |
| 2012 | ACISP | An Efficient IND-CCA2 Secure Variant of the Niederreiter Encryption Scheme in the Standard Model. | K. Preetha Mathew, Sachin Vasant, Sridhar Venkatesan, C. Pandu Rangan |
| 2012 | ACISP | Deterministic Identity Based Signature Scheme and Its Application for Aggregate Signatures. | S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan |
| 2012 | ISPEC | A Code-Based 1-out-of-N Oblivious Transfer Based on McEliece Assumptions. | K. Preetha Mathew, Sachin Vasant, Sridhar Venkatesan, C. Pandu Rangan |
| 2012 | IWSEC | Compact Stateful Encryption Schemes with Ciphertext Verifiability. | S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan |
| 2012 | LATIN | Cache Me If You Can: Capacitated Selfish Replication Games. | Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram |
| 2012 | ProvSec | ID Based Signcryption Scheme in Standard Model. | S. Sharmila Deva Selvi, S. Sree Vivek, Dhinakaran Vinayagamurthy, C. Pandu Rangan |
| 2012 | WISTP | Optimal Parameters for Efficient Two-Party Computation Protocols. | Chaya Ganesh, C. Pandu Rangan |
| 2011 | IWSEC | Identity-Based Deterministic Signature Scheme without Forking-Lemma. | S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan |
| 2011 | VCIP | Bit-depth scalable video coding using error residual correction. | R. Shyam Sundar, C. Pandu Rangan |
| 2011 | SECRYPT | CCA Secure Certificateless Encryption Schemes based on RSA. | S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan |
| 2011 | WALCOM | A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs. | Esha Ghosh, N. S. Narayanaswamy, C. Pandu Rangan |
| 2010 | ASIACRYPT | The Round Complexity of Verifiable Secret Sharing: The Statistical Case. | Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan |
| 2010 | ICDCN | On Composability of Reliable Unicast and Broadcast. | Anuj Gupta, Sandeep Hans, Kannan Srinathan, C. Pandu Rangan |
| 2010 | ICDCN | On Communication Complexity of Secure Message Transmission in Directed Networks. | Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2010 | ISPEC | Game Theoretic Resistance to Denial of Service Attacks Using Hidden Difficulty Puzzles. | Harikrishna Narasimhan, Venkatanathan Varadarajan, C. Pandu Rangan |
| 2010 | ISPEC | Certificateless KEM and Hybrid Signcryption Schemes Revisited. | S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan |
| 2010 | NSS | Identity Based Self Delegated Signature - Self Proxy Signatures. | S. Sharmila Deva Selvi, S. Sree Vivek, S. Gopi Nath, C. Pandu Rangan |
| 2010 | PODC | Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity. | Arpita Patra, Ashish Choudhury, C. Pandu Rangan |
| 2010 | PODC | Brief announcement: communication efficient asynchronous byzantine agreement. | Arpita Patra, C. Pandu Rangan |
| 2010 | ProvSec | Identity Based Public Verifiable Signcryption Scheme. | S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan |
| 2010 | SECRYPT | Forcing Out a Confession - Threshold Discernible Ring Signatures. | Swarun Kumar, Shivank Agrawal, Ramarathnam Venkatesan, Satyanarayana V. Lokam, C. Pandu Rangan |
| 2010 | SECRYPT | An Identity based Ring Signcryption Scheme with Public Verifiability. | S. Sharmila Deva Selvi, S. Sree Vivek, Sakhi S. Anand, C. Pandu Rangan |
| 2010 | WALCOM | Pathwidth and Searching in Parameterized Threshold Graphs. | D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shashank, C. Pandu Rangan |
| 2010 | WALCOM | Variants of Spreading Messages. | T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan |
| 2009 | CANS | Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security. | G. Sathya Narayanan, T. Aishwarya, Anugrah Agrawal, Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2009 | CCS | Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary. | Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2009 | CRYPTO | The Round Complexity of Verifiable Secret Sharing Revisited. | Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan |
| 2009 | ICDCN | On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. | Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan |
| 2009 | INDOCRYPT | Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience. | Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2009 | INDOCRYPT | Identity Based Aggregate Signcryption Schemes. | S. Sharmila Deva Selvi, S. Sree Vivek, J. Shriram, S. Kalaivani, C. Pandu Rangan |
| 2009 | IWOCA | The Guarding Problem - Complexity and Approximation. | T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan |
| 2009 | PODC | Simple and efficient asynchronous byzantine agreement with optimal resilience. | Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2009 | PODC | Brief announcement: perfectly secure message transmission in directed networks re-visited. | Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2009 | ProvSec | Breaking and Fixing of an Identity Based Multi-Signcryption Scheme. | S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan |
| 2009 | SECRYPT | On the Security of Two Ring Signcryption Schemes. | S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan |
| 2009 | SecureComm | Breaking and Building of Group Inside Signature. | S. Sree Vivek, S. Sharmila Deva Selvi, S. Gopi Nath, C. Pandu Rangan |
| 2009 | WALCOM | Core and Conditional Core Path of Specified Length in Special Classes of Graphs. | Balasubramanian Sivan, S. Harini, C. Pandu Rangan |
| 2008 | ACISP | Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary. | Arpita Patra, Ashish Choudhary, Madhu Vaidyanathan, C. Pandu Rangan |
| 2008 | CANS | Unconditionally Reliable Message Transmission in Directed Hypergraphs. | Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2008 | EUC | Cryptanalysis of Li et al.'s Identity-Based Threshold Signcryption Scheme. | S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan, Neha Jain |
| 2008 | ICDCN | Alternative Protocols for Generalized Oblivious Transfer. | Bhavani Shankar, Kannan Srinathan, C. Pandu Rangan |
| 2008 | ICDCN | On Optimal Probabilistic Asynchronous Byzantine Agreement. | Amjed Shareef, C. Pandu Rangan |
| 2008 | INDOCRYPT | Round Efficient Unconditionally Secure Multiparty Computation Protocol. | Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2008 | ISPEC | Rational Secret Sharing with Repeated Games. | Shaik Maleka, Amjed Shareef, C. Pandu Rangan |
| 2008 | IWOCA | On Conditional Covering Problem. | Balasubramanian Sivan, S. Harini, C. Pandu Rangan |
| 2008 | PODC | On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary. | B. V. Ashwinkumar, Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan |
| 2008 | PODC | Efficient single phase unconditionally secure message transmission with optimum communication complexity. | Kannan Srinathan, Ashish Choudhary, Arpita Patra, C. Pandu Rangan |
| 2008 | ProvSec | Efficient and Provably Secure Certificateless Multi-receiver Signcryption. | S. Sharmila Deva Selvi, S. Sree Vivek, Deepanshu Shukla, C. Pandu Rangan |
| 2008 | PST | Cryptanalysis of Bohio et al.'s ID-Based Broadcast Signcryption (IBBSC) Scheme for Wireless Ad-Hoc Networks. | S. Sharmila Deva Selvi, S. Sree Vivek, Naga Naresh Karuturi, Ragavendran Gopalakrishnan, C. Pandu Rangan |
| 2008 | SODA | Unconditionally reliable message transmission in directed networks. | Bhavani Shankar, Prasant Gopal, Kannan Srinathan, C. Pandu Rangan |
| 2008 | SCN | Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited. | Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2008 | WISA | Cryptanalysis of Mu et al.'s and Li et al.'s Schemes and a Provably Secure ID-Based Broadcast Signcryption (IBBSC) Scheme. | S. Sharmila Deva Selvi, S. Sree Vivek, Ragavendran Gopalakrishnan, Naga Naresh Karuturi, C. Pandu Rangan |
| 2007 | ACISP | On Proactive Perfectly Secure Message Transmission. | Kannan Srinathan, Prasad Raghavendra, C. Pandu Rangan |
| 2007 | ADMA | Privacy Preserving DBSCAN Algorithm for Clustering. | K. Anil Kumar, C. Pandu Rangan |
| 2007 | ADMA | Privacy Preserving BIRCH Algorithm for Clustering over Arbitrarily Partitioned Databases. | P. Krishna Prasad, C. Pandu Rangan |
| 2007 | CANS | Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary. | Arpita Patra, Bhavani Shankar, Ashish Choudhary, K. Srinathan, C. Pandu Rangan |
| 2007 | INDOCRYPT | Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality. | Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan |
| 2007 | PDPTA | Efficient Protocol For Approximate Agreement. | Amjed Shareef, C. Pandu Rangan |
| 2007 | SP | On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication. | Kannan Srinathan, N. R. Prasad, C. Pandu Rangan |
| 2006 | INDOCRYPT | Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission. | Arpita Patra, Ashish Choudhary, K. Srinathan, C. Pandu Rangan |
| 2006 | PODC | Possibility and complexity of probabilistic reliable communication in directed networks. | Kannan Srinathan, C. Pandu Rangan |
| 2006 | SPAA | Playing push vs pull: models and algorithms for disseminating dynamic data in networks. | R. C. Chakinala, Abishek Kumarasubramanian, Kofi A. Laing, R. Manokaran, C. Pandu Rangan, Rajmohan Rajaraman |
| 2006 | TCC | Round-Optimal and Efficient Verifiable Secret Sharing. | Matthias Fitzi, Juan A. Garay, Shyamnath Gollakota, C. Pandu Rangan, K. Srinathan |
| 2004 | CRYPTO | Optimal Perfectly Secure Message Transmission. | K. Srinathan, Arvind Narayanan, C. Pandu Rangan |
| 2004 | PODC | Brief announcement: on the round complexity of distributed consensus over synchronous networks. | D. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan |
| 2003 | ACISP | Practical Pay TV Schemes. | Arvind Narayanan, C. Pandu Rangan, Kwangjo Kim |
| 2003 | INDOCRYPT | On the Power of Computational Secret Sharing. | Vinod Vaikuntanathan, Arvind Narayanan, K. Srinathan, C. Pandu Rangan, Kwangjo Kim |
| 2003 | PODC | Distributed consensus in the presence of sectional faults. | S. Amitanand, I. Sanketh, K. Srinathan, Vinod Vaikuntanathan, C. Pandu Rangan |
| 2003 | PODC | Brief announcement: efficient perfectly secure communication over synchronous networks. | K. Srinathan, Vinod Vaikuntanathan, C. Pandu Rangan |
| 2002 | ACISP | Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries. | M. V. N. Ashwin Kumar, K. Srinathan, C. Pandu Rangan |
| 2002 | ASIACRYPT | Asynchronous Secure Communication Tolerating Mixed Adversaries. | K. Srinathan, M. V. N. Ashwin Kumar, C. Pandu Rangan |
| 2002 | COCOON | Theory of Equal-Flows in Networks. | K. Srinathan, Pranava R. Goundan, M. V. N. Ashwin Kumar, R. Nandakumar, C. Pandu Rangan |
| 2002 | INDOCRYPT | Asynchronous Unconditionally Secure Computation: An Efficiency Improvement. | B. Prabhu, K. Srinathan, C. Pandu Rangan |
| 2002 | INDOCRYPT | Non-perfect Secret Sharing over General Access Structures. | K. Srinathan, N. Tharani Rajan, C. Pandu Rangan |
| 2002 | PODC | On perfectly secure cmmunication over arbitrary networks. | M. V. N. Ashwin Kumar, Pranava R. Goundan, K. Srinathan, C. Pandu Rangan |
| 2002 | SCN | Trading Players for Efficiency in Unconditional Multiparty Computation. | B. Prabhu, K. Srinathan, C. Pandu Rangan |
| 2001 | INDOCRYPT | Toward Optimal Player Weights in Secure Distributed Protocols. | K. Srinathan, C. Pandu Rangan, V. Kamakoti |
| 2000 | INDOCRYPT | Efficient Asynchronous Secure Multiparty Distributed Computation. | K. Srinathan, C. Pandu Rangan |
| 2000 | INDOCRYPT | Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation. | K. Srinathan, C. Pandu Rangan |
| 1998 | COCOON | The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries. | Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. Pandu Rangan |
| 1998 | WG | The Vertex-Disjoint Triangles Problem. | Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong |
| 1997 | HiPC | An optimal parallel algorithm for the all-nearest-foreign-neighbors problem in arbitrary dimensions. | Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. Pandu Rangan |
| 1995 | COCOON | Efficient Randomized Incremental Algorithm For The Closest Pair Problem Using Leafary Trees. | V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan |
| 1994 | ISAAC | Edge-Disjoint Paths in Permutation Graphs. | C. P. Gopalakrishnan, C. Pandu Rangan |
| 1994 | ISAAC | Weighted Irredundance of Interval Graphs. | C. Pandu Rangan, Maw-Shang Chang |
| 1993 | ISAAC | Weighted Independent Perfect Domination on Cocomparability Graphs. | Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg |
| 1993 | WADS | Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs. | Hari Balakrishnan, Anand Rajaraman, C. Pandu Rangan |
| 1991 | WADS | Treewidth of Circular-Arc Graphs (Abstract). | Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan |
| 1990 | ICPP | Parallel Algorithms on Interval Graphs. | G. D. S. Ramkumar, C. Pandu Rangan |
| 1989 | WADS | Linear Algorithms for Parity Path and Two Path Problems on Circular-Arc Graph. | A. Srinivasa Rao, C. Pandu Rangan |
| 1987 | WG | Competitive Location in the L | Ramesh Govindan, C. Pandu Rangan |
| 1986 | WG | A Simple Implementation of Warshall's Algorithm on a VLSI Chip. | Ramesh Dewangan, C. Pandu Rangan |