C. Pandu Rangan

发表

Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries

K. Srinathan, C. Pandu Rangan, Ashwin Machanavajjhala, 2002, ACISP.

Practical Pay TV Schemes

C. Pandu Rangan, Arvind Narayanan, Kwangjo Kim, 2003, ACISP.

EFFICIENT CONDITIONAL PROXY RE- ENCRYPTION WITH CHOSEN CIPHER TEXT SECURITY

C. Pandu Rangan, S. Sree Vivek, S. Sharmila, 2012 .

Randomized Dictionary Structures

C. Pandu Rangan, 2004, Handbook of Data Structures and Applications.

Efficient Randomized Incremental Algorithm For The Closest Pair Problem Using Leafary Trees

C. Pandu Rangan, V. Kamakoti, Kamala Krithivasan, 1995, COCOON.

A Pairing-Free, One Round Identity Based Authenticated Key Exchange Protocol Secure Against Memory-Scrapers

C. Pandu Rangan, Suvradip Chakraborty, Srinivasan Raghuraman, 2016, J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl..

Leakage-Resilient Tweakable Encryption from One-Way Functions

C. Pandu Rangan, Chester Rebeiro, Debdeep Mukhopadhyay, 2017, IACR Cryptol. ePrint Arch..

Identity Based Aggregate Signcryption Schemes

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2009, INDOCRYPT.

Breaking and Building of Threshold Signcryption Schemes

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2009, Inscrypt.

Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2008, SCN.

Identity Based Online/Offline Encryption and Signcryption Schemes Revisited

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2011, InfoSecHiComNet.

Statistically Reliable and Secure Message Transmission in Directed Networks

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2008, IACR Cryptol. ePrint Arch..

Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction without Pairing

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2009, Inscrypt.

Symmetric Min-Max Heap: A Simpler Data Structure for Double-Ended Priority Queue

C. Pandu Rangan, A. Arvind, C. Rangan, 1999, Inf. Process. Lett..

The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries

C. Pandu Rangan, V. Kamakoti, Thomas Graf, 1998, COCOON.

Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary

K. Srinathan, C. Pandu Rangan, Bhavani Shankar, 2007, CANS.

Information Theoretically Secure Multi Party Set Intersection Re-Visited

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2009, IACR Cryptol. ePrint Arch..

A Special Purpose Signature Scheme for Secure Computation of Traffic in a Distributed Network

C. Pandu Rangan, Ramarathnam Venkatesan, S. Sree Vivek, 2012, J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl..

Algorithms and Computation

C. Pandu Rangan, Alok Aggarwal, 2000, Lecture Notes in Computer Science.

Provably secure lattice based identity based unidirectional PRE and PRE+ schemes

C. Pandu Rangan, Kunwar Singh, Richa Agrawal, 2020, J. Inf. Secur. Appl..

On the Security of ID Based Signcryption Schemes

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2011, IACR Cryptol. ePrint Arch..

Efficient, Pairing-Free, One Round Attribute-Based Authenticated Key Exchange

C. Pandu Rangan, Suvradip Chakraborty, Srinivasan Raghuraman, 2015, IACR Cryptol. ePrint Arch..

Efficiently Obfuscating Re-Encryption Program Under DDH Assumption

C. Pandu Rangan, Akshayaram Srinivasan, C. P. Rangan, 2017, ACNS.

Efficient Protocol For Approximate Agreement

C. Pandu Rangan, Amjed Shareef, 2007, PDPTA.

Optimal Parameters for Efficient Two-Party Computation Protocols

C. Pandu Rangan, Chaya Ganesh, 2012, WISTP.

Alternative Protocols for Generalized Oblivious Transfer

K. Srinathan, C. Pandu Rangan, Bhavani Shankar, 2008, ICDCN.

Flaw in the Security Analysis of Leakage-resilient Authenticated Key Exchange Protocol from CT-RSA 2016 and Restoring the Security Proof

C. Pandu Rangan, Goutam Paul, Suvradip Chakraborty, 2016, IACR Cryptol. ePrint Arch..

Certificateless KEM and Hybrid Signcryption Schemes Revisited

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2010, ISPEC.

Spatiogram Based Fast Mode Decision in Spatial Scalable Video Coding

C. Pandu Rangan, R. Shyam Sundar, 2010, PCM.

Threshold Discernible Ring Signatures

C. Pandu Rangan, Swarun Kumar, Satyanarayana V. Lokam, 2010, ICETE.

Identity Based Self Delegated Signature - Self Proxy Signatures

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2010, 2010 Fourth International Conference on Network and System Security.

On Composability of Reliable Unicast and Broadcast

K. Srinathan, C. Pandu Rangan, Sandeep Hans, 2010, ICDCN.

Certificateless Proxy Re-Encryption Without Pairing

C. Pandu Rangan, Akshayaram Srinivasan, 2014, IACR Cryptol. ePrint Arch..

Efficient Lattice HIBE in the Standard Model with Shorter Public Parameters

C. Pandu Rangan, A. K. Banerjee, Kunwar Singh, 2014, ICT-EurAsia.

The Kr-Packing Problem

C. Pandu Rangan, Venkatesan Guruswami, Chak-Kuen Wong, 2001, Computing.

Efficient Parallel Shuffle Recognition

C. Pandu Rangan, Ahmed Saoudi, Maurice Nivat, 1994, Parallel Process. Lett..

Optimal Parallel Algorithms on Circular-Arc Graphs

C. Pandu Rangan, A. Srinivasa Rao, 1989, Inf. Process. Lett..

On the Power of Computational Secret Sharing

K. Srinathan, C. Pandu Rangan, Arvind Narayanan, 2003, INDOCRYPT.

Optimal Parallel Algorithms on Circular-Arc Graphs

C. Pandu Rangan, A. Srinivasa Rao, 1989, FSTTCS.

On the Fault Tolerance and Hamiltonicity of the Optical Transpose Interconnection System of Non-Hamiltonian Base Graphs pdf

C. Pandu Rangan, Esha Ghosh, Subhas Kumar Ghosh, 2011, ArXiv.

Leakage-Resilient Non-interactive Key Exchange in the Continuous-Memory Leakage Setting

C. Pandu Rangan, Janaka Alawatugoda, Suvradip Chakraborty, 2017, ProvSec.

Efficient Certificateless Online/Offline Signature with tight security

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2013, J. Internet Serv. Inf. Secur..

Algorithmic aspects of clique-transversal and clique-independent sets

C. Pandu Rangan, Venkatesan Guruswami, V. Guruswami, 2000, Discret. Appl. Math..

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science

C. Pandu Rangan, R. Ramanujam, Venkatesh Raman, 1999 .

Perfectly Secure Message Transmission Tolerating Mixed Adversary

K. Srinathan, C. Pandu Rangan, Ashish Choudhury, 2008, IACR Cryptol. ePrint Arch..

Breaking and Building of Group Inside Signature

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2009, SecureComm.

Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs

C. Pandu Rangan, Anand Srinivasan, Maw-Shang Chang, 1995, Inf. Process. Lett..

Compact CCA-Secure Encryption with Ciphertext Verifiability

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2011, IACR Cryptol. ePrint Arch..

Computational Logistics

C. Pandu Rangan, Takeo Kanade, Alfred Kobsa, 2012, Lecture Notes in Computer Science.

On perfectly secure communication over arbitrary networks

K. Srinathan, C. Pandu Rangan, Ashwin Machanavajjhala, 2002, PODC '02.

Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2009, Inscrypt.

Game Theoretic Resistance to Denial of Service Attacks Using Hidden Difficulty Puzzles

C. Pandu Rangan, Harikrishna Narasimhan, Venkatanathan Varadarajan, 2010, ISPEC.

Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality

K. Srinathan, C. Pandu Rangan, Ashish Choudhury, 2007, INDOCRYPT.

Lattice Based Identity Based Proxy Re-Encryption Scheme

C. Pandu Rangan, A. K. Banerjee, Kunwar Singh, 2013, J. Internet Serv. Inf. Secur..

Weighted Independent Perfect Domination on Cocomparability Graphs

C. Pandu Rangan, Gerard J. Chang, Satyan R. Coorg, 1993, ISAAC.

On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication

K. Srinathan, C. Pandu Rangan, N. R. Prasad, 2007, 2007 IEEE Symposium on Security and Privacy (SP '07).

Information Theoretic Security pdf

C. Pandu Rangan, William K. Moses, W. Moses, 2011, Lecture Notes in Computer Science.

CCA secure certificateless encryption schemes based on RSA

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2011, Proceedings of the International Conference on Security and Cryptography.

Scalable Compilers for Group Key Establishment : Two/Three Party to Group

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2009, IACR Cryptol. ePrint Arch..

Forcing out a confession: Threshold discernible ring signatures

C. Pandu Rangan, Swarun Kumar, Satyanarayana V. Lokam, 2010, 2010 International Conference on Security and Cryptography (SECRYPT).

Identity Based Online/Offline Signcryption Scheme

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2010, IACR Cryptol. ePrint Arch..

Identity Based Public Verifiable Signcryption Scheme

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2010, ProvSec.

Perfectly Reliable Message Transmission

K. Srinathan, C. Pandu Rangan, Arvind Narayanan, 2006, Inf. Process. Lett..

Efficient Asynchronous Byzantine Agreement with Optimal Resilience

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2008, IACR Cryptol. ePrint Arch..

Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs

C. Pandu Rangan, R. Srikant, Ravi Sundaram, 1993, Theor. Comput. Sci..

Lattice Based Efficient Threshold Public Key Encryption Scheme

C. Pandu Rangan, A. K. Banerjee, Kunwar Singh, 2013, J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl..

Strongly Unforgeable Proxy Re-Signature Schemes in the Standard model

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2012, IACR Cryptol. ePrint Arch..

Stronger public key encryption system withstanding RAM scraper like attacks

C. Pandu Rangan, S. Sharmila Deva Selvi, Akshayaram Srinivasan, 2016, Secur. Commun. Networks.

NASA Formal Methods

C. Pandu Rangan, Moni Naor, Jon M. Kleinberg, 2018, Lecture Notes in Computer Science.

Signcryption with Proxy Re-encryption

C. Pandu Rangan, K. Ambika, S. Chandrasekar, 2008, IACR Cryptol. ePrint Arch..

Edge-disjoint paths in permutation graphs

C. Pandu Rangan, C. P. Gopalakrishnan, C. Rangan, 1994, Discuss. Math. Graph Theory.

Probabilistic Verifiable Secret Sharing Tolerating Adaptive Adversary

C. Pandu Rangan, Arpita Patra, Ashish Choudhary, 2008, IACR Cryptol. ePrint Arch..

Privacy Preserving DBSCAN Algorithm for Clustering

C. Pandu Rangan, K. Anil Kumar, 2007, ADMA.

Efficient, Pairing-Free, Authenticated Identity Based Key Agreement in a Single Round

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2013, ProvSec.

Lattice-based identity-based resplittable threshold public key encryption scheme

C. Pandu Rangan, A. K. Banerjee, Kunwar Singh, 2016, Int. J. Comput. Math..

The Vertex-Disjoint Triangles Problem

C. Pandu Rangan, Venkatesan Guruswami, Chak-Kuen Wong, 1998, WG.

Optimal Parallel Algorithms for Path Problems on Planar Graphs

C. Pandu Rangan, G. Srikrishna, C. P. Rangan, 1995, Theor. Comput. Sci..

Partial and Perfect Path Covers of Cographs

C. Pandu Rangan, David G. Kirkpatrick, Anand Srinivasan, 1998, Discret. Appl. Math..

Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2009, CANS.

Efficient reduction for path problems on circular-arc graphs

C. Pandu Rangan, Srinivasa Rao Arikati, Glenn K. Manacher, 1991, BIT Comput. Sci. Sect..

A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs

C. Pandu Rangan, N. S. Narayanaswamy, Esha Ghosh, 2011, WALCOM.

Advances in Software Engineering Techniques

C. Pandu Rangan, Oscar Nierstrasz, Takeo Kanade, 2009, Lecture Notes in Computer Science.

Pairing-free single round certificateless and identity based authenticated key exchange protocols

C. Pandu Rangan, Saikrishna Badrinarayanan, 2014, SECRYPT 2014.

The Parity Path Problem on Some Subclasses of Perfect Graphs

C. Pandu Rangan, Satyan R. Coorg, 1996, Discret. Appl. Math..

Variants of Spreading Messages

C. Pandu Rangan, T. V. Thirumala Reddy, D. Sai Krishna, 2010, WALCOM.

Asynchronous Unconditionally Secure Computation: An Efficiency Improvement

K. Srinathan, C. Pandu Rangan, B. Prabhu, 2002, INDOCRYPT.

Cryptanalysis of Unidirectional Proxy Re-Encryption Scheme

C. Pandu Rangan, A. K. Banerjee, Kunwar Singh, 2014, ICT-EurAsia.

Approximation algorithms for the Traveling Salesman Problem with range condition

C. Pandu Rangan, D. Arun Kumar, C. Rangan, 2000, RAIRO Theor. Informatics Appl..

Software Engineering Research and Applications

C. Pandu Rangan, Oscar Nierstrasz, Josef Kittler, 2003, Lecture Notes in Computer Science.

An Optimal Algorithm for Reconstructing a Binary Tree

C. Pandu Rangan, V. Kamakoti, 1992, Inf. Process. Lett..

A CCA-Secure Collusion-Resistant Identity-Based Proxy Re-Encryption Scheme

C. Pandu Rangan, S. Sharmila Deva Selvi, Arinjita Paul, 2018, ProvSec.

Progress in Cryptology — INDOCRYPT 2001

C. Pandu Rangan, Cunsheng Ding, C. Ding, 2001, Lecture Notes in Computer Science.

Distributed consensus in the presence of sectional faults

K. Srinathan, C. Pandu Rangan, Vinod Vaikuntanathan, 2003, PODC '03.

Asynchronous Secure Communication Tolerating Mixed Adversaries

K. Srinathan, C. Pandu Rangan, Ashwin Machanavajjhala, 2002, ASIACRYPT.

Weighted Irredundance of Interval Graphs

C. Pandu Rangan, Maw-Shang Chang, P. Nagavamsi, 1998, Inf. Process. Lett..

Identity Based Online/Offline Encryption Scheme

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2010, IACR Cryptol. ePrint Arch..

Weighted Irredundance of Interval Graphs

C. Pandu Rangan, Maw-Shang Chang, 1994, ISAAC.

Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation

K. Srinathan, C. Pandu Rangan, 2000, INDOCRYPT.

Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary

K. Srinathan, C. Pandu Rangan, Ashish Choudhury, 2009, ASIACCS '09.

Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality

K. Srinathan, C. Pandu Rangan, Ashish Choudhury, 2010, Int. J. Appl. Cryptogr..

Lattice Based Universal Re-encryption for Mixnet

C. Pandu Rangan, A. K. Banerjee, Kunwar Singh, 2014, J. Internet Serv. Inf. Secur..

Collusion Free Protocol for Correlated Element Selection Problem

C. Pandu Rangan, Akshay Agrawal, Amjed Shareef, 2010, IACR Cryptol. ePrint Arch..

LATIN 2018: Theoretical Informatics

C. Pandu Rangan, Gerhard Weikum, John C. Mitchell, 2018, Lecture Notes in Computer Science.

A Provably-Secure Unidirectional Proxy Re-encryption Scheme Without Pairing in the Random Oracle Model

C. Pandu Rangan, S. Sharmila Deva Selvi, Arinjita Paul, 2017, CANS.

Algorithms for Weighted Graph Problems on The Modified Cellular Graph Automaton

C. Pandu Rangan, Suresh Venkatasubramanian, Kamala Krithivasan, 1989, RAIRO Theor. Informatics Appl..

Variants of Spreading Messages

C. Pandu Rangan, T. V. Thirumala Reddy, 2011, J. Graph Algorithms Appl..

On the Minimum Number of Additions Required to Compute a Quadratic Form

C. Pandu Rangan, 1983, J. Algorithms.

Graph-Theoretic Concepts in Computer Science

C. Pandu Rangan, Takeo Kanade, Jon M. Kleinberg, 2017, Lecture Notes in Computer Science.

Communication Optimal Multi-valued Asynchronous Broadcast Protocol

C. Pandu Rangan, Arpita Patra, 2010, LATINCRYPT.

On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks

K. Srinathan, C. Pandu Rangan, Ashish Choudhury, 2009, ICDCN.

Treewidth of Circular-Arc Graphs (Abstract)

C. Pandu Rangan, Ravi Sundaram, Karan Sher Singh, 1991, WADS.

On the Security of Two Ring Signcryption Schemes

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2009, SECRYPT.

On the Generative Power of Simple H Systems

C. Pandu Rangan, Lakshminarayanan Subramanian, Kamala Krithivasan, 2000, J. Autom. Lang. Comb..

Guest Editorial: Special Issue on Cyber Security Protections and Applications

C. Pandu Rangan, A. K. Banerjee, Kunwar Singh, 2014, J. Internet Serv. Inf. Secur..

Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience

C. Pandu Rangan, Arpita Patra, 2011, ICITS.

Clique Transversal and Clique Independence on Comparability Graphs

C. Pandu Rangan, V. Balachandran, P. Nagavamsi, 1996, Inf. Process. Lett..

Cryptanalysis of Bohio et al.'s ID-Based Broadcast Signcryption (IBBSC) Scheme for Wireless Ad-Hoc Networks

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2008, 2008 Sixth Annual Conference on Privacy, Security and Trust.

A New Certificateless Blind Signature Scheme

C. Pandu Rangan, Akash Gautam, Sangeetha Jose, 2014, J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl..

Efficient Parallel Algorithms for Permutation Graphs

C. Pandu Rangan, V. Kamakoti, K. Arvind, 1995, J. Parallel Distributed Comput..

On Conditional Covering Problem

C. Pandu Rangan, Balasubramanian Sivan, S. Harini, 2010, Math. Comput. Sci..

Systematic Design of an Algorithm for Biconnected Components

C. Pandu Rangan, K. Madhukar, R. Sundar, 1995, Sci. Comput. Program..

Randomized Dictionary Structures

C. Pandu Rangan, 2004 .

Competitive Location in the L1 and LINF Metrics

C. Pandu Rangan, Ramesh Govindan, C. P. Rangan, 1988, WG.

Computing Maximum Uniquely Restricted Matchings in Restricted Interval Graphs

C. Pandu Rangan, Swapnil Gupta, 2016 .

Efficient algorithms for minimal disjoint path problems on chordal graphs

C. Pandu Rangan, Satyan R. Coorg, C. P. Gopalakrishnan, 1995, Discuss. Math. Graph Theory.

An Efficient IND-CCA2 Secure Variant of the Niederreiter Encryption Scheme in the Standard Model

C. Pandu Rangan, Sridhar Venkatesan, Sachin Vasant, 2012, ACISP.

Two-Stage Framework for Accurate and Differentially Private Network Information Publication

C. Pandu Rangan, Vorapong Suppakitpaisarn, Maneesh Babu Adhikari, 2020, CSoNet.

Data structures for limited oblivious execution of programs while preserving locality of reference

C. Pandu Rangan, Ramarathnam Venkatesan, Avinash V. Varadarajan, 2007, DRM '07.

Public Key Encryption Resilient to Post-Challenge Leakage and Tampering Attacks

C. Pandu Rangan, Suvradip Chakraborty, Suvradip Chakraborty, 2019, IACR Cryptol. ePrint Arch..

On Provably Secure Code-Based Signature and Signcryption Scheme

C. Pandu Rangan, Sachin Vasant, K. Preetha Mathew, 2012, IACR Cryptol. ePrint Arch..

Reoptimization of Path Vertex Cover Problem pdf

C. Pandu Rangan, Mehul Kumar, Amit Kumar, 2019, COCOON.

Foundations of Software Technology and Theoretical Computer Science

C. Pandu Rangan, R. Ramanujam, Venkatesh Raman, 2000, Lecture Notes in Computer Science.

Cryptanalysis of Mu et al.'s and Li et al.'s Schemes and a Provably Secure ID-Based Broadcast Signcryption (IBBSC) Scheme

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2009, WISA.

Unconditionally Secure Asynchronous Multiparty Computation with Quadratic Communication Per Multiplication Gate

C. Pandu Rangan, Arpita Patra, Ashish Choudhary, 2009, IACR Cryptol. ePrint Arch..

On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission

K. Srinathan, C. Pandu Rangan, Ashish Choudhury, 2012, JACM.

Brief announcement: efficient perfectly secure communication over synchronous networks

K. Srinathan, C. Pandu Rangan, Vinod Vaikuntanathan, 2003, PODC '03.

Cross-Chain Communication Using Receipts

C. Pandu Rangan, Arasu Arun, Arasu Arun, 2019, IACR Cryptol. ePrint Arch..

Identity-Based Deterministic Signature Scheme without Forking-Lemma

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2011, IWSEC.

The Guarding Problem - Complexity and Approximation

C. Pandu Rangan, T. V. Thirumala Reddy, D. Sai Krishna, 2009, IWOCA.

Linear Algorithms for Parity Path and Two Path Problems on Circular-Arc Graph

C. Pandu Rangan, A. Srinivasa Rao, A. S. Rao, 1989, WADS.

Bit-depth scalable video coding using error residual correction

C. Pandu Rangan, R. Shyam Sundar, 2011, 2011 Visual Communications and Image Processing (VCIP).

Optimal parallel algorithm for findingst-ambitus of a planar biconnected graph

C. Pandu Rangan, K. S. Easwarakumar, S. Seshadri, 2005, Algorithmica.

Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model

C. Pandu Rangan, Sachin Vasant, K. Preetha Mathew, 2013, ICISC.

Cache Me if You Can: Capacitated Selfish Replication Games in Networks

C. Pandu Rangan, Ravi Sundaram, Dimitrios Kanoulas, 2010, Theory of Computing Systems.

On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary

K. Srinathan, C. Pandu Rangan, Ashish Choudhury, 2008, PODC '08.

Sanitizable signatures with strong transparency in the standard model

C. Pandu Rangan, Swarun Kumar, Amjed Shareef, 2009, IACR Cryptol. ePrint Arch..

A Revocable Online-Offline Certificateless Signature Scheme without Pairing

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2013, IACR Cryptol. ePrint Arch..

A Code-Based 1-out-of-N Oblivious Transfer Based on McEliece Assumptions

C. Pandu Rangan, Sridhar Venkatesan, Sachin Vasant, 2012, ISPEC.

Security Weaknesses in Two Certificateless Signcryption Schemes

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2010, IACR Cryptol. ePrint Arch..

Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs

C. Pandu Rangan, A. Srinivasan, 1991, Theor. Comput. Sci..

An O(n log n) algorithm for a maxmin location problem

C. Pandu Rangan, Ramesh Govindan, C. P. Rangan, 1992, Discret. Appl. Math..

Asynchronous Byzantine Agreement with optimal resilience

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2014, Distributed Computing.

Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary

K. Srinathan, C. Pandu Rangan, Ashish Choudhury, 2008, ICITS.

Efficient Compilers for After-the-Fact Leakage: From CPA to CCA-2 Secure PKE to AKE

C. Pandu Rangan, Goutam Paul, Suvradip Chakraborty, 2017, ACISP.

Brief announcement: perfectly secure message transmission in directed networks re-visited

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2009, PODC '09.

Perfectly reliable and secure message transmission tolerating mobile adversary

K. Srinathan, C. Pandu Rangan, Prasad Raghavendra, 2009, Int. J. Appl. Cryptogr..

Sharing of Encrypted files in Blockchain Made Simpler

C. Pandu Rangan, S. Sharmila Deva Selvi, Saswata Basu, 2019, IACR Cryptol. ePrint Arch..

The Round Complexity of Verifiable Secret Sharing Revisited

C. Pandu Rangan, Tal Rabin, Ashish Choudhury, 2009, CRYPTO.

Tree 3-Spanners on Interval, Permutation and Regular Bipartite Graphs

C. Pandu Rangan, G. Venkatesan, M. S. Madanlal, 1996, Inf. Process. Lett..

Proceedings of the cryptology 8th international conference on Progress in cryptology

C. Pandu Rangan, Moti Yung, Kannan Srinathan, 2007 .

An Efficient Randomized Algorithm for the Closest Pair Problem on Colored Point Sets

C. Pandu Rangan, V. Kamakoti, Kamala Krithivasan, 1995, Nord. J. Comput..

Proceedings of the 10th International Symposium on Algorithms and Computation

C. Pandu Rangan, Alok Aggarwal, C. P. Rangan, 1999 .

Skew Heaps

C. Pandu Rangan, 2004, Handbook of Data Structures and Applications.

Core and Conditional Core Path of Specified Length in Special Classes of Graphs

C. Pandu Rangan, Balasubramanian Sivan, S. Harini, 2009, WALCOM.

On Optimal Probabilistic Asynchronous Byzantine Agreement

C. Pandu Rangan, Amjed Shareef, 2008, ICDCN.

An Efficient Distributed Algorithm For st-numbering The Verices Of A Biconnected Graph

C. Pandu Rangan, Rohan F. M. Aranha, 1995, J. Univers. Comput. Sci..

Possibility and complexity of probabilistic reliable communication in directed networks

K. Srinathan, C. Pandu Rangan, 2006, PODC '06.

Efficient and Provably Secure Certificateless Multi-receiver Signcryption

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2008, ProvSec.

Pathwidth and Searching in Parameterized Threshold Graphs

C. Pandu Rangan, T. V. Thirumala Reddy, D. Sai Krishna, 2010, WALCOM.

Privacy Preserving CACTUS Algorithm for Clustering over Vertically Partitioned Databases

C. Pandu Rangan, P. Krishna Prasad, 2007, DMIN.

Theory of Equal-Flows in Networks

K. Srinathan, C. Pandu Rangan, Ashwin Machanavajjhala, 2002, COCOON.

Constant phase efficient protocols for secure message transmission in directed networks

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2007, PODC '07.

Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission

K. Srinathan, C. Pandu Rangan, Ashish Choudhury, 2006, INDOCRYPT.

Anonymous Identity-Based Identification Scheme in Ad-Hoc Groups without Pairings

C. Pandu Rangan, Prateek Barapatre, 2013, SPACE.

Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2008, ACISP.

New approach to practical leakage-resilient public-key cryptography

C. Pandu Rangan, Janaka Alawatugoda, Suvradip Chakraborty, 2020, IACR Cryptol. ePrint Arch..

A linear space algorithm for the LCS problem

C. Pandu Rangan, S. Kiran Kumar, 2004, Acta Informatica.

Progress in Cryptology - INDOCRYPT 2007, 8th International Conference on Cryptology in India, Chennai, India, December 9-13, 2007, Proceedings

C. Pandu Rangan, Moti Yung, Kannan Srinathan, 2007, INDOCRYPT.

On the security of a Certificateless Proxy Re-Encryption Scheme without Pairing

C. Pandu Rangan, S. Sharmila Deva Selvi, Arinjita Paul, 2017, IACR Cryptol. ePrint Arch..

Foundations of Group Key Management - Framework, Security Model and a Generic Construction

C. Pandu Rangan, Ragavendran Gopalakrishnan, Rahul Srinivasan, 2008, IACR Cryptol. ePrint Arch..

Adaptively Secure Efficient Lattice (H)IBE in Standard Model with Short Public Parameters

C. Pandu Rangan, A. K. Banerjee, Kunwar Singh, 2012, SPACE.

A linear algorithm for the all-bidirectional-edges problem on planar graphs

C. Pandu Rangan, P. B. Ramprasad, 2005, Algorithmica.

On the Complexity of Partial Order Properties

C. Pandu Rangan, Stefan Felsner, Dorothea Wagner, 2000, Order.

Round Efficient Unconditionally Secure Multiparty Computation Protocol

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2008, INDOCRYPT.

On the Security of Attribute Based Signature Schemes

C. Pandu Rangan, S. Sharmila Deva Selvi, Subhashini Venugopalan, 2012, IACR Cryptol. ePrint Arch..

Secure message transmission in asynchronous networks

K. Srinathan, C. Pandu Rangan, Ashish Choudhury, 2011, J. Parallel Distributed Comput..

Round-Optimal and Efficient Verifiable Secret Sharing

K. Srinathan, C. Pandu Rangan, Matthias Fitzi, 2006, TCC.

An Efficient Distributed Algorithm For st-numbering The Vertices Of A Biconnected Graph

C. Pandu Rangan, Rohan F. M. Aranha, 1996 .

Stable Marriage Problem with Ties and Incomplete bounded length preference list under social stability pdf

C. Pandu Rangan, Ashish Shrivastava, 2016, ArXiv.

All-pairs-shortest-length on Strongly Chordal Graphs

C. Pandu Rangan, V. Balachandhran, 1996, Discret. Appl. Math..

PKI Based Signcryption without Pairing: an Efficient Scheme with Tight Security Reduction

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2012, J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl..

On Exponential Lower Bound for Protocols for Reliable Communication in Networks

K. Srinathan, C. Pandu Rangan, Ranjit Kumaresan, 2007, ICITS.

Forward-Security Under Continual Leakage with Deterministic Key Updates

C. Pandu Rangan, Suvradip Chakraborty, Harish Karthikeyan, 2020, IACR Cryptol. ePrint Arch..

An Efficient Attribute-Based Authenticated Key Exchange Protocol

C. Pandu Rangan, Suvradip Chakraborty, Y. Sreenivasa Rao, 2017, CANS.

Efficient Certificateless Online/Offline Signature

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2012, J. Internet Serv. Inf. Secur..

Simple and efficient asynchronous byzantine agreement with optimal resilience

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2009, PODC '09.

A Suite of Identity Based Aggregate Signatures and a Multi-Signature Scheme from RSA

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2010, IACR Cryptol. ePrint Arch..

Improving Accuracy of Differentially Private Kronecker Social Networks via Graph Clustering

C. Pandu Rangan, Mitali Bafna, Vorapong Suppakitpaisarn, 2020, 2020 International Symposium on Networks, Computers and Communications (ISNCC).

A navigation algorithm inspired by human navigation

C. Pandu Rangan, C. E. Veni Madhavan, Sudarshan Iyengar, 2011, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

Feedback vertex set on cocomparability graphs

C. Pandu Rangan, Satyan R. Coorg, 1995, Networks.

A Provably Secure Conditional Proxy Re-Encryption Scheme without Pairing

C. Pandu Rangan, S. Sharmila Deva Selvi, Arinjita Paul, 2019, IACR Cryptol. ePrint Arch..

Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2009, ICITS.

Probabilistic Data Structures for Priority Queues (Extended Abstract)

C. Pandu Rangan, Sridhar Ramachandran, C. P. Rangan, 1998, SWAT.

Security Analysis of Aggregate signature and Batch verification signature schemes

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2009, IACR Cryptol. ePrint Arch..

Rational Secret Sharing with Honest Players over an Asynchronous Channel

C. Pandu Rangan, William K. Moses, W. Moses, 2011, IACR Cryptol. ePrint Arch..

Deterministic Identity Based Signature Scheme and Its Application for Aggregate Signatures

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2012, ACISP.

Pervasive Computing

C. Pandu Rangan, Oscar Nierstrasz, Josef Kittler, 2004, Lecture Notes in Computer Science.

Breaking and Fixing of an Identity Based Multi-Signcryption Scheme

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2009, ProvSec.

Compact Stateful Encryption Schemes with Ciphertext Verifiability

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2012, IWSEC.

Non-transferability in Proxy Re-Encryption Revisited

C. Pandu Rangan, S. Sharmila Deva Selvi, Lihua Wang, 2020, J. Internet Serv. Inf. Secur..

Practical IBE secure under CBDH - encrypting without pairing

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2015, 2015 12th International Joint Conference on e-Business and Telecommunications (ICETE).

Lattice Based Mix Network for Location Privacy in Mobile System

C. Pandu Rangan, A. K. Banerjee, Kunwar Singh, 2015, Mob. Inf. Syst..

On Communication Complexity of Perfectly Reliable and Secure Communication in Directed Networks

C. Pandu Rangan, Arpita Patra, Kannan Srinathan, 2008, IACR Cryptol. ePrint Arch..

Identity-Based Group Encryption Revisited

C. Pandu Rangan, S. Sharmila Deva Selvi, Kanika Gupta, 2017, ICICS.

Group key establishment (GKE): Two/three party key exchange to GKE

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2012, 2012 IEEE International Conference on Advanced Networks and Telecommunciations Systems (ANTS).

Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2010, AFRICACRYPT.

An Efficient Certificateless Proxy Re-Encryption Scheme Without Pairing

C. Pandu Rangan, S. Sharmila Deva Selvi, Arinjita Paul, 2017, ProvSec.

Cache Me If You Can: Capacitated Selfish Replication Games

C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram, 2012, LATIN.

Efficient Dynamic Job Scheduling Algorithms for Multiprocessor Systems

C. Pandu Rangan, C. Siva Ram Murthy, Saptarshi Mahesh, 1995, IEICE Trans. Inf. Syst..

An Efficient Non-transferable Proxy Re-encryption Scheme

C. Pandu Rangan, S. Sharmila Deva Selvi, Arinjita Paul, 2017, ATIS.

A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph

C. Pandu Rangan, K. S. Easwarakumar, Grant A. Cheston, 1994, Inf. Process. Lett..

On the Security of Identity Based Ring Signcryption Schemes

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2009, ISC.

A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory

C. Pandu Rangan, Sachin Vasant, K. Preetha Mathew, 2013, ICISC.

On Finding the Minimum Bandwidth of Interval Graphs

C. Pandu Rangan, Aravind Srinivasan, R. Mahesh, 1991, Inf. Comput..

The deterministic protocol for rational secret sharing

C. Pandu Rangan, Amjed Shareef, Shaik Maleka, 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

An Identity Based Encryption Scheme Resilient to RAM Scraper Like Malware Attacks

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2015, IACR Cryptol. ePrint Arch..

Privacy Preserving BIRCH Algorithm for Clustering over Arbitrarily Partitioned Databases

C. Pandu Rangan, P. Krishna Prasad, 2007, ADMA.

Identity based partial aggregate signature scheme without pairing

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2012, 2012 35th IEEE Sarnoff Symposium.

Towards a Cooperative Defense Model Against Network Security Attacks

C. Pandu Rangan, Harikrishna Narasimhan, Venkatanathan Varadarajan, 2010, WEIS.

An Efficient Distributed Algorithm for Centering a Spanning Tree of a Biconnected Graph

C. Pandu Rangan, Rohan F. M. Aranha, 1996, Inf. Process. Lett..

Attribute Based Signatures for Bounded Multi-level Threshold Circuits

C. Pandu Rangan, Swarun Kumar, Shivank Agrawal, 2010, EuroPKI.

Edge-Disjoint Paths in Permutation Graphs

C. Pandu Rangan, C. P. Gopalakrishnan, 1994, ISAAC.

Constant Size Ring Signature Without Random Oracle

C. Pandu Rangan, Dipanjan Das, Priyanka Bose, 2015, ACISP.

Conditional Proxy Re-Encryption - A More Efficient Construction

C. Pandu Rangan, S. Sree Vivek, V. Radhakishan, 2011 .

Performance Bounds for Static Multiprocessor Scheduling of Multi-Task Jobs

C. Pandu Rangan, C. Siva Ram Murthy, Sathi Mahesh, 1995, Parallel Process. Lett..

Generalized Vertex Covering in Interval Graphs

C. Pandu Rangan, R. Ravi, Madhav V. Marathe, 1992, Discret. Appl. Math..

An Efficient Multiple PKG Compatible Identity Based Key Agreement for Vehicular Networks

C. Pandu Rangan, Suvradip Chakraborty, Kunwar Singh, 2015, IACR Cryptol. ePrint Arch..

On Byzantine Agreement over (2, 3)-Uniform Hypergraphs

K. Srinathan, C. Pandu Rangan, Muthuramakrishnan Venkitasubramaniam, 2004, DISC.

Unconditionally Reliable Message Transmission in Directed Hypergraphs

K. Srinathan, C. Pandu Rangan, Ashish Choudhury, 2008, CANS.

Efficient Randomized Parallel Algorithm for the Closest Pair Problem in D-dimension

C. Pandu Rangan, V. Kamakoti, P. Jagan Mohan, 1994, IFIP Congress.

The Round Complexity of Verifiable Secret Sharing: The Statistical Case

C. Pandu Rangan, Arpita Patra, Ranjit Kumaresan, 2010, ASIACRYPT.

Restrictions of Minimum Spanner Problems

C. Pandu Rangan, Johann A. Makowsky, Udi Rotics, 1997, Inf. Comput..

A linear algorithms for the two paths problem on permutation graphs

C. Pandu Rangan, C. P. Gopalakrishnan, 1995, Discuss. Math. Graph Theory.

Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology

C. Pandu Rangan, Cunsheng Ding, 2001 .

A parallel algorithm for recognizing the shuffle of two strings

C. Pandu Rangan, Ahmed Saoudi, Maurice Nivat, 1992, Proceedings Sixth International Parallel Processing Symposium.

Privacy Preserving BIRCH Algorithm for Clustering over Vertically Partitioned Databases

C. Pandu Rangan, P. Krishna Prasad, 2006, Secure Data Management.

A Closer Look at Anonymous Proxy Re-Encryption Schemes

C. Pandu Rangan, S. Sharmila Deva Selvi, S. Harish, 2019, SpaCCS.

An Efficient Identity-Based Signcryption Scheme for Multiple Receivers

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2009, IWSEC.

Total Domination in Interval Graphs Revisited

C. Pandu Rangan, G. Ramalingam, 1988, Inf. Process. Lett..

Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2009, IACR Cryptol. ePrint Arch..

Steganographic Communication in Ordered Channels

C. Pandu Rangan, Guevara Noubir, Ravi Sundaram, 2006, Information Hiding.

A fast algorithm for computing sparse visibility graphs

C. Pandu Rangan, S. Sudarshan, 2005, Algorithmica.

Certificateless Proxy Re-Encryption Without Pairing: Revisited

C. Pandu Rangan, Akshayaram Srinivasan, Akshayaram Srinivasan, 2015, SCC@ASIACCS.

Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2013, Journal of Cryptology.

Efficient Asynchronous Secure Multiparty Distributed Computation

K. Srinathan, C. Pandu Rangan, C. P. Rangan, 2000, INDOCRYPT.

Approximate Triclique Coloring for Register Allocation

C. Pandu Rangan, G. Venkatesan, 1996, Inf. Process. Lett..

On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2009, IACR Cryptol. ePrint Arch..

Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary

K. Srinathan, C. Pandu Rangan, Ashish Choudhury, 2007, DISC.

Efficient single phase unconditionally secure message transmission with optimum communication complexity

K. Srinathan, C. Pandu Rangan, Ashish Choudhury, 2008, PODC '08.

Weighted Independent Perfect Domination on Cocomparability Graphs

C. Pandu Rangan, Gerard J. Chang, Satyan R. Coorg, 1993, Discret. Appl. Math..

A Simple Implementation of Warshall's Algorithm on a VLSI Chip

C. Pandu Rangan, Ramesh Dewangan, 1986, WG.

Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2008, IACR Cryptol. ePrint Arch..

Linear Algorithm for Optimal Path Cover Problem on Interval Graphs

C. Pandu Rangan, Srinivasa Rao Arikati, S. Arikati, 1990, Inf. Process. Lett..

An identity based ring signcryption scheme with public verifiability

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2010, 2010 International Conference on Security and Cryptography (SECRYPT).

Brief announcement: communication efficient asynchronous byzantine agreement

C. Pandu Rangan, Arpita Patra, 2010, PODC '10.

Communication and Round Efficient Information Checking Protocol pdf

C. Pandu Rangan, Arpita Patra, 2010, ArXiv.

RSA-TBOS signcryption with proxy re-encryption

C. Pandu Rangan, Varad Kirtane, 2008, DRM '08.

Playing push vs pull: models and algorithms for disseminating dynamic data in networks

C. Pandu Rangan, Rajmohan Rajaraman, Abishek Kumarasubramanian, 2006, SPAA '06.

A New Linear Algorithm for the Two Path Problem on Chordal Graphs

C. Pandu Rangan, S. Seshadri, S. V. Krishnan, 1988, FSTTCS.

Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2009, INDOCRYPT.

On Communication Complexity of Secure Message Transmission in Directed Networks

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2010, ICDCN.

Algorithms and computation : 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999 : proceedings

C. Pandu Rangan, Alok Aggarwal, 1999 .

Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs

C. Pandu Rangan, Hari Balakrishnan, Anand Rajaraman, 1993, WADS.

A note on the Certificateless Multi-receiver Signcryption Scheme

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2009, IACR Cryptol. ePrint Arch..

On the Provable Security of Multi-Receiver Signcryption Schemes

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2008, IACR Cryptol. ePrint Arch..

Forward-Secure Authenticated Symmetric Key Exchange Protocol: New Security Model and Secure Construction

C. Pandu Rangan, Goutam Paul, Suvradip Chakraborty, 2015, ProvSec.

Efficient Asynchronous Multiparty Computation with Optimal Resilience

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2008, IACR Cryptol. ePrint Arch..

Cryptographic Approaches to Denial-of-Service Resistance

C. Pandu Rangan, Harikrishna Narasimhan, Douglas Stebila, 2011 .

Linear Algorithm for Domatic Number Problem on Interval Graphs

C. Pandu Rangan, A. Srinivasa Rao, A. S. Rao, 1989, Inf. Process. Lett..

ID Based Signcryption Scheme in Standard Model

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2012, ProvSec.

An optimal parallel algorithm for the all-nearest-foreign-neighbors problem in arbitrary dimensions

C. Pandu Rangan, V. Kamakoti, Thomas Graf, 1997, Proceedings Fourth International Conference on High-Performance Computing.

Lattice Based Identity Based Unidirectional Proxy Re-Encryption Scheme

C. Pandu Rangan, A. K. Banerjee, Kunwar Singh, 2014, SPACE.

Cryptanalysis of a pairing-free certificate-based proxy re-encryption scheme for secure data sharing in public clouds

C. Pandu Rangan, S. Sharmila Deva Selvi, Irene Miriam Isaac, 2019, IACR Cryptol. ePrint Arch..

Smart Contract-Driven Mechanism Design to Mitigate Information Diffusion in Social Networks

C. Pandu Rangan, Vorapong Suppakitpaisarn, Arinjita Paul, 2019, MARBLE.

Proceedings 13 Volume Editors

C. Pandu Rangan, Alfred Kobsa, Gerhard Weikum, 2013 .

A Unified Approach to Parallel Algorithms for the Domatic Partition Problem on Special Classes of Perfect Graphs

C. Pandu Rangan, Arjun Raman, 1993, Parallel Process. Lett..

On Proactive Perfectly Secure Message Transmission

K. Srinathan, C. Pandu Rangan, Prasad Raghavendra, 2007, ACISP.

An efficient algorithm for finding a two-pair, and its applications

C. Pandu Rangan, Srinivasa Rao Arikati, 1991, Discret. Appl. Math..

Treewidth of Circular-Arc Graphs

C. Pandu Rangan, Ravi Sundaram, Karan Sher Singh, 1994, SIAM J. Discret. Math..

An optimal algorithm to solve the all-pair shortest path problem on interval graphs

C. Pandu Rangan, R. Ravi, Madhav V. Marathe, 1992, Networks.

A CCA2 secure Code based encryption scheme in the Standard Model

C. Pandu Rangan, Sridhar Venkatesan, Sachin Vasant, 2014 .

New Sequential and Parallel Algorithms for Interval Graph Recognition

C. Pandu Rangan, Ganesan Ramalingam, G. Ramalingam, 1990, Inf. Process. Lett..

Trading Players for Efficiency in Unconditional Multiparty Computation

K. Srinathan, C. Pandu Rangan, B. Prabhu, 2002, SCN.

Optimal Perfectly Secure Message Transmission

K. Srinathan, C. Pandu Rangan, Arvind Narayanan, 2004, CRYPTO.

Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2010, PODC '10.

On the Security of Identity Based Threshold Unsigncryption Schemes

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2010, 2010 Fourth International Conference on Network and System Security.

Formalizing the Relationship Between Commitment and Basic Cryptographic Primitives

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2016, J. Internet Serv. Inf. Secur..

Capacitated Caching Games pdf

C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram, 2010, ArXiv.

Brief announcement: on the round complexity of distributed consensus over synchronous networks

K. Srinathan, C. Pandu Rangan, Muthuramakrishnan Venkitasubramaniam, 2004, PODC '04.

Non-perfect Secret Sharing over General Access Structures

K. Srinathan, C. Pandu Rangan, N. Tharani Rajan, 2002, INDOCRYPT.

Parallel Algorithms on Interval Graphs

C. Pandu Rangan, V. B. Balayogan, C. Rangan, 1995, RAIRO Theor. Informatics Appl..

On O(1) concatenation of deques with heap order

C. Pandu Rangan, Chandrasekhar Boyapati, 2002 .

Side Channel Attack Resistant Implementation of Multi-Power RSA using Hensel Lifting

C. Pandu Rangan, Varad Kirtane, 2008, IACR Cryptol. ePrint Arch..

Splitting and Aggregating Signatures in Cryptocurrency Protocols

C. Pandu Rangan, S. Sharmila Deva Selvi, Saswata Basu, 2019, 2019 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPCON).

Unconditionally Secure Multiparty Set Intersection Re-Visited

C. Pandu Rangan, Ashish Choudhury, Arpita Patra, 2008, IACR Cryptol. ePrint Arch..

Cryptanalysis of Li et al.'s Identity-Based Threshold Signcryption Scheme

C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi, 2008, 2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing.

Unconditionally reliable message transmission in directed networks

K. Srinathan, C. Pandu Rangan, Bhavani Shankar, 2008, SODA '08.

A Natural Family of Optimization Problems with Arbitrarily Small Approximation Thresholds

C. Pandu Rangan, Venkatesan Guruswami, 1998, Inf. Process. Lett..

Sanitizable sgnatures with srong tansparency in the sandard model

C. Pandu Rangan, Swarun Kumar, Amjed Shareef, 2009 .

Identity-Based Identification Schemes from ID-KEMs

C. Pandu Rangan, Prateek Barapatre, 2013, SPACE.