Disclaimer : This page lists only the information about the individual member relevant to the theory group activities. Please visit the individual's page (using the link above) for broader profile information.
Research InterestsCryptography and Security Protocols, Graph theory, Computational Geometry, Randomized and Parallel Algorithms..Moved to:New research group (within CSE IITM) on Cryptography Cybersecurity and Distributed Trust. |
Teaching Actvities (while with the theory group - since Jan 2011)
- Design and Analysis of Algorithms - Jan-May, 2020
- Foundations of Cryptography - Jul-Nov, 2019
- Foundations of Blockchain Technology - Jan-May, 2019
- Topics in Design and Analysis of Algorithms - Jul-Nov, 2018
- Discrete Mathematics for Computer Science - Jan-May, 2018
- Data Structures and Algorithms - Jan-May, 2015
- Foundations of Cryptography - Jan-May, 2015
- Topics in Design and Analysis of Algorithms - Jul-Nov, 2014
- Data Structures & Algorithms - Jan-Apr, 2014
- Topics in Design and Analysis of Algorithms - Jul-Nov, 2013
- Advanced Data Structures & Algorithms - Jul-Nov, 2013
- Data Structures & Algorithms - Jan-Apr, 2013
- Recent Developments in Theoretical Computer Science - Jul-Nov, 2012
Publications (while with the group, last 10)
See here for all publications while at IITM
- Asynchronous Byzantine Agreement with Optimal Resilience
Authors: Arpita Patra, Ashish Choudhary, C. Pandu Rangan
Distributed Computing, Vol 27, No.2, pp.111-146, Apr 2014 - Anonymous Identity-Based Identification Scheme in Ad-Hoc Groups without Pairings
Authors: Prateek Barapatre, C. Pandu Rangan
Security, Privacy, and Applied Cryptography Engineering - Third International Conference (SPACE 2013), Oct 2013 - Identity-Based Identification Schemes from ID-KEMs
Authors: Prateek Barapatre, C. Pandu Rangan
Security, Privacy, and Applied Cryptography Engineering - Third International Conference (SPACE 2013), Oct 2013 - On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission
Authors: Ashwinkumar B.V., Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan
Journal of the Association of Computing Machinery (JACM), Vol 59, No.5, pp.22, Sep 2012 - Cache Me If You Can: Capacitated Selfish Replication Games.
Authors: Raghavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram
10th Latin American Symposium on Theoretical Informatics (LATIN 2012), Lecture Notes in Computer Science, Vol 7256, pp.420-432, Aug 2012 - A Code-Based 1-out-of-N Oblivious Transfer Based on McEliece Assumptions
Authors: Preetha Mathew K, Sachin Vasant, Sridhar Venkatesan, C. Pandu Rangan
8th International Conference on Information Security Practice and Experience (ISPEC 2012), Lecture Notes in Computer Science, Vol 7232, pp.144-157, Aug 2012 - An Efficient IND-CCA2 Secure Variant of the Niederreiter Encryption Scheme in the Standard Model
Authors: Preetha Mathew K, Sachin Vasant, Sridhar Venkatesan, C. Pandu Rangan
17th Australasian Conference on Information Security and Privacy (ACISP 2012), Lecture Notes in Computer Science, Vol 7372, pp.166-179, Jul 2012 - Optimal Parameters for Efficient Two-Party Computation Protocols
Authors: Chaya Ganesh, C. Pandu Rangan
International Workshop on Information Security Theory and Practice (WISTP 2012), Lecture Notes in Computer Science, Vol 7332, pp.128--143, Jun 2012 - A New Approach to Threshold Attribute Based Signatures
Authors: Sharmila Deva Selvi S., Subhashini Venugopalan, C. Pandu Rangan
Manuscript, Jun 2011 - A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs
Authors: Esha Ghosh, Narayanaswamy N S, C. Pandu Rangan
5th International Workshop on Algorithms and Computation (WALCOM 2011), Lecture Notes in Computer Science, Vol 6552, pp.191-201, Feb 2011