C. P. Rangan

发表

Privacy preserving access and query evaluation framework for multiserver environment

M. Singh, C. P. Rangan, 2007 .

A special purpose proxy re-signature scheme

C. C. Sobin, C. P. Rangan, S. S. Vivek, 2012, 2012 International Conference on Innovations in Information Technology (IIT).

A new adaptive forward error correction scheme for ATM and wireless ATM networks

S. V. Raghavan, K. Srinivas, C. P. Rangan, 2001, 2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233).

Proceedings 13 Volume Editors

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

A Unified Approach to Domination Problems on Interval Graphs

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

Practical Pay TV Schemes

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

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

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

Optimal Perfectly Secure Message Transmission

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

On the Power of Computational Secret Sharing

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

Relaxed Fibonacci heaps : An alternative to Fibonacci heaps with worst case rather than amortized time bounds ∗

C. P. Rangan, Chandrasekhar Boyapati, 2002 .

E � cient and Provably Secure Identity Based Aggregate Signature Schemes With Partial and Full Aggregation

C. P. Rangan, S. S. D. Selvi, S. Vivek, 2012 .

Optimal Multi-Valued Asynchronous Broadcast and Asynchronous Byzantine Agreement

C. P. Rangan, A. Choudhary, A. Patra, 2009 .

Efficient Asynchronous Secure Multiparty Distributed Computation

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

Stronger Public Key Encryption Schemes Withstanding RAM Scraper Like Attacks

C. P. Rangan, S. S. D. Selvi, S. Vivek, 2012, IACR Cryptol. ePrint Arch..

A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs 193 3 Biconvex Orderings and Monotone Paths

C. P. Rangan, N. Narayanaswamy, Esha Ghosh, 2010 .

Breaking and Re-Building a Certificateless Hybrid Signcryption Scheme

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

Formal Grammar

John C. Mitchell, Israel Bernhard Steffen, C. P. Rangan, 2017, Lecture Notes in Computer Science.

Advances in Software Engineering Techniques

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

Optimal Parallel Algorithms on Circular-Arc Graphs

C. P. Rangan, A. S. Rao, 1989, Inf. Process. Lett..

Probabilistic Data Structures for Priority Queues ( Extended

C. P. Rangan, K. Rajasekar, R. Sridhar, 2002 .

Towards a Cooperative Defense Model Against Network Security Attacks

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

Non-transferability in Proxy Re-Encryption Revisited

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

Proceedings of the 10th International Symposium on Algorithms and Computation

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

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

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

A Variant of Non-Adaptive Group Testing and Its Application in Pay-Television via Internet

John C. Mitchell, C. P. Rangan, Doug J. Tygar, 2018 .

A Practical Solution against Corrupted Parties and Coercers in Electronic Voting Protocol over the Network

C. P. Rangan, Doug J. Tygar, Moshe Y. Vardi, 2018 .

EFFICIENT CONDITIONAL PROXY RE- ENCRYPTION WITH CHOSEN CIPHER TEXT SECURITY

C. P. Rangan, S. S. D. Selvi, S. Vivek, 2012 .

Parallel algorithm for maximum empty L-shaped polygon

J. F. Sibeyn, C. P. Rangan, K. Krithivasan, 1996 .

On the Generative Power of Simple H Systems

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

Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation

C. P. Rangan, Ashish Choudhury, A. Patra, 2013, Journal of Cryptology.

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.

Asynchronous Byzantine Agreement with optimal resilience

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

Secure message transmission in asynchronous networks

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

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

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

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..

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.

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

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

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

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

Round Efficient Unconditionally Secure Multiparty Computation Protocol

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

Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited

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

Efficient Asynchronous Byzantine Agreement with Optimal Resilience

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

Unconditionally Secure Multiparty Set Intersection Re-Visited

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

Collusion Free Protocol for Correlated Element Selection Problem

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

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..

Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience

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

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

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

Information Theoretically Secure Multi Party Set Intersection Re-Visited

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

Efficient Asynchronous Multiparty Computation with Optimal Resilience

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

Probabilistic Data Structures for Priority Queues (Extended Abstract)

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

Notes in Computer Science 5646

John C. Mitchell, C. P. Rangan, M. Naor, 2009 .

Optimal Parallel Algorithms for Path Problems on Planar Graphs

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

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

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

Efficiently Obfuscating Re-Encryption Program Under DDH Assumption

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

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

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

Certificateless KEM and Hybrid Signcryption Schemes Revisited

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

Identity Based Aggregate Signcryption Schemes

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

An Efficient Identity-Based Signcryption Scheme for Multiple Receivers

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

Efficient and Provably Secure Certificateless Multi-receiver Signcryption

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

A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs

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

Pathwidth and Searching in Parameterized Threshold Graphs

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

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

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

Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs

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

Competitive Location in the L1 and LINF Metrics

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

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.

New approach to practical leakage-resilient public-key cryptography

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

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

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