REFEREED INTERNATIONAL CONFERENCES

64. Bhavani Shankar, Prasant Gopal, Kannan Srinathan, C. Pandu Rangan: Unconditionally reliable message transmission in directed networks. SODA 2008:1048-1055, 2008.
65. Shaik Maleka, Amjed Shareef, C. Pandu Rangan: Rational Secret Sharing with Repeated Games. ISPEC 2008:334-346, 2008.
66. Bhavani Shankar, Kannan Srinathan, C. Pandu Rangan: Alternative Protocols for Generalized Oblivious Transfer. ICDCN 2008:304-309, 2008.
67. Amjed Shareef, C. Pandu Rangan: On Optimal Probabilistic Asynchronous Byzantine Agreement. ICDCN 2008:86-98, 2008.
68. Arpita Patra, Ashish Choudhary, Madhu Vaidyanathan, C. Pandu Rangan: Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary. ACISP 2008:170-186, 2008.
69. Maleka S, Amjed Shareef and C. Pandu Rangan, The Deterministic Protocol for Rational Secret Sharing, The 4th International Workshop on Security in Systems and Networks (SSN 2008), USA, 2008.
70. Ashish Choudhary, Arpita Patra, AshwinKumar B.V, Kannan Srinathan and C. Pandu Rangan. Perfectly Reliable and Secure CommunicationTolerating Static and Mobile Mixed Adversary. Eprint Archive Technical Report 2008/232. A preliminary version appeared in Proc. of Information Theoretic Security, Third International Conference, ICITS 2008, pp 137 - 155, LNCS 5155, Springer Verlag, 2008.
71. AshwinKumar B. V, Arpita Patra, Ashish Choudhary, Kannan Srinathan and C. Pandu Rangan. On Tradeoff Between Network Connectivity, Phase Complexity and Communication Complexity of Reliable Communication Tolerating Mixed Adversary. To appear in Proc. of Twenty-SeventhAnnual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2008), ACM PODC 2008.
72. Kannan Srinathan, Ashish Choudhary, Arpita Patra and C. Pandu Rangan. Brief Announcement: Efficient Single Phase Unconditionally Secure Message Transmission with Optimum Communication Complexity. To appear in Proc. of Twenty-Seventh Annual ACM SIGACT SIGOPS Symposium on Principles of Distributed Computing (PODC 2008), ACM PODC 2008.
73. Arpita Patra, Ashish Choudhary and C. Pandu Rangan. Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited. Eprint Archive Technical Report 2008/262. A preliminary version appeared in Proc. of Sixth International Conference on Security and Cryptography for Networks, SCN 2008, pp 309-326, LNCS 5229, Springer Verlag, 2008.
74. S. Balasubramanian, S. Harini, C. Pandu Rangan, On Conditional Covering Problem, To appear in The 19th International Workshop on Combinatorial Algorithms (IWOCA 2008), 2008.
75. Sharmila Deva Selvi, S. Sree Vivek, Naga Naresh Karuturi, G. Ragavendran, C. Pandu Rangan, Cryptanalysis of Bohio et al.'s Identity Based Broadcast Signcryption (IBBSC) Scheme for Wireless Ad-Hoc Networks, To appear in IEEE Privacy Security and Trust (PST), 2008.
76. Varad Kirtane, C. Pandu Rangan, RSA-TBOS Signcryption with Proxy Re-encryption, To appear in The ACM Workshop on Digital Rights Management, 2008.
77. S. Sharmila Deva Selvi, S. Sree Vivek, Naga Naresh Karuturi, Deepanshu Shukla, C. Pandu Rangan, Efficient and Provably Secure Certificateless Multi-receiver Signcryption, To appear in LNCS ProvSec ’08, 2008.
78. Kannan Srinathan, Arpita Patra, Ashish Choudhary and C. Pandu Rangan, Unconditionally Reliable Hypergraphs. To appear in Proc. of Seventh International Conference on Cryptography and Network Security (CANS) 2008.
79. S. Sharmila Deva Selvi, S. Sree Vivek, G. Ragavendran, Naga Naresh Karuturi, C. Pandu Rangan, Cryptanalysis of Li et al.’s and Mu et al.’s Schemes and a Provably Secure ID-Based Broadcast Signcryption (IBBSC) Scheme, To appear in LNCS The 9th International Workshop on Information Security Applications (WISA), 2008.
80. S. Sharmila Deva Selvi, S. Sree Vivek, Neha Jain, C. Pandu Rangan, Cryptanalysis of Li et al.’s Threshold Signcryption Scheme, To appear in IEEE/IFIP Trust Security and Privacy for Pervasive Applications(TSP), 2008.
81. Meena Singh and C. PANDU RANGAN, Privacy Preserving Access and Query Evaluation framework for Multiserver Environment, Australian Information Security Workshop : Privacy Enhancing Technologies (AISW), Australia, Eds. Ljiljana Brankovic, Paul Coddington, John F. Roddick, Chris Steketee, Jim Warren and Andrew Wendelborn, Vol. 68, January 2007.
82. P. Krishna Prasad and C. PANDU RANGAN, Privacy preserving CACTUS for clustering vertically partitioned categorical databases'', DMIN 07, June 2007.
83. Amjed Shareef and C. PANDU RANGAN, Efficient Protocol for Approximate Agreement, The 2007 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 07), 2007.
84. Kannan Srinathan, Prasad Raghavendra and C. PANDU RANGAN, On Proactive Perfectly Secure Message Transmission, 12th Australisian Conference on Information Security and Privacy (ACISP 07), Australia, July 2007.
85. Kannan Srinathan, N.R. Prasad and C. PANDU RANGAN, On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication, 2007 IEEE Symposium on Security and Privacy, USA, May 2007.
86. Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Constant phase efficient protocols for secure message transmission in directed networks. PODC 2007:322-323, 2007.
87. Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality. INDOCRYPT 2007:101-122, 2007.
88. Avinash V. Varadarajan, Ramarathnam Venkatesan, C. Pandu Rangan: Data structures for limited oblivious execution of programs while preserving locality of reference. Digital Rights Management Workshop 2007:63-69, 2007.
89. Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan: Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary. DISC 2007:496-498, 2007.
90. Arpita Patra, Bhavani Shankar, Ashish Choudhary, K. Srinathan, C. Pandu Rangan: Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary. CANS 2007:80-101, 2007.
91. P. Krishna Prasad, C. Pandu Rangan: Privacy Preserving BIRCH Algorithm for Clustering over Arbitrarily Partitioned Databases. ADMA 2007:146-157, 2007.
92. K. Anil Kumar, C. Pandu Rangan: Privacy Preserving DBSCAN Algorithm for Clustering. ADMA 2007:57-68, 2007.
93. Ravi Sundaram, Guevara Noubir, Rajsekar Manokaran, Abishek Kumarasubramaniam, Ravi Chandra, C. PANDU RANGAN, STEGANOGRAPHIC COMMUNICATION IN ORDERED CHANNELS, IH 2006, Information Hiding 2006, July 2006.
94. Matthias Fitzi (Aarhus Univ.) and Juan Garay (Bell Labs) and Shyamnath Gollakota (IIT Madras) and C. PANDU RANGAN (IIT Madras) and Kannan Srinathan (International Institute of Information Technology, Hyderabad, India), Round optimal and efficient Verifiable secret sharing, Theorical Cryptography Conference (TCC 2006), (LNCS Series), Vol 3876, pp. 329-342, 2006.
95. Ravi Sundaram, Guevara Noubir, Rajsekar Manokaran, Abishek Kumarasubramaniam, Ravi Chandra, C. PANDU RANGAN, STEGANOGRAPHIC COMMUNICATION IN ORDERED CHANNELS, IH 2006, Information Hiding 2006, July 2006.
96. Kannan Srinathan, C. PANDU RANGAN, Possibility and Complexity of Probabilistic Reliable Communication in Directed Networks, (PODC 2006), pp. 265-274, July 2006.
97. R.C. Chakinala, A. Kumarasubramanian, K. A. Laing, R. Manokaran, C. PANDU RANGAN and R. Rajaraman, Playing Push vs Pull: Models and Algorithms for Disseminating Dynamic Data in Networks, SPAA 2006, July 2006.
98. N. Krishna Suri and C. PANDU RANGAN, A Novel Scheme for Single Database Symmetric Private Information Retrieval, Applied Cryptography and Information Security 06, Glasgow, UK, 2006.
99. Arpita Patra, Ashish Choudhary, K. Srinathan, C. Pandu Rangan: Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission. INDOCRYPT 2006:221-235, 2006.
100. Arvind Narayanan, K. Srinathan, C. Pandu Rangan: Perfectly Re- liable Message Transmission. Inf. Process. Lett. (IPL) 100(1):23-28 2006.
101. P. Krishna Prasad and C. PANDU RANGAN, Privacy preserving BIRCH algorithm for clustering over vertically partitioned databases, Proceedings of 3rd VLDB Workshop on Secure Data Management (SDM 06), Springer Lecture Notes in Computer Science, Vol. 4165, pp. 84-99, Seoul, Korea, September 2006.
102. K. Srinathan, Arvind Narayanan and C. PANDU RANGAN, Optimal Perfectly Secure Message Transmission, 24th International Cryptology Conference, (CRYPTO 2004), (LNCS Series), Vol. 3152, pp. 545-561, 2004.
103. D.V.S Ravikant, V. Muthuramakrishnan, V. Srikanth, K. Srinathan and C. PANDU RANGAN, On Byzantine Agreement over (2,3) - Uniform Hypergraphs, 18th International Conference, (DISC 2004), (LNCS Series), Vol. 3274, pp. 450-464, 2004.
104. V. Muthuramakrishnan, D.V.S. Ravikant, V. Srikanth, K. Srinathan and C. PANDU RANGAN, On the Round Complexity of Distributed Consensus over Synchronous Networks, (PODC 2004), 2004.
105. K. Srinathan, V. Vinod and C. PANDU RANGAN, Brief Announcement : Efficient Perfectly Secure Communication over Synchronous Networks, 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), page 252, 2003.
106. S. Amitanand, I. Sanketh, K. Srinathan, V. Vinod and C. PANDU RANGAN, Distributed Consensus in the Presence of Sectional Faults, 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), pp. 202-210, 2003.
107. Arvind Narayanan, C. PANDU RANGAN and Kwangjo Kim, Practical Pay TV Schemes, 8th Australasian Conference on Information Security and Privacy (ACISP 2003), (LNCS Series) Vol. 2727, pp. 192-203, 2003.
108. V. Vinod, Arvind Narayanan, K. Srinathan, C. PANDU RANGAN and Kwangjo Kim, On the Power of Computational Secret Sharing, 4th International Conference on Cryptology in India (INDOCRYPT 2003), (LNCS Series), Vol. 2904, pp. 162-176, 2003.
109. M.V.N. Ashwin Kumar, Pranava.R. Goundan, K. Srinathan and C. PANDU RANGAN, On Perfectly Secure Communication over Arbitrary Networks, Proceedings, 21st Annual ACM Symposium on Principles of Distributed Computing (PODC 2002), pp. 193-202, 2002.
110. M.V.N. Ashwin Kumar, K. Srinathan and C. PANDU RANGAN, Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries, Proceedings, 7th Australasian Conference on Information Security and Privacy (ACISP 2002), (LNCS Series) Vol. 2384, (eds.) Lynn Batten and Jennifer Seberry, pp. 497-511, 2002.
111. K. Srinathan, Pranava.R. Goundan, M.V.N. Ashwin Kumar, R. Nandakumar and C. PANDU RANGAN, Theory of Equal-Flows in Networks, Proceedings, 8th Annual International Computing and Combinatorics Conference (COCOON 2002), (LNCS Series) Vol. 2387, (eds). Oscar H. Ibarra and Louxin Zhang, pp. 514-524, 2002.
112. B. Prabhu, K. Srinathan and C. PANDU RANGAN, Trading Players for Efficiency in Unconditional Multiparty Computation, Proceedings, 3rd Conference on Security in Communication Networks (SCN 02), (LNCS Series), Vol. 2576, pp. 348-359, 2002.
113. K. Srinathan, M.V.N. Ashwin Kumar and C. PANDU RANGAN, Asynchronous Secure Communication Tolerating Mixed Adversaries, Proceedings, 8th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2002), (LNCS Series) Vol. 2501, (ed.) Yulian Zheng, pp. 224-242, 2002.
114. K. Srinathan, N. Tharani Rajan and C. PANDU RANGAN, Non-perfect Secret Sharing over General Access Structures, Proceedings, 3rd International Conference on Cryptology in India (INDOCRYPT 2002), (LNCS Series), Vol. 2551, pp. 409-421, 2002.
115. B. Prabhu, K. Srinathan and C. PANDU RANGAN, Asynchronous Unconditionally Secure Computation : An Efficiency Improvement, Proceedings, 3rd International Conference on Cryptology in India (INDOCRYPT 2002), (LNCS Series), Vol. 2551, pp. 93-107, 2002.
116. C.PANDU RANGAN, A methodology for Teaching Data Structures and Algorithms using web technology, MD TCE-2001, Bahrain, April, 2001.
117. K.Srinivas, C.PANDU RANGAN, S.V.Raghavan, A New Adaptive Forward Error Correction Scheme for ATM and Wireless ATM Networks, 2001. IEEE Pacific RIM Conference on Communications, Computers and Signal Processing, PACRIM'01, Canada, August 2001.
118. K. Srinathan, C. PANDU RANGAN and V. Kamakoti, Toward Optimal Player Weights in Secure Distributed Protocols, Proceedings of Progress in Cryptology-INDOCRYPT 2001, (LNCS Series) Vol. 2247, pp. 232-241, Springer-Verlag, December 2001.
119. K. Srinivas, C. PANDU RANGAN, Efficient Interleaving Scheme for AFEC code over ATM and Wireless ATM Networks, International Symposium on Communications (ISCOM'01), 2001.
120. K. Srinathan and C. PANDU RANGAN, Efficient Asynchronous Secure Multiparty Distributed Computation, Proceedings of Progress in Cryptology-INDOCRYPT 2000, (LNCS Series) Vol. 1977, pp. 117-130, Springer-Verlag, December, 2000.
121. K. Srinathan and C. PANDU RANGAN, Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation, Proceedings of Progress in Cryptology-INDOCRYPT 2000, (LNCS Series) Vol. 1977, pp. 130-143, Springer-Verlag, December 2000.
122. R.Sridhar, K.Rajasekar, C.PANDU RANGAN, Probabilistic priority Queues, SWAT 88, Sweeden, pp. 143-154, July 1998.
123. T.Graf, V.Kamakoti, N.S.Janakilatha and C.PANDU RANGAN, The Coloured Sector Search Tree : A dynamic data structure for efficient higher dimentional nearest - foreign neighbour queries, CACOON-98, pp. 34-44, Taiwan, 1998.
124. Venkatesan Guruswamy, C.PANDU RANGAN, M.S.Chang, G.J.Chang and C.K.Wong, The vertext-disjoint triangles problem, Workshop on Graph Theoretic Concepts in Computer Science, (WG-98), Slovakia, pp. 26-37, June 1998.
125. H. Balakrishnan, A. Rajaraman, C. PANDU RANGAN and C.K. Wong, The Even Adjacency Split Problem on Certain Classes of Perfect Graphs, Accepted for presentation in 1996 International Computer Symposium (ICS'96), Taiwan, December, 1996.
126. A.J. Preetham, Kamala Krithivasan, C. PANDU RANGAN and Jop F. Sibeyn, Parallel Algorithm for Maximum Empty L-shaped Polygon, Accepted for presentation in the International Conference on High Performance Computing, Trivandrum, December, 1996.
127. V. Kamakoti, Kamala Krithivasan, C. PANDU RANGAN, Efficient Randomized Algorithm for the Closest Pair Problem Using Leafary Trees, Accepted for presentation in the First Annual International Computing and Combinatorics Conference (COCOON'95), Xi'an, China, pp. 71-80, August 24-26, 1995.
128. P.Jagan Mohan, V.Kamakoti, C.PANDU RANGAN, Efficient Parallel Randomised Algorithm for Closest Pair problem in D_Dimensions (Appeared in) Proceedings IFIP 94. World Computer Congress, Hamburg, Germany, pp. 547-552, Sept, 1994.
129. C.P.Gopalakrishnan, C.PANDU RANGAN, Edge Disjoint Paths in Permutation Graphs ISSAC '94, Beijing, China, (Appeared in) Lecture Notes in Computer Science Series, Springer Verlag, pp. 208-216, Aug, 1994.
130. C.PANDU RANGAN, M.S.Chang, Irredundance on Weighted Interval Graphs, ISSAC '94, Beijing, China, (Appeared in)LNCS Series, Springer Verlag, pp. 567-574, Aug, 1994.
131. R.Anand, Hari Balakrishnan, C.PANDU RANGAN, Connected Domination and Steiner Sets on AT-Free Graphs, WADS, 93 (Appeared in Proceedings) LNCS Series, Springer Verlag, pp. 131-141, Aug, 1993.
132. G.J.Chang, C.R.Satyan, C.PANDU RANGAN, Private Domination On Weighted Co Comparability Graphs, ISSAC 1993, Hong Kong, Dec, 1993 (Appeared in Proceedings) LNCS Series, Springer Verlag, pp. 506-514, 1993.
133. A.Saoudi, M.Nivat, C.PANDU RANGAN, Ravi Sundaram, GDS.Ram Kumar, A Parallel Algorithm for Recognising the Schuffle of Two Strings, 6th International Parallel Processing Symposium, March 23 - 26, 1992.
134. Ravi Sundaram, Karan Sher singh, C.PANDU RANGAN, Tree width of a circular arc graph, WADS' 91, OTTAWA, CANADA, Aug, 1991. (Appeared in Springer Verlag LNCS Series).
135. GDS.Ramkumar, C.PANDU RANGAN, Efficient Parallel Algorithm on Interval Graphs, International Conference on Parallel Processing, ICPP' 90, Aug, 1990, Penn, U.S.A (Appeared in Proceedings).
136. Shyamsundar Ragini, Kamala Krithivasan, S.Venkatasubramanian, C. PANDU RANGAN, Modified Cellular Graph Automation, FRG, March, 1990.
137. G.K.Manacher, Arikati Srinivasa Rao, C.PANDU RANGAN, Chord free path problem on interval graphs, 28^th Annual Allerton conference on Communications, Controls, and Computing October 3 - 5, 1990. (Appeared in Proceedings).
138. A. Srinivasa Rao, C.PANDU RANGAN, Optimal parallel algorithm on circular arc graphs, FSTTCS89, Proceedings, (LNCS Series), pp. 44-55, 1989.
139. A. Srinivasa Rao, C.PANDU RANGAN, Efficient algorithms for some path problems on circular-arc graphs, Accepted at WADS' 89, OTTAWA, CANADA, August 1989 (Appeared in Proceedings, Springer Verlag, Lecture Notes in Computer Science, LNCS 382).
140. Govindan Ramesh, C. PANDU RANGAN, Competitive Location in the L1 and Line Metrics, Proceedings, WG'87, Lecture Notes in Computer Science, Vol. 314, (ed). H.Gottler, H.J.Schneider, Springer Verlag, pp. 70 - 83, 1988.
141. S.V.Krishnan, C.PANDU RANGAN, S.Seshadri, A New Linear Algorithm for two path problem on Chordal graphs, FSTTCS8, PUNE, INDIA, Proceedings, Lecture Notes In Computer Science, Vol. 338, (ed). K.V.Noori, pp 49 - 66, 1988.
142. Ramesh Dewangam, C. PANDU RANGAN, A Simple Implementation of Warshall's Algorithm on a VLSI Chip, International Workshop on Graph Theoretic Concepts in Computer Science WG86, Munich, West Germany, July 1986. Proceedings, Lecture Notes in Computer Science Vol. 246, (ed). G. Tinhofer, G. Schmidt, Springer Verlag, pp. 131 - 146, 1987.
143. Hari Krishna Prasad, C.PANDU RANGAN, New Efficient Parallel algorithm for Maximum empty rectangle problem, 16^th Annual International Conference on Parallel Processing, Pennsylvania, USA, August 1987. (Appeared in Proceedings).
144. B. Patkar, C.PANDU RANGAN, Efficient Permutation Algorithms on Mesh Connected Computers, International conference on Parallel Processing and Applications, L'Aqula, Italy, September, 1987. (Appeared in Proceedings Published by North Holland).
145. B. Krishna Prasad, C. PANDU RANGAN, Efficient Mapping of Warshall's Algorithm on Mesh Connected Architectures, Workshop on Future Direction in Computer Architecture and Software, South Carolina, USA, May 5-7, 1986.
146. Atul Saini, C.PANDU RANGAN, Efficient Systolic implementation of Warshalls's algorithm, IEEE Workshop on Languages for Automation, Singapore, 27 - 29, August 1986. (Appeared in proceedings).
147. C. PANDU RANGAN, Comparison of Different Models of Graph Grammars, International Workshop on Graph Theoretic concepts in Computer Science, WG84, Berlin, West Germany, June 16 - 19, 1984.
148. C. PANDU RANGAN, Graph Grammars for Generating Graphs with Prescribed Properties, International Workshop on Graph Theoretic Concepts in Computer Science, WG83, Osnabruck, West Germany, June, 1983.