C. Pandu Rangan

327 papers A* 14A 6B 26C 29Misc 42Journal 167Unranked 40
YearRankTypeTitle / Venue / Authors
2025 J jnl
An Efficient Sequential Aggregate Signature Scheme with Lazy Verification.
IACR Cryptol. ePrint Arch.
Arinjita Paul, Sabyasachi Dutta, Kouichi Sakurai, C. Pandu Rangan
2023 J jnl
Compact Identity Based Encryption Based on n^{th} - Residuosity Assumption.
IACR Cryptol. ePrint Arch.
S. Sree Vivek, S. Sharmila Deva Selvi, Ramarathnam Venkatesan, C. Pandu Rangan
2023 B conf
Forward Security Under Leakage Resilience, Revisited.
CANS
Suvradip Chakraborty, Harish Karthikeyan, Adam O'Neill, C. Pandu Rangan
2022 J jnl
Efficient Lattice based (H)IB-DRE.
J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl.
Kunwar Singh, C. Pandu Rangan, Ilsun You, Amalan Joseph Antony, S. K. Karthika, Jiyoon Kim
2021 — conf
A Distributed Ledger Management Mechanism for Storing and Selling Private Data.
DSC
Sabyasachi Dutta, Arinjita Paul, Rocki H. Ozaki, C. Pandu Rangan, Kouichi Sakurai
2021 J jnl
A Provably Secure Conditional Proxy Re-Encryption Scheme without Pairing.
J. Internet Serv. Inf. Secur.
Arinjita Paul, S. Sharmila Deva Selvi, C. Pandu Rangan
2021 J jnl
Efficient single round attribute-based authenticated key exchange protocol.
Int. J. Comput. Math. Comput. Syst. Theory
Suvradip Chakraborty, Y. Sreenivasa Rao, C. Pandu Rangan
2021 J jnl
Lattice-based unidirectional Proxy Re-Encryption and Proxy Re-Encryption+ schemes.
IET Inf. Secur.
Kunwar Singh, C. Pandu Rangan, Samir Sheshank, Richa Agrawal
2020 J jnl
Cache Me if You Can: Capacitated Selfish Replication Games in Networks.
Theory Comput. Syst.
Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram
2020 Misc conf
Efficient Attribute-Based Proxy Re-Encryption with Constant Size Ciphertexts.
INDOCRYPT
Arinjita Paul, S. Sharmila Deva Selvi, C. Pandu Rangan
2020 J jnl
Forward-Security Under Continual Leakage with Deterministic Key Updates.
IACR Cryptol. ePrint Arch.
Suvradip Chakraborty, Harish Karthikeyan, Adam O'Neill, C. Pandu Rangan
2020 C conf
Improving Accuracy of Differentially Private Kronecker Social Networks via Graph Clustering.
ISNCC
Arinjita Paul, Vorapong Suppakitpaisarn, Mitali Bafna, C. Pandu Rangan
2020 J jnl
Non-transferability in Proxy Re-Encryption Revisited.
J. Internet Serv. Inf. Secur.
Arinjita Paul, Lihua Wang, S. Sharmila Deva Selvi, C. Pandu Rangan
2020 J jnl
Provably secure lattice based identity based unidirectional PRE and PRE+ schemes.
J. Inf. Secur. Appl.
Kunwar Singh, C. Pandu Rangan, Richa Agrawal, Samir Sheshank
2020 — conf
Two-Stage Framework for Accurate and Differentially Private Network Information Publication.
CSoNet
Maneesh Babu Adhikari, Vorapong Suppakitpaisarn, Arinjita Paul, C. Pandu Rangan
2019 — conf
A Closer Look at Anonymous Proxy Re-Encryption Schemes.
SpaCCS
S. Sharmila Deva Selvi, S. Harish, Swethashree Dhanabal, C. Pandu Rangan
2019 J jnl
A Provably Secure Conditional Proxy Re-Encryption Scheme without Pairing.
IACR Cryptol. ePrint Arch.
Arinjita Paul, S. Sharmila Deva Selvi, C. Pandu Rangan
2019 J jnl
Attribute-based Proxy Re-Encryption with Constant Size Ciphertexts.
IACR Cryptol. ePrint Arch.
Arinjita Paul, S. Sharmila Deva Selvi, C. Pandu Rangan
2019 J jnl
Cryptanalysis of a pairing-free certificate-based proxy re-encryption scheme for secure data sharing in public clouds.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, Irene Miriam Isaac, C. Pandu Rangan
2019 B conf
Public Key Encryption Resilient to Post-challenge Leakage and Tampering Attacks.
CT-RSA
Suvradip Chakraborty, C. Pandu Rangan
2019 Misc conf
Reoptimization of Path Vertex Cover Problem.
COCOON
Mehul Kumar, Amit Kumar, C. Pandu Rangan
2019 J jnl
Reoptimization of Path Vertex Cover Problem.
CoRR
Mehul Kumar, Amit Kumar, C. Pandu Rangan
2019 — conf
Sharing of Encrypted Files in Blockchain Made Simpler.
MARBLE
S. Sharmila Deva Selvi, Arinjita Paul, Siva Dirisala, Saswata Basu, C. Pandu Rangan
2019 J jnl
Sharing of Encrypted files in Blockchain Made Simpler.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, Arinjita Paul, Siva Dirisala, Saswata Basu, C. Pandu Rangan
2019 — conf
Smart Contract-Driven Mechanism Design to Mitigate Information Diffusion in Social Networks.
MARBLE
Arinjita Paul, Vorapong Suppakitpaisarn, C. Pandu Rangan
2019 — conf
Splitting and Aggregating Signatures in Cryptocurrency Protocols.
DAPPCON
S. Sharmila Deva Selvi, Arinjita Paul, C. Pandu Rangan, Siva Dirisala, Saswata Basu
2018 C conf
A CCA-Secure Collusion-Resistant Identity-Based Proxy Re-Encryption Scheme.
ProvSec
Arinjita Paul, Varshika Srinivasavaradhan, S. Sharmila Deva Selvi, C. Pandu Rangan
2018 J jnl
A CCA-secure collusion-resistant Identity-based Proxy Re-encryption Scheme.
IACR Cryptol. ePrint Arch.
Arinjita Paul, Varshika Srinivasavaradhan, S. Sharmila Deva Selvi, C. Pandu Rangan
2018 J jnl
A Provably-Secure Unidirectional Proxy Re-Encryption Scheme Without Pairing in the Random Oracle Model.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, Arinjita Paul, C. Pandu Rangan
2018 J jnl
Public Key Encryption Resilient to Post-Challenge Leakage and Tampering Attacks.
IACR Cryptol. ePrint Arch.
Suvradip Chakraborty, C. Pandu Rangan
2017 J jnl
An Efficient Certificateless Proxy Re-Encryption Scheme without Pairing.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, Arinjita Paul, C. Pandu Rangan
2017 — conf
An Efficient Non-transferable Proxy Re-encryption Scheme.
ATIS
S. Sharmila Deva Selvi, Arinjita Paul, C. Pandu Rangan
2017 — conf
Efficient Compilers for After-the-Fact Leakage: From CPA to CCA-2 Secure PKE to AKE.
ACISP (1)
Suvradip Chakraborty, Goutam Paul, C. Pandu Rangan
2017 J jnl
Efficient Compilers for After-the-Fact Leakage: from CPA to CCA-2 secure PKE to AKE.
IACR Cryptol. ePrint Arch.
Suvradip Chakraborty, Goutam Paul, C. Pandu Rangan
2017 C conf
Identity-Based Group Encryption Revisited.
ICICS
Kanika Gupta, S. Sharmila Deva Selvi, C. Pandu Rangan, Shubham Sopan Dighe
2017 C conf
Leakage-Resilient Non-interactive Key Exchange in the Continuous-Memory Leakage Setting.
ProvSec
Suvradip Chakraborty, Janaka Alawatugoda, C. Pandu Rangan
2017 J jnl
Leakage-Resilient Tweakable Encryption from One-Way Functions.
IACR Cryptol. ePrint Arch.
Suvradip Chakraborty, Chester Rebeiro, Debdeep Mukhopadhyay, C. Pandu Rangan
2017 J jnl
New Approach to Practical Leakage-Resilient Public-Key Cryptography.
IACR Cryptol. ePrint Arch.
Suvradip Chakraborty, Janaka Alawatugoda, C. Pandu Rangan
2017 J jnl
On the security of a Certificateless Proxy Re-Encryption Scheme without Pairing.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, Arinjita Paul, C. Pandu Rangan
2016 J jnl
A Pairing-Free, One Round Identity Based Authenticated Key Exchange Protocol Secure Against Memory-Scrapers.
IACR Cryptol. ePrint Arch.
Suvradip Chakraborty, Srinivasan Raghuraman, C. Pandu Rangan
2016 J jnl
A Pairing-Free, One Round Identity Based Authenticated Key Exchange Protocol Secure Against Memory-Scrapers.
J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl.
Suvradip Chakraborty, Srinivasan Raghuraman, C. Pandu Rangan
2016 J jnl
Formalizing the Relationship Between Commitment and Basic Cryptographic Primitives.
J. Internet Serv. Inf. Secur.
S. Sree Vivek, S. Sharmila Deva Selvi, Pallavi Chandrasekar, C. Pandu Rangan
2016 J jnl
Lattice-based identity-based resplittable threshold public key encryption scheme.
Int. J. Comput. Math.
Kunwar Singh, C. Pandu Rangan, A. K. Banerjee
2015 J jnl
An Efficient Multiple PKG Compatible Identity Based Key Agreement for Vehicular Networks.
IACR Cryptol. ePrint Arch.
Harish Karthikeyan, Suvradip Chakraborty, Kunwar Singh, C. Pandu Rangan
2015 — conf
Certificateless Proxy Re-Encryption Without Pairing: Revisited.
SCC@ASIACCS
Akshayaram Srinivasan, C. Pandu Rangan
2015 J jnl
Constant Size Ring Signature Without Random Oracle.
IACR Cryptol. ePrint Arch.
Priyanka Bose, Dipanjan Das, C. Pandu Rangan
2015 J jnl
Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation.
J. Cryptol.
Arpita Patra, Ashish Choudhury, C. Pandu Rangan
2015 J jnl
Efficient, Pairing-Free, One Round Attribute-Based Authenticated Key Exchange.
IACR Cryptol. ePrint Arch.
Suvradip Chakraborty, Srinivasan Raghuraman, C. Pandu Rangan
2015 J jnl
Efficiently Obfuscating Re-Encryption Program under DDH Assumption.
IACR Cryptol. ePrint Arch.
Akshayaram Srinivasan, C. Pandu Rangan
2015 C conf
Forward-Secure Authenticated Symmetric Key Exchange Protocol: New Security Model and Secure Construction.
ProvSec
Suvradip Chakraborty, Goutam Paul, C. Pandu Rangan
2015 J jnl
Lattice Based Mix Network for Location Privacy in Mobile System.
Mob. Inf. Syst.
Kunwar Singh, C. Pandu Rangan, A. K. Banerjee
2015 C conf
Practical IBE Secure under CBDH - Encrypting Without Pairing.
SECRYPT
S. Sree Vivek, S. Sharmila Deva Selvi, Aanchal Malhotra, C. Pandu Rangan
2014 J jnl
Asynchronous Byzantine Agreement with optimal resilience.
Distributed Comput.
Arpita Patra, Ashish Choudhury, C. Pandu Rangan
2014 J jnl
Certificateless Proxy Re-Encryption Without Pairing.
IACR Cryptol. ePrint Arch.
Akshayaram Srinivasan, C. Pandu Rangan
2014 — conf
Certificateless and Identity based Authenticated Key Exchange Protocols.
ICETE (Selected Papers)
Saikrishna Badrinarayanan, C. Pandu Rangan
2014 — conf
Cryptanalysis of Unidirectional Proxy Re-Encryption Scheme.
ICT-EurAsia
Kunwar Singh, C. Pandu Rangan, A. K. Banerjee
2014 — conf
Efficient Lattice HIBE in the Standard Model with Shorter Public Parameters.
ICT-EurAsia
Kunwar Singh, C. Pandu Rangan, A. K. Banerjee
2014 J jnl
Guest Editorial: Special Issue on Cyber Security Protections and Applications.
J. Internet Serv. Inf. Secur.
Kunwar Singh, C. Pandu Rangan, A. K. Banerjee
2014 — conf
Lattice Based Identity Based Unidirectional Proxy Re-Encryption Scheme.
SPACE
Kunwar Singh, C. Pandu Rangan, A. K. Banerjee
2014 J jnl
Lattice Based Universal Re-encryption for Mixnet.
J. Internet Serv. Inf. Secur.
Kunwar Singh, C. Pandu Rangan, A. K. Banerjee
2014 C conf
Pairing-free Single Round Certificateless and Identity Based Authenticated Key Exchange Protocols.
SECRYPT
Saikrishna Badrinarayanan, C. Pandu Rangan
2013 Misc conf
A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory.
ICISC
K. Preetha Mathew, Sachin Vasant, C. Pandu Rangan
2013 J jnl
A Revocable Online-Offline Certificateless Signature Scheme without Pairing.
IACR Cryptol. ePrint Arch.
Karthik Abinav, Saikrishna Badrinarayanan, C. Pandu Rangan, S. Sharmila Deva Selvi, S. Sree Vivek, Vivek Krishna Pradhan
2013 J jnl
Efficient Certificateless Online/Offline Signature with tight security.
J. Internet Serv. Inf. Secur.
S. Sharmila Deva Selvi, S. Sree Vivek, Vivek Krishna Pradhan, C. Pandu Rangan
2013 Misc conf
Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model.
ICISC
K. Preetha Mathew, Sachin Vasant, C. Pandu Rangan
2013 C conf
Efficient, Pairing-Free, Authenticated Identity Based Key Agreement in a Single Round.
ProvSec
S. Sree Vivek, S. Sharmila Deva Selvi, Layamrudhaa Renganathan Venkatesan, C. Pandu Rangan
2013 J jnl
Lattice Based Efficient Threshold Public Key Encryption Scheme.
J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl.
Kunwar Singh, C. Pandu Rangan, A. K. Banerjee
2013 J jnl
Lattice Based Identity Based Proxy Re-Encryption Scheme.
J. Internet Serv. Inf. Secur.
Kunwar Singh, C. Pandu Rangan, A. K. Banerjee
2012 C conf
A Code-Based 1-out-of-N Oblivious Transfer Based on McEliece Assumptions.
ISPEC
K. Preetha Mathew, Sachin Vasant, Sridhar Venkatesan, C. Pandu Rangan
2012 B conf
A Navigation Algorithm Inspired by Human Navigation.
ASONAM
M. Vijesh, Sudarshan Iyengar, S. M. Vijay Mahantesh, Amitash Ramesh, C. Pandu Rangan, Veni Madhavan
2012 J jnl
A Special Purpose Signature Scheme for Secure Computation of Traffic in a Distributed Network.
J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl.
S. Sree Vivek, S. Sharmila Deva Selvi, Ramarathnam Venkatesan, C. Pandu Rangan
2012 — conf
Adaptively Secure Efficient Lattice (H)IBE in Standard Model with Short Public Parameters.
SPACE
Kunwar Singh, C. Pandu Rangan, A. K. Banerjee
2012 Misc conf
An Efficient IND-CCA2 Secure Variant of the Niederreiter Encryption Scheme in the Standard Model.
ACISP
K. Preetha Mathew, Sachin Vasant, Sridhar Venkatesan, C. Pandu Rangan
2012 B conf
Cache Me If You Can: Capacitated Selfish Replication Games.
LATIN
Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram
2012 Misc conf
Compact Stateful Encryption Schemes with Ciphertext Verifiability.
IWSEC
S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan
2012 Misc conf
Deterministic Identity Based Signature Scheme and Its Application for Aggregate Signatures.
ACISP
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2012 J jnl
Efficient Certificateless Online/Offline Signature.
J. Internet Serv. Inf. Secur.
S. Sharmila Deva Selvi, S. Sree Vivek, Vivek Krishna Pradhan, C. Pandu Rangan
2012 — conf
Group key establishment (GKE): Two/three party key exchange to GKE.
IEEE ANTS
S. Sree Vivek, S. Sharmila Deva Selvi, Deepanshu Shukla, C. Pandu Rangan
2012 C conf
ID Based Signcryption Scheme in Standard Model.
ProvSec
S. Sharmila Deva Selvi, S. Sree Vivek, Dhinakaran Vinayagamurthy, C. Pandu Rangan
2012 J jnl
ID Based Signcryption Scheme in Standard Model.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, Dhinakaran Vinayagamurthy, C. Pandu Rangan
2012 — conf
Identity based partial aggregate signature scheme without pairing.
Sarnoff Symposium
S. Sharmila Deva Selvi, S. Sree Vivek, J. Shriram, C. Pandu Rangan
2012 B conf
Obstacles Incentivize Human Learning: A Network Theoretic Study.
ASONAM
Amitash Ramesh, Soumya Ramesh, Sudarshan Iyengar, Vinod Sekhar, C. Pandu Rangan
2012 J jnl
On Provably Secure Code-Based Signature and Signcryption Scheme.
IACR Cryptol. ePrint Arch.
K. Preetha Mathew, Sachin Vasant, C. Pandu Rangan
2012 J jnl
On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission.
J. ACM
Ashwinkumar Badanidiyuru, Arpita Patra, Ashish Choudhury, Kannan Srinathan, C. Pandu Rangan
2012 C conf
Optimal Parameters for Efficient Two-Party Computation Protocols.
WISTP
Chaya Ganesh, C. Pandu Rangan
2012 J jnl
PKI Based Signcryption without Pairing: an Efficient Scheme with Tight Security Reduction.
J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl.
S. Sree Vivek, S. Sharmila Deva Selvi, Salini Selvaraj Kowsalya, C. Pandu Rangan
2012 J jnl
Stronger Public Key Encryption Schemes Withstanding RAM Scraper Like Attacks.
IACR Cryptol. ePrint Arch.
S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan
2012 J jnl
Strongly Unforgeable Proxy Re-Signature Schemes in the Standard model.
IACR Cryptol. ePrint Arch.
S. Sree Vivek, S. Sharmila Deva Selvi, Guhan Balasubramanian, C. Pandu Rangan
2011 B conf
A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs.
WALCOM
Esha Ghosh, N. S. Narayanaswamy, C. Pandu Rangan
2011 C conf
Bit-depth scalable video coding using error residual correction.
VCIP
R. Shyam Sundar, C. Pandu Rangan
2011 C conf
CCA Secure Certificateless Encryption Schemes based on RSA.
SECRYPT
S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan
2011 — conf
Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience.
ICITS
Arpita Patra, C. Pandu Rangan
2011 J jnl
Compact CCA-Secure Encryption with Ciphertext Verifiability.
IACR Cryptol. ePrint Arch.
S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan
2011 J jnl
Deterministic Identity Based Signature Scheme and its Application for Aggregate Signatures.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2011 J jnl
Identity Based Deterministic Signature Scheme Without Forking-Lemma.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2011 — conf
Identity Based Online/Offline Encryption and Signcryption Schemes Revisited.
InfoSecHiComNet
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2011 Misc conf
Identity-Based Deterministic Signature Scheme without Forking-Lemma.
IWSEC
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2011 J jnl
On the Fault Tolerance and Hamiltonicity of the Optical Transpose Interconnection System of Non-Hamiltonian Base Graphs
CoRR
Esha Ghosh, Subhas Kumar Ghosh, C. Pandu Rangan
2011 J jnl
On the Security of ID Based Signcryption Schemes.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, Dhinakaran Vinayagamurthy, C. Pandu Rangan
2011 J jnl
Rational Secret Sharing over an Asynchronous Broadcast Channel with Information Theoretic Security
CoRR
William K. Moses Jr., C. Pandu Rangan
2011 J jnl
Rational Secret Sharing with Honest Players over an Asynchronous Channel.
IACR Cryptol. ePrint Arch.
William K. Moses Jr., C. Pandu Rangan
2011 J jnl
Secure message transmission in asynchronous networks.
J. Parallel Distributed Comput.
Ashish Choudhury, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan
2011 J jnl
Variants of Spreading Messages.
J. Graph Algorithms Appl.
T. V. Thirumala Reddy, C. Pandu Rangan
2010 C conf
An Identity based Ring Signcryption Scheme with Public Verifiability.
SECRYPT
S. Sharmila Deva Selvi, S. Sree Vivek, Sakhi S. Anand, C. Pandu Rangan
2010 — conf
Attribute Based Signatures for Bounded Multi-level Threshold Circuits.
EuroPKI
Swarun Kumar, Shivank Agrawal, Subha Balaraman, C. Pandu Rangan
2010 A* conf
Brief announcement: communication efficient asynchronous byzantine agreement.
PODC
Arpita Patra, C. Pandu Rangan
2010 A* conf
Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity.
PODC
Arpita Patra, Ashish Choudhury, C. Pandu Rangan
2010 J jnl
CCA2 Secure Certificateless Encryption Schemes Based on RSA.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2010 J jnl
Capacitated Caching Games
CoRR
Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram
2010 C conf
Certificateless KEM and Hybrid Signcryption Schemes Revisited.
ISPEC
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2010 J jnl
Collusion Free Protocol for Correlated Element Selection Problem.
IACR Cryptol. ePrint Arch.
Amjed Shareef, Akshay Agrawal, C. Pandu Rangan
2010 — conf
Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience.
AFRICACRYPT
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2010 J jnl
Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2010 — conf
Communication Optimal Multi-valued Asynchronous Broadcast Protocol.
LATINCRYPT
Arpita Patra, C. Pandu Rangan
2010 J jnl
Communication and Round Efficient Information Checking Protocol
CoRR
Arpita Patra, C. Pandu Rangan
2010 C conf
Forcing Out a Confession - Threshold Discernible Ring Signatures.
SECRYPT
Swarun Kumar, Shivank Agrawal, Ramarathnam Venkatesan, Satyanarayana V. Lokam, C. Pandu Rangan
2010 C conf
Game Theoretic Resistance to Denial of Service Attacks Using Hidden Difficulty Puzzles.
ISPEC
Harikrishna Narasimhan, Venkatanathan Varadarajan, C. Pandu Rangan
2010 J jnl
Identity Based Online/Offline Encryption Scheme.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2010 J jnl
Identity Based Online/Offline Signcryption Scheme.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2010 J jnl
Identity Based Partial Aggregate Signature Scheme Without Pairing.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, J. Shriram, C. Pandu Rangan
2010 C conf
Identity Based Public Verifiable Signcryption Scheme.
ProvSec
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2010 J jnl
Identity Based Public Verifiable Signcryption Scheme.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2010 B conf
Identity Based Self Delegated Signature - Self Proxy Signatures.
NSS
S. Sharmila Deva Selvi, S. Sree Vivek, S. Gopi Nath, C. Pandu Rangan
2010 J jnl
Identity Based Self Delegated Signature - Self Proxy Signatures.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, S. Gopi Nath, C. Pandu Rangan
2010 Misc conf
On Communication Complexity of Secure Message Transmission in Directed Networks.
ICDCN
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2010 Misc conf
On Composability of Reliable Unicast and Broadcast.
ICDCN
Anuj Gupta, Sandeep Hans, Kannan Srinathan, C. Pandu Rangan
2010 J jnl
On Conditional Covering Problem.
Math. Comput. Sci.
Balasubramanian Sivan, S. Harini, C. Pandu Rangan
2010 J jnl
On the Security of Identity Based Threshold Unsigncryption Schemes.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, S. Priti, C. Pandu Rangan
2010 B conf
Pathwidth and Searching in Parameterized Threshold Graphs.
WALCOM
D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shashank, C. Pandu Rangan
2010 J jnl
Sanitizable signatures with strong transparency in the standard model.
IACR Cryptol. ePrint Arch.
Shivank Agrawal, Swarun Kumar, Amjed Shareef, C. Pandu Rangan
2010 J jnl
Security Weaknesses in Two Certificateless Signcryption Schemes.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2010 — conf
Spatiogram Based Fast Mode Decision in Spatial Scalable Video Coding.
PCM (2)
R. Shyam Sundar, C. Pandu Rangan
2010 A conf
The Round Complexity of Verifiable Secret Sharing: The Statistical Case.
ASIACRYPT
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan
2010 — conf
Threshold Discernible Ring Signatures.
ICETE (Selected Papers)
Swarun Kumar, Shivank Agrawal, Ramarathnam Venkatesan, Satyanarayana V. Lokam, C. Pandu Rangan
2010 — conf
Towards a Cooperative Defense Model Against Network Security Attacks.
WEIS
Harikrishna Narasimhan, Venkatanathan Varadarajan, C. Pandu Rangan
2010 J jnl
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality.
Int. J. Appl. Cryptogr.
Arpita Patra, Ashish Choudhury, C. Pandu Rangan, Kannan Srinathan
2010 B conf
Variants of Spreading Messages.
WALCOM
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan
2009 J jnl
A note on the Certificateless Multi-receiver Signcryption Scheme.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2009 C conf
Breaking and Building of Group Inside Signature.
SecureComm
S. Sree Vivek, S. Sharmila Deva Selvi, S. Gopi Nath, C. Pandu Rangan
2009 J jnl
Breaking and Building of Group Inside Signature.
IACR Cryptol. ePrint Arch.
S. Sree Vivek, S. Sharmila Deva Selvi, S. Gopi Nath, C. Pandu Rangan
2009 Misc conf
Breaking and Building of Threshold Signcryption Schemes.
Inscrypt
S. Sharmila Deva Selvi, S. Sree Vivek, Shilpi Nayak, C. Pandu Rangan
2009 C conf
Breaking and Fixing of an Identity Based Multi-Signcryption Scheme.
ProvSec
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2009 J jnl
Breaking and Fixing of an Identity Based Multi-Signcryption Scheme.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2009 A* conf
Brief announcement: perfectly secure message transmission in directed networks re-visited.
PODC
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 J jnl
Certificateless KEM and Hybrid Signcryption Schemes Revisited.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2009 Misc conf
Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience.
Inscrypt
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 J jnl
Communication Optimal Multi-Valued Asynchronous Byzantine Agreement with Optimal Resilience.
IACR Cryptol. ePrint Arch.
Arpita Patra, C. Pandu Rangan
2009 B conf
Core and Conditional Core Path of Specified Length in Special Classes of Graphs.
WALCOM
Balasubramanian Sivan, S. Harini, C. Pandu Rangan
2009 J jnl
Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction Without Pairing.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2009 Misc conf
Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction without Pairing.
Inscrypt
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2009 J jnl
Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 — conf
Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience.
ICITS
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 J jnl
Game Theoretic Resistance to Denial of Service Attacks Using Hidden Difficulty Puzzles.
IACR Cryptol. ePrint Arch.
Harikrishna Narasimhan, Venkatanathan Varadarajan, C. Pandu Rangan
2009 Misc conf
Identity Based Aggregate Signcryption Schemes.
INDOCRYPT
S. Sharmila Deva Selvi, S. Sree Vivek, J. Shriram, S. Kalaivani, C. Pandu Rangan
2009 J jnl
Information Theoretically Secure Multi Party Set Intersection Re-Visited.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 B conf
Information Theoretically Secure Multi Party Set Intersection Re-visited.
Selected Areas in Cryptography
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 J jnl
Multi Party Distributed Private Matching, Set Disjointness and Cardinality Set Intersection with Information Theoretic Security.
IACR Cryptol. ePrint Arch.
G. Sathya Narayanan, T. Aishwarya, Anugrah Agrawal, Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 B conf
Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security.
CANS
G. Sathya Narayanan, T. Aishwarya, Anugrah Agrawal, Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 J jnl
ON THE SECURITY OF TWO RING SIGNCRYPTION SCHEMES.
IACR Cryptol. ePrint Arch.
S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan
2009 Misc conf
On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks.
ICDCN
Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan
2009 J jnl
On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 C conf
On the Security of Identity Based Ring Signcryption Schemes.
ISC
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2009 C conf
On the Security of Two Ring Signcryption Schemes.
SECRYPT
S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan
2009 J jnl
On the security of Identity Based Ring Signcryption Schemes.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan
2009 J jnl
Perfectly reliable and secure message transmission tolerating mobile adversary.
Int. J. Appl. Cryptogr.
Arpita Patra, Ashish Choudhary, C. Pandu Rangan, Kannan Srinathan, Prasad Raghavendra
2009 Misc conf
Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience.
INDOCRYPT
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 Misc conf
Sanitizable Signatures with Strong Transparency in the Standard Model.
Inscrypt
Shivank Agrawal, Swarun Kumar, Amjed Shareef, C. Pandu Rangan
2009 J jnl
Scalable Compilers for Group Key Establishment : Two/Three Party to Group.
IACR Cryptol. ePrint Arch.
S. Sree Vivek, S. Sharmila Deva Selvi, Deepanshu Shukla, C. Pandu Rangan
2009 J jnl
Security Analysis of Aggregate signature and Batch verification signature schemes.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, J. Shriram, S. Kalaivani, C. Pandu Rangan
2009 A* conf
Simple and efficient asynchronous byzantine agreement with optimal resilience.
PODC
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 C conf
The Guarding Problem - Complexity and Approximation.
IWOCA
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan
2009 A* conf
The Round Complexity of Verifiable Secret Sharing Revisited.
CRYPTO
Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan
2009 A conf
Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary.
AsiaCCS
Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2008 Misc conf
Alternative Protocols for Generalized Oblivious Transfer.
ICDCN
Bhavani Shankar, Kannan Srinathan, C. Pandu Rangan
2008 J jnl
An Efficient Identity-Based Signcryption Scheme for Multiple Receivers.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, Rahul Srinivasan, C. Pandu Rangan
2008 C conf
Cryptanalysis of Bohio et al.'s ID-Based Broadcast Signcryption (IBBSC) Scheme for Wireless Ad-Hoc Networks.
PST
S. Sharmila Deva Selvi, S. Sree Vivek, Naga Naresh Karuturi, Ragavendran Gopalakrishnan, C. Pandu Rangan
2008 J jnl
Cryptanalysis of Bohio et al.'s ID-Based Broadcast Signcryption (IBBSC) Scheme for Wireless Ad-hoc Networks.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, Naga Naresh Karuturi, Ragavendran Gopalakrishnan, C. Pandu Rangan
2008 — conf
Cryptanalysis of Li et al.'s Identity-Based Threshold Signcryption Scheme.
EUC (2)
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan, Neha Jain
2008 J jnl
Cryptanalysis of Li et al.'s Identity-Based Threshold Signcryption Scheme.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, Neha Jain, C. Pandu Rangan
2008 Misc conf
Cryptanalysis of Mu et al.'s and Li et al.'s Schemes and a Provably Secure ID-Based Broadcast Signcryption (IBBSC) Scheme.
WISA
S. Sharmila Deva Selvi, S. Sree Vivek, Ragavendran Gopalakrishnan, Naga Naresh Karuturi, C. Pandu Rangan
2008 J jnl
Efficient Asynchronous Byzantine Agreement with Optimal Resilience.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhury, C. Pandu Rangan
2008 J jnl
Efficient Asynchronous Multiparty Computation with Optimal Resilience.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhury, C. Pandu Rangan
2008 J jnl
Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhary, Madhu Gayatri, C. Pandu Rangan
2008 Misc conf
Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary.
ACISP
Arpita Patra, Ashish Choudhary, Madhu Vaidyanathan, C. Pandu Rangan
2008 C conf
Efficient and Provably Secure Certificateless Multi-receiver Signcryption.
ProvSec
S. Sharmila Deva Selvi, S. Sree Vivek, Deepanshu Shukla, C. Pandu Rangan
2008 A* conf
Efficient single phase unconditionally secure message transmission with optimum communication complexity.
PODC
Kannan Srinathan, Ashish Choudhary, Arpita Patra, C. Pandu Rangan
2008 J jnl
Foundations of Group Key Management - Framework, Security Model and a Generic Construction.
IACR Cryptol. ePrint Arch.
Naga Naresh Karuturi, Ragavendran Gopalakrishnan, Rahul Srinivasan, C. Pandu Rangan
2008 C conf
On Conditional Covering Problem.
IWOCA
Balasubramanian Sivan, S. Harini, C. Pandu Rangan
2008 Misc conf
On Optimal Probabilistic Asynchronous Byzantine Agreement.
ICDCN
Amjed Shareef, C. Pandu Rangan
2008 J jnl
On the Provable Security of Multi-Receiver Signcryption Schemes.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, Ragavendran Gopalakrishnan, Naga Naresh Karuturi, C. Pandu Rangan
2008 A* conf
On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary.
PODC
B. V. Ashwinkumar, Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan
2008 — conf
Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary.
ICITS
Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, K. Srinathan, C. Pandu Rangan
2008 J jnl
Perfectly Secure Message Transmission Tolerating Mixed Adversary.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhury, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan
2008 J jnl
Provably Secure ID-Based Broadcast Signcryption (IBBSC) Scheme.
IACR Cryptol. ePrint Arch.
S. Sharmila Deva Selvi, S. Sree Vivek, Ragavendran Gopalakrishnan, Naga Naresh Karuturi, C. Pandu Rangan
2008 J jnl
RSA-TBOS Signcryption with Proxy Re-encryption.
IACR Cryptol. ePrint Arch.
Varad Kirtane, C. Pandu Rangan
2008 — conf
RSA-TBOS signcryption with proxy re-encryption.
Digital Rights Management Workshop
Varad Kirtane, C. Pandu Rangan
2008 C conf
Rational Secret Sharing with Repeated Games.
ISPEC
Shaik Maleka, Amjed Shareef, C. Pandu Rangan
2008 Misc conf
Round Efficient Unconditionally Secure Multiparty Computation Protocol.
INDOCRYPT
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2008 J jnl
Round Efficient Unconditionally Secure Multiparty Computation Protocol.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2008 J jnl
Side Channel Attack Resistant Implementation of Multi-Power RSA using Hensel Lifting.
IACR Cryptol. ePrint Arch.
Varad Kirtane, C. Pandu Rangan
2008 J jnl
Signcryption with Proxy Re-encryption.
IACR Cryptol. ePrint Arch.
Chandrasekar S., Ambika K., C. Pandu Rangan
2008 J jnl
Statistically Reliable and Secure Message Transmission in Directed Networks.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhury, C. Pandu Rangan
2008 J jnl
The Round Complexity of Verifiable Secret Sharing Revisited.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan
2008 A conf
The deterministic protocol for rational secret sharing.
IPDPS
Shaik Maleka, Amjed Shareef, C. Pandu Rangan
2008 B conf
Unconditionally Reliable Message Transmission in Directed Hypergraphs.
CANS
Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2008 J jnl
Unconditionally Reliable Message Transmission in Directed Hypergraphs.
IACR Cryptol. ePrint Arch.
Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2008 Misc conf
Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited.
SCN
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2008 J jnl
Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhury, C. Pandu Rangan, Kannan Srinathan
2008 J jnl
Unconditionally Secure Message Transmission in Arbitrary Directed Synchronous Networks Tolerating Generalized Mixed Adversary.
IACR Cryptol. ePrint Arch.
Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2008 J jnl
Unconditionally Secure Multiparty Set Intersection Re-Visited.
IACR Cryptol. ePrint Arch.
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2008 A* conf
Unconditionally reliable message transmission in directed networks.
SODA
Bhavani Shankar, Prasant Gopal, Kannan Srinathan, C. Pandu Rangan
2007 — conf
Data structures for limited oblivious execution of programs while preserving locality of reference.
Digital Rights Management Workshop
Avinash V. Varadarajan, Ramarathnam Venkatesan, C. Pandu Rangan
2007 Misc conf
Efficient Protocol For Approximate Agreement.
PDPTA
Amjed Shareef, C. Pandu Rangan
2007 — conf
On Exponential Lower Bound for Protocols for Reliable Communication in Networks.
ICITS
K. Srinathan, C. Pandu Rangan, Ranjit Kumaresan
2007 Misc conf
On Proactive Perfectly Secure Message Transmission.
ACISP
Kannan Srinathan, Prasad Raghavendra, C. Pandu Rangan
2007 — conf
On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication.
S&P
Kannan Srinathan, N. R. Prasad, C. Pandu Rangan
2007 A conf
Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary.
DISC
Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan
2007 B conf
Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary.
CANS
Arpita Patra, Bhavani Shankar, Ashish Choudhary, K. Srinathan, C. Pandu Rangan
2007 C conf
Privacy Preserving BIRCH Algorithm for Clustering over Arbitrarily Partitioned Databases.
ADMA
P. Krishna Prasad, C. Pandu Rangan
2007 — conf
Privacy Preserving CACTUS Algorithm for Clustering over Vertically Partitioned Databases.
DMIN
P. Krishna Prasad, C. Pandu Rangan
2007 C conf
Privacy Preserving DBSCAN Algorithm for Clustering.
ADMA
K. Anil Kumar, C. Pandu Rangan
2007 Misc conf
Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality.
INDOCRYPT
Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2007 Misc ed.
Progress in Cryptology - INDOCRYPT 2007, 8th International Conference on Cryptology in India, Chennai, India, December 9-13, 2007, Proceedings
INDOCRYPT
K. Srinathan, C. Pandu Rangan, Moti Yung
2006 Misc conf
Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission.
INDOCRYPT
Arpita Patra, Ashish Choudhary, K. Srinathan, C. Pandu Rangan
2006 J jnl
Perfectly Reliable Message Transmission.
Inf. Process. Lett.
Arvind Narayanan, K. Srinathan, C. Pandu Rangan
2006 B conf
Playing push vs pull: models and algorithms for disseminating dynamic data in networks.
SPAA
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A. Laing, R. Manokaran, C. Pandu Rangan, Rajmohan Rajaraman
2006 A* conf
Possibility and complexity of probabilistic reliable communication in directed networks.
PODC
Kannan Srinathan, C. Pandu Rangan
2006 — conf
Privacy Preserving BIRCH Algorithm for Clustering over Vertically Partitioned Databases.
Secure Data Management
P. Krishna Prasad, C. Pandu Rangan
2006 B conf
Round-Optimal and Efficient Verifiable Secret Sharing.
TCC
Matthias Fitzi, Juan A. Garay, Shyamnath Gollakota, C. Pandu Rangan, K. Srinathan
2006 — conf
Steganographic Communication in Ordered Channels.
Information Hiding
R. C. Chakinala, Abishek Kumarasubramanian, R. Manokaran, Guevara Noubir, C. Pandu Rangan, Ravi Sundaram
2004 A* conf
Brief announcement: on the round complexity of distributed consensus over synchronous networks.
PODC
D. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan
2004 A conf
On Byzantine Agreement over (2, 3)-Uniform Hypergraphs.
DISC
D. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan
2004 A* conf
Optimal Perfectly Secure Message Transmission.
CRYPTO
K. Srinathan, Arvind Narayanan, C. Pandu Rangan
2004 — ch.
Randomized Dictionary Structures.
Handbook of Data Structures and Applications
C. Pandu Rangan
2004 — ch.
Skew Heaps.
Handbook of Data Structures and Applications
C. Pandu Rangan
2003 A* conf
Brief announcement: efficient perfectly secure communication over synchronous networks.
PODC
K. Srinathan, Vinod Vaikuntanathan, C. Pandu Rangan
2003 A* conf
Distributed consensus in the presence of sectional faults.
PODC
S. Amitanand, I. Sanketh, K. Srinathan, Vinod Vaikuntanathan, C. Pandu Rangan
2003 Misc conf
On the Power of Computational Secret Sharing.
INDOCRYPT
Vinod Vaikuntanathan, Arvind Narayanan, K. Srinathan, C. Pandu Rangan, Kwangjo Kim
2003 Misc conf
Practical Pay TV Schemes.
ACISP
Arvind Narayanan, C. Pandu Rangan, Kwangjo Kim
2002 Misc conf
Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries.
ACISP
M. V. N. Ashwin Kumar, K. Srinathan, C. Pandu Rangan
2002 A conf
Asynchronous Secure Communication Tolerating Mixed Adversaries.
ASIACRYPT
K. Srinathan, M. V. N. Ashwin Kumar, C. Pandu Rangan
2002 Misc conf
Asynchronous Unconditionally Secure Computation: An Efficiency Improvement.
INDOCRYPT
B. Prabhu, K. Srinathan, C. Pandu Rangan
2002 Misc conf
Non-perfect Secret Sharing over General Access Structures.
INDOCRYPT
K. Srinathan, N. Tharani Rajan, C. Pandu Rangan
2002 A* conf
On perfectly secure cmmunication over arbitrary networks.
PODC
M. V. N. Ashwin Kumar, Pranava R. Goundan, K. Srinathan, C. Pandu Rangan
2002 Misc conf
Theory of Equal-Flows in Networks.
COCOON
K. Srinathan, Pranava R. Goundan, M. V. N. Ashwin Kumar, R. Nandakumar, C. Pandu Rangan
2002 Misc conf
Trading Players for Efficiency in Unconditional Multiparty Computation.
SCN
B. Prabhu, K. Srinathan, C. Pandu Rangan
2001 Misc ed.
Progress in Cryptology - INDOCRYPT 2001, Second International Conference on Cryptology in India, Chennai, India, December 16-20, 2001, Proceedings
INDOCRYPT
C. Pandu Rangan, Cunsheng Ding
2001 J jnl
The K
Computing
Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong
2001 Misc conf
Toward Optimal Player Weights in Secure Distributed Protocols.
INDOCRYPT
K. Srinathan, C. Pandu Rangan, V. Kamakoti
2000 J jnl
Algorithmic aspects of clique-transversal and clique-independent sets.
Discret. Appl. Math.
Venkatesan Guruswami, C. Pandu Rangan
2000 J jnl
Approximation algorithms for the Traveling Salesman Problem with range condition.
RAIRO Theor. Informatics Appl.
D. Arun Kumar, C. Pandu Rangan
2000 Misc conf
Efficient Asynchronous Secure Multiparty Distributed Computation.
INDOCRYPT
K. Srinathan, C. Pandu Rangan
2000 J jnl
On the Complexity of Partial Order Properties.
Order
Stefan Felsner, Ravi Kant, C. Pandu Rangan, Dorothea Wagner
2000 J jnl
On the Generative Power of Simple H Systems.
J. Autom. Lang. Comb.
Lakshminarayanan Subramanian, Muralidhar Talupur, Kamala Krithivasan, C. Pandu Rangan
2000 Misc conf
Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation.
INDOCRYPT
K. Srinathan, C. Pandu Rangan
1999 B ed.
Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings
ISAAC
Alok Aggarwal, C. Pandu Rangan
1999 — ed.
Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings
FSTTCS
C. Pandu Rangan, Venkatesh Raman, Ramaswamy Ramanujam
1999 J jnl
Symmetric Min-Max Heap: A Simpler Data Structure for Double-Ended Priority Queue.
Inf. Process. Lett.
A. Arvind, C. Pandu Rangan
1998 J jnl
A Natural Family of Optimization Problems with Arbitrarily Small Approximation Thresholds.
Inf. Process. Lett.
Venkatesan Guruswami, C. Pandu Rangan
1998 J jnl
On The g-centroidal Problem in Special Classes of Perfect Graphs.
Ars Comb.
C. Pandu Rangan, K. R. Parthasarathy, V. Prakash
1998 J jnl
Partial and Perfect Path Covers of Cographs.
Discret. Appl. Math.
David G. Kirkpatrick, Madhukar K. Reddy, C. Pandu Rangan, Anand Srinivasan
1998 — conf
Probabilistic Data Structures for Priority Queues (Extended Abstract).
SWAT
Sridhar Ramachandran, K. Rajasekar, C. Pandu Rangan
1998 Misc conf
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries.
COCOON
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. Pandu Rangan
1998 B conf
The Vertex-Disjoint Triangles Problem.
WG
Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong
1998 J jnl
Weighted Irredundance of Interval Graphs.
Inf. Process. Lett.
Maw-Shang Chang, P. Nagavamsi, C. Pandu Rangan
1997 Misc conf
An optimal parallel algorithm for the all-nearest-foreign-neighbors problem in arbitrary dimensions.
HiPC
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. Pandu Rangan
1997 J jnl
Restrictions of Minimum Spanner Problems.
Inf. Comput.
G. Venkatesan, Udi Rotics, M. S. Madanlal, Johann A. Makowsky, C. Pandu Rangan
1996 J jnl
All-pairs-shortest-length on Strongly Chordal Graphs.
Discret. Appl. Math.
V. Balachandhran, C. Pandu Rangan
1996 J jnl
An Efficient Distributed Algorithm for Centering a Spanning Tree of a Biconnected Graph.
Inf. Process. Lett.
Rohan F. M. Aranha, C. Pandu Rangan
1996 J jnl
Approximate Triclique Coloring for Register Allocation.
Inf. Process. Lett.
G. Venkatesan, C. Pandu Rangan
1996 J jnl
Clique Transversal and Clique Independence on Comparability Graphs.
Inf. Process. Lett.
V. Balachandran, P. Nagavamsi, C. Pandu Rangan
1996 J jnl
Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected Graph.
Algorithmica
K. S. Easwarakumar, S. V. Krishnan, C. Pandu Rangan, S. Seshadri
1996 J jnl
The Parity Path Problem on Some Subclasses of Perfect Graphs.
Discret. Appl. Math.
Satyan R. Coorg, C. Pandu Rangan
1996 J jnl
Tree 3-Spanners on Interval, Permutation and Regular Bipartite Graphs.
Inf. Process. Lett.
M. S. Madanlal, G. Venkatesan, C. Pandu Rangan
1995 J jnl
A linear algorithms for the two paths problem on permutation graphs.
Discuss. Math. Graph Theory
C. P. Gopalakrishnan, C. Pandu Rangan
1995 J jnl
An Efficient Distributed Algorithm For st-numbering The Verices Of A Biconnected Graph
J. Univers. Comput. Sci.
Rohan F. M. Aranha, C. Pandu Rangan
1995 J jnl
An Efficient Randomized Algorithm for the Closest Pair Problem on Colored Point Sets.
Nord. J. Comput.
V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan
1995 J jnl
Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs.
Inf. Process. Lett.
Anand Srinivasan, K. Madhukar, P. Nagavamsi, C. Pandu Rangan, Maw-Shang Chang
1995 J jnl
Edge-disjoint paths in permutation graphs.
Discuss. Math. Graph Theory
C. P. Gopalakrishnan, C. Pandu Rangan
1995 J jnl
Efficient Dynamic Job Scheduling Algorithms for Multiprocessor Systems.
IEICE Trans. Inf. Syst.
Saptarshi Mahesh, C. Siva Ram Murthy, C. Pandu Rangan
1995 J jnl
Efficient Parallel Algorithms for Permutation Graphs.
J. Parallel Distributed Comput.
K. Arvind, V. Kamakoti, C. Pandu Rangan
1995 Misc conf
Efficient Randomized Incremental Algorithm For The Closest Pair Problem Using Leafary Trees.
COCOON
V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan
1995 J jnl
Efficient algorithms for minimal disjoint path problems on chordal graphs.
Discuss. Math. Graph Theory
C. P. Gopalakrishnan, C. Pandu Rangan, Satyan R. Coorg
1995 J jnl
Feedback vertex set on cocomparability graphs.
Networks
Satyan R. Coorg, C. Pandu Rangan
1995 J jnl
Modeling and simulation of dynamic job scheduling in multiprocessor systems.
Int. J. Comput. Math.
Sathi Mahesh, C. Siva Ram Murthy, T. A. Gonsalves, C. Pandu Rangan
1995 J jnl
Optimal Parallel Algorithms for Path Problems on Planar Graphs.
Theor. Comput. Sci.
G. Srikrishna, C. Pandu Rangan
1995 J jnl
Parallel Algorithms on Interval Graphs.
RAIRO Theor. Informatics Appl.
V. B. Balayogan, C. Pandu Rangan
1995 J jnl
Performance Bounds for Static Multiprocessor Scheduling of Multi-Task Jobs.
Parallel Process. Lett.
Sathi Mahesh, C. Siva Ram Murthy, C. Pandu Rangan
1995 J jnl
Systematic Design of an Algorithm for Biconnected Components.
Sci. Comput. Program.
K. Madhukar, D. Pavan Kumar, C. Pandu Rangan, R. Sundar
1995 J jnl
Weighted Independent Perfect Domination on Cocomparability Graphs.
Discret. Appl. Math.
Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg
1994 J jnl
A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph.
Inf. Process. Lett.
K. S. Easwarakumar, C. Pandu Rangan, Grant A. Cheston
1994 B conf
Edge-Disjoint Paths in Permutation Graphs.
ISAAC
C. P. Gopalakrishnan, C. Pandu Rangan
1994 J jnl
Efficient Parallel Shuffle Recognition.
Parallel Process. Lett.
Maurice Nivat, G. D. S. Ramkumar, C. Pandu Rangan, Ahmed Saoudi, Ravi Sundaram
1994 — conf
Efficient Randomized Parallel Algorithm for the Closest Pair Problem in D-dimension.
IFIP Congress (1)
P. Jagan Mohan, V. Kamakoti, C. Pandu Rangan
1994 J jnl
Treewidth of Circular-Arc Graphs.
SIAM J. Discret. Math.
Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan
1994 B conf
Weighted Irredundance of Interval Graphs.
ISAAC
C. Pandu Rangan, Maw-Shang Chang
1993 J jnl
A Linear Algorithm for the All-Bidirectional-Edges Problem on Planar Graphs.
Algorithmica
P. B. Ramprasad, C. Pandu Rangan
1993 J jnl
A Unified Approach to Parallel Algorithms for the Domatic Partition Problem on Special Classes of Perfect Graphs.
Parallel Process. Lett.
Arjun Raman, C. Pandu Rangan
1993 B conf
Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs.
WADS
Hari Balakrishnan, Anand Rajaraman, C. Pandu Rangan
1993 J jnl
Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs.
Theor. Comput. Sci.
R. Srikant, Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan
1993 B conf
Weighted Independent Perfect Domination on Cocomparability Graphs.
ISAAC
Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg
1992 — conf
A Parallel Algorithm for Recognizing the Shuffle of Two Strings.
IPPS
Ahmed Saoudi, Maurice Nivat, C. Pandu Rangan, Ravi Sundaram, G. D. S. Ramkumar
1992 J jnl
An O(n log n) algorithm for a maxmin location problem.
Discret. Appl. Math.
C. Pandu Rangan, Ramesh Govindan
1992 J jnl
An Optimal Algorithm for Reconstructing a Binary Tree.
Inf. Process. Lett.
V. Kamakoti, C. Pandu Rangan
1992 J jnl
An optimal algorithm to solve the all-pair shortest path problem on interval graphs.
Networks
R. Ravi, Madhav V. Marathe, C. Pandu Rangan
1992 J jnl
Generalized Vertex Covering in Interval Graphs.
Discret. Appl. Math.
Madhav V. Marathe, R. Ravi, C. Pandu Rangan
1991 J jnl
An efficient algorithm for finding a two-pair, and its applications.
Discret. Appl. Math.
Srinivasa Rao Arikati, C. Pandu Rangan
1991 J jnl
Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs.
Theor. Comput. Sci.
Aravind Srinivasan, C. Pandu Rangan
1991 J jnl
Efficient Reduction for Path Problems on Circular-Arc Graphs.
BIT
Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher
1991 J jnl
On Finding the Minimum Bandwidth of Interval Graphs
Inf. Comput.
R. Mahesh, C. Pandu Rangan, Aravind Srinivasan
1991 B conf
Treewidth of Circular-Arc Graphs (Abstract).
WADS
Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan
1990 J jnl
A Fast Algorithm for Computing Sparse Visibility Graphs.
Algorithmica
S. Sudarshan, C. Pandu Rangan
1990 J jnl
Linear Algorithm for Optimal Path Cover Problem on Interval Graphs.
Inf. Process. Lett.
Srinivasa Rao Arikati, C. Pandu Rangan
1990 J jnl
New Sequential and Parallel Algorithms for Interval Graph Recognition.
Inf. Process. Lett.
G. Ramalingam, C. Pandu Rangan
1990 — conf
Parallel Algorithms on Interval Graphs.
ICPP (3)
G. D. S. Ramkumar, C. Pandu Rangan
1989 J jnl
Algorithms for Weighted Graph Problems on The Modified Cellular Graph Automaton.
RAIRO Theor. Informatics Appl.
Suresh Venkatasubramanian, Kamala Krithivasan, C. Pandu Rangan
1989 J jnl
Linear Algorithm for Domatic Number Problem on Interval Graphs.
Inf. Process. Lett.
A. Srinivasa Rao, C. Pandu Rangan
1989 B conf
Linear Algorithms for Parity Path and Two Path Problems on Circular-Arc Graph.
WADS
A. Srinivasa Rao, C. Pandu Rangan
1989 — conf
Optimal Parallel Algorithms on Circular-Arc Graphs.
FSTTCS
A. Srinivasa Rao, C. Pandu Rangan
1989 J jnl
Optimal Parallel Algorithms on Circular-Arc Graphs.
Inf. Process. Lett.
A. Srinivasa Rao, C. Pandu Rangan
1988 — conf
A New Linear Algorithm for the Two Path Problem on Chordal Graphs.
FSTTCS
S. V. Krishnan, C. Pandu Rangan, S. Seshadri
1988 J jnl
A Unified Approach to Domination Problems on Interval Graphs.
Inf. Process. Lett.
G. Ramalingam, C. Pandu Rangan
1988 J jnl
Total Domination in Interval Graphs Revisited.
Inf. Process. Lett.
G. Ramalingam, C. Pandu Rangan
1987 J jnl
A Linear Space Algorithm for the LCS Problem.
Acta Informatica
S. Kiran Kumar, C. Pandu Rangan
1987 B conf
Competitive Location in the L
WG
Ramesh Govindan, C. Pandu Rangan
1986 B conf
A Simple Implementation of Warshall's Algorithm on a VLSI Chip.
WG
Ramesh Dewangan, C. Pandu Rangan
1983 J jnl
On the Minimum Number of Additions Required to Compute a Quadratic Form.
J. Algorithms
C. Pandu Rangan