C. Pandu Rangan

According to our database, C. Pandu Rangan authored at least 294 papers between 1983 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Compact Identity Based Encryption Based on n^{th} - Residuosity Assumption.

S. Sree Vivek, S. Sharmila Deva Selvi, Ramarathnam Venkatesan, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2023

Forward Security Under Leakage Resilience, Revisited.

Suvradip Chakraborty, Harish Karthikeyan, Adam O'Neill, C. Pandu Rangan

Proceedings of the Cryptology and Network Security - 22nd International Conference, 2023

2022

Efficient Lattice based (H)IB-DRE.

Kunwar Singh, C. Pandu Rangan, Ilsun You, Amalan Joseph Antony, S. K. Karthika, Jiyoon Kim

J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl., 2022

2021

A Provably Secure Conditional Proxy Re-Encryption Scheme without Pairing.

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

J. Internet Serv. Inf. Secur., 2021

Efficient single round attribute-based authenticated key exchange protocol.

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

Int. J. Comput. Math. Comput. Syst. Theory, 2021

Lattice-based unidirectional Proxy Re-Encryption and Proxy Re-Encryption+ schemes.

Kunwar Singh, C. Pandu Rangan, Samir Sheshank, Richa Agrawal

IET Inf. Secur., 2021

A Distributed Ledger Management Mechanism for Storing and Selling Private Data.

Sabyasachi Dutta, Arinjita Paul, Rocki H. Ozaki, C. Pandu Rangan, Kouichi Sakurai

Proceedings of the IEEE Conference on Dependable and Secure Computing, 2021

2020

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

Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram

Theory Comput. Syst., 2020

New approach to practical leakage-resilient public-key cryptography.

Suvradip Chakraborty, Janaka Alawatugoda, Chandrasekaran Pandu Rangan

J. Math. Cryptol., 2020

Non-transferability in Proxy Re-Encryption Revisited.

Arinjita Paul, Lihua Wang, S. Sharmila Deva Selvi, C. Pandu Rangan

J. Internet Serv. Inf. Secur., 2020

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

Kunwar Singh, C. Pandu Rangan, Richa Agrawal, Samir Sheshank

J. Inf. Secur. Appl., 2020

Forward-Security Under Continual Leakage with Deterministic Key Updates.

Suvradip Chakraborty, Harish Karthikeyan, Adam O'Neill, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2020

Improving Accuracy of Differentially Private Kronecker Social Networks via Graph Clustering.

Arinjita Paul, Vorapong Suppakitpaisarn, Mitali Bafna, C. Pandu Rangan

Proceedings of the 2020 International Symposium on Networks, Computers and Communications, 2020

Efficient Attribute-Based Proxy Re-Encryption with Constant Size Ciphertexts.

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

Proceedings of the Progress in Cryptology - INDOCRYPT 2020, 2020

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

Maneesh Babu Adhikari, Vorapong Suppakitpaisarn, Arinjita Paul, C. Pandu Rangan

Proceedings of the Computational Data and Social Networks - 9th International Conference, 2020

2019

Sharing of Encrypted files in Blockchain Made Simpler.

S. Sharmila Deva Selvi, Arinjita Paul, Siva Dirisala, Saswata Basu, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2019

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

S. Sharmila Deva Selvi, Irene Miriam Isaac, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2019

Attribute-based Proxy Re-Encryption with Constant Size Ciphertexts.

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

IACR Cryptol. ePrint Arch., 2019

A Closer Look at Anonymous Proxy Re-Encryption Schemes.

S. Sharmila Deva Selvi, S. Harish, Swethashree Dhanabal, C. Pandu Rangan

Proceedings of the Security, Privacy, and Anonymity in Computation, Communication, and Storage, 2019

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

Arinjita Paul, Vorapong Suppakitpaisarn, C. Pandu Rangan

Proceedings of the 1st International Conference on Mathematical Research for Blockchain Economy, 2019

Splitting and Aggregating Signatures in Cryptocurrency Protocols.

S. Sharmila Deva Selvi, Arinjita Paul, C. Pandu Rangan, Siva Dirisala, Saswata Basu

Proceedings of the IEEE International Conference on Decentralized Applications and Infrastructures, 2019

Reoptimization of Path Vertex Cover Problem.

Mehul Kumar, Amit Kumar, C. Pandu Rangan

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

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

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

IACR Cryptol. ePrint Arch., 2018

A CCA-secure collusion-resistant Identity-based Proxy Re-encryption Scheme.

Arinjita Paul, Varshika Srinivasavaradhan, S. Sharmila Deva Selvi, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2018

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

Suvradip Chakraborty, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2018

2017

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

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

IACR Cryptol. ePrint Arch., 2017

An Efficient Certificateless Proxy Re-Encryption Scheme without Pairing.

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

IACR Cryptol. ePrint Arch., 2017

Leakage-Resilient Tweakable Encryption from One-Way Functions.

Suvradip Chakraborty, Chester Rebeiro, Debdeep Mukhopadhyay, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2017

Efficient Compilers for After-the-Fact Leakage: from CPA to CCA-2 secure PKE to AKE.

Suvradip Chakraborty, Goutam Paul, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2017

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

Suvradip Chakraborty, Janaka Alawatugoda, C. Pandu Rangan

Proceedings of the Provable Security, 2017

Identity-Based Group Encryption Revisited.

Kanika Gupta, S. Sharmila Deva Selvi, C. Pandu Rangan, Shubham Sopan Dighe

Proceedings of the Information and Communications Security - 19th International Conference, 2017

An Efficient Attribute-Based Authenticated Key Exchange Protocol.

Suvradip Chakraborty, Y. Sreenivasa Rao, Chandrasekaran Pandu Rangan

Proceedings of the Cryptology and Network Security - 16th International Conference, 2017

An Efficient Non-transferable Proxy Re-encryption Scheme.

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

Proceedings of the Applications and Techniques in Information Security, 2017

2016

Stronger public key encryption system withstanding RAM scraper like attacks.

Sree Vivek Sivanandam, S. Sharmila Deva Selvi, Akshayaram Srinivasan, Chandrasekaran Pandu Rangan

Secur. Commun. Networks, 2016

Formalizing the Relationship Between Commitment and Basic Cryptographic Primitives.

S. Sree Vivek, S. Sharmila Deva Selvi, Pallavi Chandrasekar, C. Pandu Rangan

J. Internet Serv. Inf. Secur., 2016

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

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

Int. J. Comput. Math., 2016

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

Suvradip Chakraborty, Srinivasan Raghuraman, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2016

2015

Lattice Based Mix Network for Location Privacy in Mobile System.

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

Mob. Inf. Syst., 2015

Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation.

Arpita Patra, Ashish Choudhury, C. Pandu Rangan

J. Cryptol., 2015

Efficiently Obfuscating Re-Encryption Program under DDH Assumption.

Akshayaram Srinivasan, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2015

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

Harish Karthikeyan, Suvradip Chakraborty, Kunwar Singh, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2015

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

Suvradip Chakraborty, Srinivasan Raghuraman, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2015

Constant Size Ring Signature Without Random Oracle.

Priyanka Bose, Dipanjan Das, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2015

Practical IBE Secure under CBDH - Encrypting Without Pairing.

S. Sree Vivek, S. Sharmila Deva Selvi, Aanchal Malhotra, C. Pandu Rangan

Proceedings of the SECRYPT 2015, 2015

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

Suvradip Chakraborty, Goutam Paul, C. Pandu Rangan

Proceedings of the Provable Security, 2015

Certificateless Proxy Re-Encryption Without Pairing: Revisited.

Akshayaram Srinivasan, C. Pandu Rangan

Proceedings of the 3rd International Workshop on Security in Cloud Computing, 2015

2014

A New Certificateless Blind Signature Scheme.

Sangeetha Jose, Akash Gautam, Chandrasekaran Pandu Rangan

J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl., 2014

Guest Editorial: Special Issue on Cyber Security Protections and Applications.

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

J. Internet Serv. Inf. Secur., 2014

Lattice Based Universal Re-encryption for Mixnet.

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

J. Internet Serv. Inf. Secur., 2014

Certificateless Proxy Re-Encryption Without Pairing.

Akshayaram Srinivasan, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2014

Asynchronous Byzantine Agreement with optimal resilience.

Arpita Patra, Ashish Choudhury, C. Pandu Rangan

Distributed Comput., 2014

Lattice Based Identity Based Unidirectional Proxy Re-Encryption Scheme.

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

Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2014

Pairing-free Single Round Certificateless and Identity Based Authenticated Key Exchange Protocols.

Saikrishna Badrinarayanan, C. Pandu Rangan

Proceedings of the SECRYPT 2014, 2014

Cryptanalysis of Unidirectional Proxy Re-Encryption Scheme.

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

Proceedings of the Information and Communication Technology, 2014

Efficient Lattice HIBE in the Standard Model with Shorter Public Parameters.

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

Proceedings of the Information and Communication Technology, 2014

Certificateless and Identity based Authenticated Key Exchange Protocols.

Saikrishna Badrinarayanan, C. Pandu Rangan

Proceedings of the E-Business and Telecommunications - 11th International Joint Conference, 2014

2013

Lattice Based Efficient Threshold Public Key Encryption Scheme.

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

J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl., 2013

Lattice Based Identity Based Proxy Re-Encryption Scheme.

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

J. Internet Serv. Inf. Secur., 2013

Lattice Based Forward-Secure Identity Based Encryption Scheme with Shorter Ciphertext.

Kunwar Singh, C. Pandurangan, A. K. Banerjee

J. Internet Serv. Inf. Secur., 2013

Efficient Certificateless Online/Offline Signature with tight security.

S. Sharmila Deva Selvi, S. Sree Vivek, Vivek Krishna Pradhan, C. Pandu Rangan

J. Internet Serv. Inf. Secur., 2013

A Revocable Online-Offline Certificateless Signature Scheme without Pairing.

Karthik Abinav, Saikrishna Badrinarayanan, C. Pandu Rangan, S. Sharmila Deva Selvi, S. Sree Vivek, Vivek Krishna Pradhan

IACR Cryptol. ePrint Arch., 2013

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

Prateek Barapatre, Chandrasekaran Pandu Rangan

Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2013

Identity-Based Identification Schemes from ID-KEMs.

Prateek Barapatre, Chandrasekaran Pandu Rangan

Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2013

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

Proceedings of the Provable Security - 7th International Conference, 2013

Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model.

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

Proceedings of the Information Security and Cryptology - ICISC 2013, 2013

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

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

Proceedings of the Information Security and Cryptology - ICISC 2013, 2013

2012

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

S. Sree Vivek, S. Sharmila Deva Selvi, Ramarathnam Venkatesan, C. Pandu Rangan

J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl., 2012

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

S. Sree Vivek, S. Sharmila Deva Selvi, Salini Selvaraj Kowsalya, C. Pandu Rangan

J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl., 2012

Lattice Forward-Secure Identity Based Encryption Scheme.

Kunwar Singh, C. Pandurangan, A. K. Banerjee

J. Internet Serv. Inf. Secur., 2012

Efficient Certificateless Online/Offline Signature.

S. Sharmila Deva Selvi, S. Sree Vivek, Vivek Krishna Pradhan, C. Pandu Rangan

J. Internet Serv. Inf. Secur., 2012

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

Ashwinkumar Badanidiyuru, Arpita Patra, Ashish Choudhury, Kannan Srinathan, C. Pandu Rangan

J. ACM, 2012

Stronger Public Key Encryption Schemes Withstanding RAM Scraper Like Attacks.

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

IACR Cryptol. ePrint Arch., 2012

Strongly Unforgeable Proxy Re-Signature Schemes in the Standard model.

S. Sree Vivek, S. Sharmila Deva Selvi, Guhan Balasubramanian, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2012

ID Based Signcryption Scheme in Standard Model.

S. Sharmila Deva Selvi, S. Sree Vivek, Dhinakaran Vinayagamurthy, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2012

On Provably Secure Code-Based Signature and Signcryption Scheme.

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

IACR Cryptol. ePrint Arch., 2012

Optimal Parameters for Efficient Two-Party Computation Protocols.

Chaya Ganesh, C. Pandu Rangan

Proceedings of the Information Security Theory and Practice. Security, Privacy and Trust in Computing Systems and Ambient Intelligent Ecosystems, 2012

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

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

Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2012

Cache Me If You Can: Capacitated Selfish Replication Games.

Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Compact Stateful Encryption Schemes with Ciphertext Verifiability.

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

Proceedings of the Advances in Information and Computer Security, 2012

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

K. Preetha Mathew, Sachin Vasant, Sridhar Venkatesan, C. Pandu Rangan

Proceedings of the Information Security Practice and Experience, 2012

Obstacles Incentivize Human Learning: A Network Theoretic Study.

Amitash Ramesh, Soumya Ramesh, Sudarshan Iyengar, Vinod Sekhar, C. Pandu Rangan

Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

A Navigation Algorithm Inspired by Human Navigation.

M. Vijesh, Sudarshan Iyengar, S. M. Vijay Mahantesh, Amitash Ramesh, C. Pandu Rangan, Veni Madhavan

Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

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

Proceedings of the Information Security and Privacy - 17th Australasian Conference, 2012

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

S. Sree Vivek, S. Sharmila Deva Selvi, Deepanshu Shukla, C. Pandu Rangan

Proceedings of the IEEE International Conference on Advanced Networks and Telecommuncations Systems, 2012

2011

Secure message transmission in asynchronous networks.

Ashish Choudhury, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan

J. Parallel Distributed Comput., 2011

Variants of Spreading Messages.

T. V. Thirumala Reddy, C. Pandu Rangan

J. Graph Algorithms Appl., 2011

Compact CCA-Secure Encryption with Ciphertext Verifiability.

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

IACR Cryptol. ePrint Arch., 2011

On the Security of ID Based Signcryption Schemes.

S. Sharmila Deva Selvi, S. Sree Vivek, Dhinakaran Vinayagamurthy, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2011

Deterministic Identity Based Signature Scheme and its Application for Aggregate Signatures.

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

IACR Cryptol. ePrint Arch., 2011

Identity Based Deterministic Signature Scheme Without Forking-Lemma.

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

IACR Cryptol. ePrint Arch., 2011

Rational Secret Sharing with Honest Players over an Asynchronous Channel.

William K. Moses Jr., C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2011

Rational Secret Sharing over an Asynchronous Broadcast Channel with Information Theoretic Security

William K. Moses Jr., C. Pandu Rangan

CoRR, 2011

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

Esha Ghosh, Subhas Kumar Ghosh, C. Pandu Rangan

CoRR, 2011

A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs.

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

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Bit-depth scalable video coding using error residual correction.

R. Shyam Sundar, C. Pandu Rangan

Proceedings of the 2011 IEEE Visual Communications and Image Processing, 2011

CCA Secure Certificateless Encryption Schemes based on RSA.

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

Proceedings of the SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography, Seville, Spain, 18, 2011

Identity Based Online/Offline Encryption and Signcryption Schemes Revisited.

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

Proceedings of the Security Aspects in Information Technology, 2011

2010

On Conditional Covering Problem.

Balasubramanian Sivan, S. Harini, C. Pandu Rangan

Math. Comput. Sci., 2010

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

Arpita Patra, Ashish Choudhury, C. Pandu Rangan, Kannan Srinathan

Int. J. Appl. Cryptogr., 2010

Collusion Free Protocol for Correlated Element Selection Problem.

Amjed Shareef, Akshay Agrawal, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2010

Identity Based Partial Aggregate Signature Scheme Without Pairing.

S. Sharmila Deva Selvi, S. Sree Vivek, J. Shriram, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2010

CCA2 Secure Certificateless Encryption Schemes Based on RSA.

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

IACR Cryptol. ePrint Arch., 2010

Identity Based Online/Offline Signcryption Scheme.

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

IACR Cryptol. ePrint Arch., 2010

Identity Based Public Verifiable Signcryption Scheme.

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

IACR Cryptol. ePrint Arch., 2010

Identity Based Online/Offline Encryption Scheme.

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

IACR Cryptol. ePrint Arch., 2010

Security Weaknesses in Two Certificateless Signcryption Schemes.

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

IACR Cryptol. ePrint Arch., 2010

On the Security of Identity Based Threshold Unsigncryption Schemes.

S. Sharmila Deva Selvi, S. Sree Vivek, S. Priti, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2010

Identity Based Self Delegated Signature - Self Proxy Signatures.

S. Sharmila Deva Selvi, S. Sree Vivek, S. Gopi Nath, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2010

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

Arpita Patra, Ashish Choudhary, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2010

Sanitizable signatures with strong transparency in the standard model.

Shivank Agrawal, Swarun Kumar, Amjed Shareef, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2010

Capacitated Caching Games

Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram

CoRR, 2010

Communication and Round Efficient Information Checking Protocol

Arpita Patra, C. Pandu Rangan

CoRR, 2010

Towards a Cooperative Defense Model Against Network Security Attacks.

Harikrishna Narasimhan, Venkatanathan Varadarajan, C. Pandu Rangan

Proceedings of the 9th Annual Workshop on the Economics of Information Security, 2010

Variants of Spreading Messages.

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

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Pathwidth and Searching in Parameterized Threshold Graphs.

D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shashank, C. Pandu Rangan

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

An Identity based Ring Signcryption Scheme with Public Verifiability.

S. Sharmila Deva Selvi, S. Sree Vivek, Sakhi S. Anand, C. Pandu Rangan

Proceedings of the SECRYPT 2010, 2010

Forcing Out a Confession - Threshold Discernible Ring Signatures.

Swarun Kumar, Shivank Agrawal, Ramarathnam Venkatesan, Satyanarayana V. Lokam, C. Pandu Rangan

Proceedings of the SECRYPT 2010, 2010

Brief announcement: communication efficient asynchronous byzantine agreement.

Arpita Patra, C. Pandu Rangan

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

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

Arpita Patra, Ashish Choudhury, C. Pandu Rangan

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Spatiogram Based Fast Mode Decision in Spatial Scalable Video Coding.

R. Shyam Sundar, C. Pandu Rangan

Proceedings of the Advances in Multimedia Information Processing - PCM 2010, 2010

Communication Optimal Multi-valued Asynchronous Broadcast Protocol.

Arpita Patra, C. Pandu Rangan

Proceedings of the Progress in Cryptology, 2010

Threshold Discernible Ring Signatures.

Swarun Kumar, Shivank Agrawal, Ramarathnam Venkatesan, Satyanarayana V. Lokam, C. Pandu Rangan

Proceedings of the e-Business and Telecommunications - 7th International Joint Conference, 2010

On Communication Complexity of Secure Message Transmission in Directed Networks.

Arpita Patra, Ashish Choudhary, C. Pandu Rangan

Proceedings of the Distributed Computing and Networking, 11th International Conference, 2010

On Composability of Reliable Unicast and Broadcast.

Anuj Gupta, Sandeep Hans, Kannan Srinathan, C. Pandu Rangan

Proceedings of the Distributed Computing and Networking, 11th International Conference, 2010

Attribute Based Signatures for Bounded Multi-level Threshold Circuits.

Swarun Kumar, Shivank Agrawal, Subha Balaraman, C. Pandu Rangan

Proceedings of the Public Key Infrastructures, Services and Applications, 2010

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

Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan

Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009

Perfectly reliable and secure message transmission tolerating mobile adversary.

Arpita Patra, Ashish Choudhary, C. Pandu Rangan, Kannan Srinathan, Prasad Raghavendra

Int. J. Appl. Cryptogr., 2009

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

S. Sree Vivek, S. Sharmila Deva Selvi, Deepanshu Shukla, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2009

ON THE SECURITY OF TWO RING SIGNCRYPTION SCHEMES.

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

IACR Cryptol. ePrint Arch., 2009

Breaking and Building of Group Inside Signature.

S. Sree Vivek, S. Sharmila Deva Selvi, S. Gopi Nath, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2009

Security Analysis of Aggregate signature and Batch verification signature schemes.

S. Sharmila Deva Selvi, S. Sree Vivek, J. Shriram, S. Kalaivani, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2009

Certificateless KEM and Hybrid Signcryption Schemes Revisited.

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

IACR Cryptol. ePrint Arch., 2009

A note on the Certificateless Multi-receiver Signcryption Scheme.

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

IACR Cryptol. ePrint Arch., 2009

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

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

IACR Cryptol. ePrint Arch., 2009

Breaking and Fixing of an Identity Based Multi-Signcryption Scheme.

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

IACR Cryptol. ePrint Arch., 2009

On the security of Identity Based Ring Signcryption Schemes.

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

IACR Cryptol. ePrint Arch., 2009

Communication Optimal Multi-Valued Asynchronous Byzantine Agreement with Optimal Resilience.

Arpita Patra, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2009

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

Arpita Patra, Ashish Choudhary, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2009

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

Arpita Patra, Ashish Choudhary, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2009

Information Theoretically Secure Multi Party Set Intersection Re-Visited.

Arpita Patra, Ashish Choudhary, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2009

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

G. Sathya Narayanan, T. Aishwarya, Anugrah Agrawal, Arpita Patra, Ashish Choudhary, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2009

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

Harikrishna Narasimhan, Venkatanathan Varadarajan, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2009

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

Balasubramanian Sivan, S. Harini, C. Pandu Rangan

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

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

Arpita Patra, Ashish Choudhary, C. Pandu Rangan

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Simple and efficient asynchronous byzantine agreement with optimal resilience.

Arpita Patra, Ashish Choudhary, C. Pandu Rangan

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

The Guarding Problem - Complexity and Approximation.

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

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Identity Based Aggregate Signcryption Schemes.

S. Sharmila Deva Selvi, S. Sree Vivek, J. Shriram, S. Kalaivani, C. Pandu Rangan

Proceedings of the Progress in Cryptology, 2009

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

Arpita Patra, Ashish Choudhary, C. Pandu Rangan

Proceedings of the Progress in Cryptology, 2009

Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience.

Arpita Patra, Ashish Choudhary, C. Pandu Rangan

Proceedings of the Information Theoretic Security, 4th International Conference, 2009

On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks.

Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan

Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

Breaking and Building of Threshold Signcryption Schemes.

S. Sharmila Deva Selvi, S. Sree Vivek, Shilpi Nayak, C. Pandu Rangan

Proceedings of the Information Security and Cryptology - 5th International Conference, 2009

Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience.

Arpita Patra, Ashish Choudhary, C. Pandu Rangan

Proceedings of the Information Security and Cryptology - 5th International Conference, 2009

2008

Unconditionally Secure Message Transmission in Arbitrary Directed Synchronous Networks Tolerating Generalized Mixed Adversary.

Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2008

Unconditionally Reliable Message Transmission in Directed Hypergraphs.

Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2008

An Efficient Identity-Based Signcryption Scheme for Multiple Receivers.

S. Sharmila Deva Selvi, S. Sree Vivek, Rahul Srinivasan, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2008

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

IACR Cryptol. ePrint Arch., 2008

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

S. Sharmila Deva Selvi, S. Sree Vivek, Neha Jain, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2008

On the Provable Security of Multi-Receiver Signcryption Schemes.

S. Sharmila Deva Selvi, S. Sree Vivek, Ragavendran Gopalakrishnan, Naga Naresh Karuturi, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2008

Provably Secure ID-Based Broadcast Signcryption (IBBSC) Scheme.

S. Sharmila Deva Selvi, S. Sree Vivek, Ragavendran Gopalakrishnan, Naga Naresh Karuturi, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2008

Signcryption with Proxy Re-encryption.

Chandrasekar S., Ambika K., C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2008

The Round Complexity of Verifiable Secret Sharing Revisited.

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

IACR Cryptol. ePrint Arch., 2008

Unconditionally Secure Multiparty Set Intersection Re-Visited.

Arpita Patra, Ashish Choudhary, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2008

Efficient Asynchronous Multiparty Computation with Optimal Resilience.

Arpita Patra, Ashish Choudhury, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2008

Efficient Asynchronous Byzantine Agreement with Optimal Resilience.

Arpita Patra, Ashish Choudhury, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2008

Round Efficient Unconditionally Secure Multiparty Computation Protocol.

Arpita Patra, Ashish Choudhary, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2008

Statistically Reliable and Secure Message Transmission in Directed Networks.

Arpita Patra, Ashish Choudhury, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2008

Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary.

Arpita Patra, Ashish Choudhary, Madhu Gayatri, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2008

Perfectly Secure Message Transmission Tolerating Mixed Adversary.

Arpita Patra, Ashish Choudhury, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2008

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

Varad Kirtane, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2008

RSA-TBOS Signcryption with Proxy Re-encryption.

Varad Kirtane, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2008

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

Naga Naresh Karuturi, Ragavendran Gopalakrishnan, Rahul Srinivasan, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2008

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

Proceedings of the Information Security Applications, 9th International Workshop, 2008

Unconditionally reliable message transmission in directed networks.

Bhavani Shankar, Prasant Gopal, Kannan Srinathan, C. Pandu Rangan

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited.

Arpita Patra, Ashish Choudhary, C. Pandu Rangan

Proceedings of the Security and Cryptography for Networks, 6th International Conference, 2008

Efficient and Provably Secure Certificateless Multi-receiver Signcryption.

S. Sharmila Deva Selvi, S. Sree Vivek, Deepanshu Shukla, C. Pandu Rangan

Proceedings of the Provable Security, Second International Conference, 2008

Efficient single phase unconditionally secure message transmission with optimum communication complexity.

Kannan Srinathan, Ashish Choudhary, Arpita Patra, C. Pandu Rangan

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

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

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Rational Secret Sharing with Repeated Games.

Shaik Maleka, Amjed Shareef, C. Pandu Rangan

Proceedings of the Information Security Practice and Experience, 2008

The deterministic protocol for rational secret sharing.

Shaik Maleka, Amjed Shareef, C. Pandu Rangan

Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary.

Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, K. Srinathan, C. Pandu Rangan

Proceedings of the Information Theoretic Security, Third International Conference, 2008

On Optimal Probabilistic Asynchronous Byzantine Agreement.

Amjed Shareef, C. Pandu Rangan

Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

Alternative Protocols for Generalized Oblivious Transfer.

Bhavani Shankar, Kannan Srinathan, C. Pandu Rangan

Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary.

Arpita Patra, Ashish Choudhary, Madhu Vaidyanathan, C. Pandu Rangan

Proceedings of the Information Security and Privacy, 13th Australasian Conference, 2008

2007

Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary.

Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan

Proceedings of the Distributed Computing, 21st International Symposium, 2007

On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication.

Kannan Srinathan, N. R. Prasad, C. Pandu Rangan

Proceedings of the 2007 IEEE Symposium on Security and Privacy (S&P 2007), 2007

Constant phase efficient protocols for secure message transmission in directed networks.

Arpita Patra, Ashish Choudhary, Chandrasekaran Pandu Rangan

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Efficient Protocol For Approximate Agreement.

Amjed Shareef, C. Pandu Rangan

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2007

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

Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan

Proceedings of the Progress in Cryptology, 2007

On Exponential Lower Bound for Protocols for Reliable Communication in Networks.

K. Srinathan, C. Pandu Rangan, Ranjit Kumaresan

Proceedings of the Information Theoretic Security - Second International Conference, 2007

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

Avinash V. Varadarajan, Ramarathnam Venkatesan, C. Pandu Rangan

Proceedings of the Seventh ACM Workshop on Digital Rights Management, 2007

Privacy Preserving CACTUS Algorithm for Clustering over Vertically Partitioned Databases.

P. Krishna Prasad, C. Pandu Rangan

Proceedings of the 2007 International Conference on Data Mining, 2007

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

Arpita Patra, Bhavani Shankar, Ashish Choudhary, K. Srinathan, C. Pandu Rangan

Proceedings of the Cryptology and Network Security, 6th International Conference, 2007

Privacy Preserving BIRCH Algorithm for Clustering over Arbitrarily Partitioned Databases.

P. Krishna Prasad, C. Pandu Rangan

Proceedings of the Advanced Data Mining and Applications, Third International Conference, 2007

Privacy Preserving DBSCAN Algorithm for Clustering.

K. Anil Kumar, C. Pandu Rangan

Proceedings of the Advanced Data Mining and Applications, Third International Conference, 2007

On Proactive Perfectly Secure Message Transmission.

Kannan Srinathan, Prasad Raghavendra, C. Pandu Rangan

Proceedings of the Information Security and Privacy, 12th Australasian Conference, 2007

2006

Perfectly Reliable Message Transmission.

Arvind Narayanan, K. Srinathan, C. Pandu Rangan

Inf. Process. Lett., 2006

Round-Optimal and Efficient Verifiable Secret Sharing.

Matthias Fitzi, Juan A. Garay, Shyamnath Gollakota, C. Pandu Rangan, K. Srinathan

Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

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

Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Privacy Preserving BIRCH Algorithm for Clustering over Vertically Partitioned Databases.

P. Krishna Prasad, C. Pandu Rangan

Proceedings of the Secure Data Management, Third VLDB Workshop, SDM 2006, Seoul, Korea, 2006

Possibility and complexity of probabilistic reliable communication in directed networks.

Kannan Srinathan, C. Pandu Rangan

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

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

Arpita Patra, Ashish Choudhary, K. Srinathan, C. Pandu Rangan

Proceedings of the Progress in Cryptology, 2006

Steganographic Communication in Ordered Channels.

R. C. Chakinala, Abishek Kumarasubramanian, R. Manokaran, Guevara Noubir, C. Pandu Rangan, Ravi Sundaram

Proceedings of the Information Hiding, 8th International Workshop, 2006

2004

Randomized Dictionary Structures.

C. Pandu Rangan

Proceedings of the Handbook of Data Structures and Applications., 2004

Skew Heaps.

C. Pandu Rangan

Proceedings of the Handbook of Data Structures and Applications., 2004

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

D. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan

Proceedings of the Distributed Computing, 18th International Conference, 2004

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

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Optimal Perfectly Secure Message Transmission.

K. Srinathan, Arvind Narayanan, C. Pandu Rangan

Proceedings of the Advances in Cryptology, 2004

2003

Brief announcement: efficient perfectly secure communication over synchronous networks.

K. Srinathan, Vinod Vaikuntanathan, C. Pandu Rangan

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Distributed consensus in the presence of sectional faults.

S. Amitanand, I. Sanketh, K. Srinathan, Vinod Vaikuntanathan, C. Pandu Rangan

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

On the Power of Computational Secret Sharing.

Vinod Vaikuntanathan, Arvind Narayanan, K. Srinathan, C. Pandu Rangan, Kwangjo Kim

Proceedings of the Progress in Cryptology, 2003

Practical Pay TV Schemes.

Arvind Narayanan, C. Pandu Rangan, Kwangjo Kim

Proceedings of the Information Security and Privacy, 8th Australasian Conference, 2003

2002

Trading Players for Efficiency in Unconditional Multiparty Computation.

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

Proceedings of the Security in Communication Networks, Third International Conference, 2002

On perfectly secure cmmunication over arbitrary networks.

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

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Non-perfect Secret Sharing over General Access Structures.

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

Proceedings of the Progress in Cryptology, 2002

Asynchronous Unconditionally Secure Computation: An Efficiency Improvement.

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

Proceedings of the Progress in Cryptology, 2002

Theory of Equal-Flows in Networks.

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

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

Asynchronous Secure Communication Tolerating Mixed Adversaries.

K. Srinathan, M. V. N. Ashwin Kumar, C. Pandu Rangan

Proceedings of the Advances in Cryptology, 2002

Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries.

M. V. N. Ashwin Kumar, K. Srinathan, C. Pandu Rangan

Proceedings of the Information Security and Privacy, 7th Australian Conference, 2002

2001

The K_r-Packing Problem.

Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong

Computing, 2001

Toward Optimal Player Weights in Secure Distributed Protocols.

K. Srinathan, C. Pandu Rangan, V. Kamakoti

Proceedings of the Progress in Cryptology, 2001

2000

On the Complexity of Partial Order Properties.

Stefan Felsner, Ravi Kant, C. Pandu Rangan, Dorothea Wagner

Order, 2000

On the Generative Power of Simple H Systems.

Lakshminarayanan Subramanian, Muralidhar Talupur, Kamala Krithivasan, C. Pandu Rangan

J. Autom. Lang. Comb., 2000

Approximation algorithms for the Traveling Salesman Problem with range condition.

D. Arun Kumar, C. Pandu Rangan

RAIRO Theor. Informatics Appl., 2000

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

Venkatesan Guruswami, C. Pandu Rangan

Discret. Appl. Math., 2000

Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation.

K. Srinathan, C. Pandu Rangan

Proceedings of the Progress in Cryptology, 2000

Efficient Asynchronous Secure Multiparty Distributed Computation.

K. Srinathan, C. Pandu Rangan

Proceedings of the Progress in Cryptology, 2000

1999

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

A. Arvind, C. Pandu Rangan

Inf. Process. Lett., 1999

1998

A Natural Family of Optimization Problems with Arbitrarily Small Approximation Thresholds.

Venkatesan Guruswami, C. Pandu Rangan

Inf. Process. Lett., 1998

Weighted Irredundance of Interval Graphs.

Maw-Shang Chang, P. Nagavamsi, C. Pandu Rangan

Inf. Process. Lett., 1998

Partial and Perfect Path Covers of Cographs.

David G. Kirkpatrick, Madhukar K. Reddy, C. Pandu Rangan, Anand Srinivasan

Discret. Appl. Math., 1998

On The g-centroidal Problem in Special Classes of Perfect Graphs.

C. Pandu Rangan, K. R. Parthasarathy, V. Prakash

Ars Comb., 1998

The Vertex-Disjoint Triangles Problem.

Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

Probabilistic Data Structures for Priority Queues (Extended Abstract).

Sridhar Ramachandran, K. Rajasekar, C. Pandu Rangan

Proceedings of the Algorithm Theory, 1998

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

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

Restrictions of Minimum Spanner Problems.

G. Venkatesan, Udi Rotics, M. S. Madanlal, Johann A. Makowsky, C. Pandu Rangan

Inf. Comput., 1997

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

Proceedings of the Fourth International on High-Performance Computing, 1997

1996

Approximate Triclique Coloring for Register Allocation.

G. Venkatesan, C. Pandu Rangan

Inf. Process. Lett., 1996

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

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

Inf. Process. Lett., 1996

Clique Transversal and Clique Independence on Comparability Graphs.

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

Inf. Process. Lett., 1996

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

Rohan F. M. Aranha, C. Pandu Rangan

Inf. Process. Lett., 1996

The Parity Path Problem on Some Subclasses of Perfect Graphs.

Satyan R. Coorg, C. Pandu Rangan

Discret. Appl. Math., 1996

All-pairs-shortest-length on Strongly Chordal Graphs.

V. Balachandhran, C. Pandu Rangan

Discret. Appl. Math., 1996

Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected Graph.

K. S. Easwarakumar, S. V. Krishnan, C. Pandu Rangan, S. Seshadri

Algorithmica, 1996

1995

Optimal Parallel Algorithms for Path Problems on Planar Graphs.

G. Srikrishna, C. Pandu Rangan

Theor. Comput. Sci., 1995

Systematic Design of an Algorithm for Biconnected Components.

K. Madhukar, D. Pavan Kumar, C. Pandu Rangan, R. Sundar

Sci. Comput. Program., 1995

Performance Bounds for Static Multiprocessor Scheduling of Multi-Task Jobs.

Sathi Mahesh, C. Siva Ram Murthy, C. Pandu Rangan

Parallel Process. Lett., 1995

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

V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan

Nord. J. Comput., 1995

Feedback vertex set on cocomparability graphs.

Satyan R. Coorg, C. Pandu Rangan

Networks, 1995

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

Rohan F. M. Aranha, C. Pandu Rangan

J. Univers. Comput. Sci., 1995

Efficient Parallel Algorithms for Permutation Graphs.

K. Arvind, V. Kamakoti, C. Pandu Rangan

J. Parallel Distributed Comput., 1995

Parallel Algorithms on Interval Graphs.

V. B. Balayogan, C. Pandu Rangan

RAIRO Theor. Informatics Appl., 1995

Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs.

Anand Srinivasan, K. Madhukar, P. Nagavamsi, C. Pandu Rangan, Maw-Shang Chang

Inf. Process. Lett., 1995

Modeling and simulation of dynamic job scheduling in multiprocessor systems.

Sathi Mahesh, C. Siva Ram Murthy, T. A. Gonsalves, C. Pandu Rangan

Int. J. Comput. Math., 1995

Efficient Dynamic Job Scheduling Algorithms for Multiprocessor Systems.

Saptarshi Mahesh, C. Siva Ram Murthy, C. Pandu Rangan

IEICE Trans. Inf. Syst., 1995

Efficient algorithms for minimal disjoint path problems on chordal graphs.

C. P. Gopalakrishnan, C. Pandu Rangan, Satyan R. Coorg

Discuss. Math. Graph Theory, 1995

A linear algorithms for the two paths problem on permutation graphs.

C. P. Gopalakrishnan, C. Pandu Rangan

Discuss. Math. Graph Theory, 1995

Edge-disjoint paths in permutation graphs.

C. P. Gopalakrishnan, C. Pandu Rangan

Discuss. Math. Graph Theory, 1995

Weighted Independent Perfect Domination on Cocomparability Graphs.

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

Discret. Appl. Math., 1995

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

V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

Treewidth of Circular-Arc Graphs.

Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan

SIAM J. Discret. Math., 1994

Efficient Parallel Shuffle Recognition.

Maurice Nivat, G. D. S. Ramkumar, C. Pandu Rangan, Ahmed Saoudi, Ravi Sundaram

Parallel Process. Lett., 1994

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

K. S. Easwarakumar, C. Pandu Rangan, Grant A. Cheston

Inf. Process. Lett., 1994

Weighted Irredundance of Interval Graphs.

C. Pandu Rangan, Maw-Shang Chang

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

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

P. Jagan Mohan, V. Kamakoti, C. Pandu Rangan

Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1993

Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs.

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

Theor. Comput. Sci., 1993

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

Arjun Raman, C. Pandu Rangan

Parallel Process. Lett., 1993

A Linear Algorithm for the All-Bidirectional-Edges Problem on Planar Graphs.

P. B. Ramprasad, C. Pandu Rangan

Algorithmica, 1993

Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs.

Hari Balakrishnan, Anand Rajaraman, C. Pandu Rangan

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

1992

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

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

Networks, 1992

An Optimal Algorithm for Reconstructing a Binary Tree.

V. Kamakoti, C. Pandu Rangan

Inf. Process. Lett., 1992

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

C. Pandu Rangan, Ramesh Govindan

Discret. Appl. Math., 1992

Generalized Vertex Covering in Interval Graphs.

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

Discret. Appl. Math., 1992

A Parallel Algorithm for Recognizing the Shuffle of Two Strings.

Ahmed Saoudi, Maurice Nivat, C. Pandu Rangan, Ravi Sundaram, G. D. S. Ramkumar

Proceedings of the 6th International Parallel Processing Symposium, 1992

1991

On Finding the Minimum Bandwidth of Interval Graphs

R. Mahesh, C. Pandu Rangan, Aravind Srinivasan

Inf. Comput., December, 1991

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

Aravind Srinivasan, C. Pandu Rangan

Theor. Comput. Sci., 1991

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

Srinivasa Rao Arikati, C. Pandu Rangan

Discret. Appl. Math., 1991

Efficient Reduction for Path Problems on Circular-Arc Graphs.

Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher

BIT, 1991

Treewidth of Circular-Arc Graphs (Abstract).

Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan

Proceedings of the Algorithms and Data Structures, 1991

1990

New Sequential and Parallel Algorithms for Interval Graph Recognition.

G. Ramalingam, C. Pandu Rangan

Inf. Process. Lett., 1990

Linear Algorithm for Optimal Path Cover Problem on Interval Graphs.

Srinivasa Rao Arikati, C. Pandu Rangan

Inf. Process. Lett., 1990

A Fast Algorithm for Computing Sparse Visibility Graphs.

S. Sudarshan, C. Pandu Rangan

Algorithmica, 1990

Parallel Algorithms on Interval Graphs.

G. D. S. Ramkumar, C. Pandu Rangan

Proceedings of the 1990 International Conference on Parallel Processing, 1990

1989

Algorithms for Weighted Graph Problems on The Modified Cellular Graph Automaton.

Suresh Venkatasubramanian, Kamala Krithivasan, C. Pandu Rangan

RAIRO Theor. Informatics Appl., 1989

Optimal Parallel Algorithms on Circular-Arc Graphs.

A. Srinivasa Rao, C. Pandu Rangan

Inf. Process. Lett., 1989

Linear Algorithm for Domatic Number Problem on Interval Graphs.

A. Srinivasa Rao, C. Pandu Rangan

Inf. Process. Lett., 1989

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

A. Srinivasa Rao, C. Pandu Rangan

Proceedings of the Algorithms and Data Structures, 1989

1988

A Unified Approach to Domination Problems on Interval Graphs.

G. Ramalingam, C. Pandu Rangan

Inf. Process. Lett., 1988

Total Domination in Interval Graphs Revisited.

G. Ramalingam, C. Pandu Rangan

Inf. Process. Lett., 1988

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

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

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1988

1987

A Linear Space Algorithm for the LCS Problem.

S. Kiran Kumar, C. Pandu Rangan

Acta Informatica, 1987

Competitive Location in the L₁ and L_INF Metrics.

Ramesh Govindan, C. Pandu Rangan

Proceedings of the Graph-Theoretic Concepts in Computer Science, International Workshop, 1987

New Parallel Algorithms for the Maximum Empty Rectangle Problem.

T. Hari Krishna Prasad, C. Pandurangan

Proceedings of the International Conference on Parallel Processing, 1987

1986

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

Ramesh Dewangan, C. Pandu Rangan

Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

1983

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

C. Pandu Rangan

J. Algorithms, 1983