C
C. Pandu Rangan
Researcher at Indian Institute of Technology Madras
Publications - 323
Citations - 3833
C. Pandu Rangan is an academic researcher from Indian Institute of Technology Madras. The author has contributed to research in topics: Random oracle & Encryption. The author has an hindex of 31, co-authored 322 publications receiving 3613 citations. Previous affiliations of C. Pandu Rangan include Indian Institutes of Technology & University of Illinois at Chicago.
Papers
More filters
Journal ArticleDOI
A unified approach to domination problems on interval graphs
TL;DR: Une propriete tres simple des graphes intervalle is utilisee dans la realisation d'algorithmes a temps lineaire, developpes pour la resolution de differents problemes de domination as mentioned in this paper.
Journal ArticleDOI
Linear algorithm for optimal path cover problem on interval graphs
S. Rao Arikati,C. Pandu Rangan +1 more
TL;DR: This work presents a linear algorithm for this problem on interval graphs, given the adjacency lists of an interval graph with n vertices and m edges, that runs in O(m+n) time.
BookDOI
Progress in Cryptology – INDOCRYPT 2007
TL;DR: Thank you for reading progress in cryptology indocrypt 2004 5th international conference on cryptology in india chennai india december 20 22 2004 proceedings.
Proceedings ArticleDOI
On perfectly secure communication over arbitrary networks
TL;DR: It is shown that perfectly secure communication among any pair of players is possible if and only if the union of no two sets in the adversary structure is a vertex cutset of the synchronous network.
Book ChapterDOI
Optimal Perfectly Secure Message Transmission
TL;DR: In the perfectly secure message transmission (PSMT) problem, two synchronized non-faulty players (or processors), the Sender S and the Receiver R are connected by n wires (each of which facilitates 2-way communication); after exchanging messages in phases R should correctly obtain S’s message.