C. Pandu Rangan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
C. Pandu Rangan has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Arpita Patra
Indian Institute of Science
1 shared publication - Arpita Patra
Dept of Computer Science and Engineering Indian Institute of Technology 600036 Madras Chennai India
1 shared publication - Ashish Choudhury
University of Bristol
1 shared publication
Latest Publications
- Open Access
- 10 November 2013
- Published by Springer Nature in Distributed Computing
- Vol. 27 (2) , 111-146
Asynchronous Byzantine Agreement with optimal resilience
- 10 November 2013
- Published by Springer Nature in Distributed Computing
- Vol. 27 (2) , 111-146
Open AccessAsynchronous Byzantine Agreement with optimal resilience
- Open Access
Communication and Round Efficient Information Checking Protocol
In this paper, we present a very important primitive called Information Checking Protocol (ICP) which plays an important role in constructing statistical Verifiable Secret Sharing (VSS) and Weak Secret Sharing (WSS) protocols. Informally, ICP is a tool for authenticating messages in the presence of computationally unbounded corrupted parties. Here we extend the basic bare-bone definition of ICP, introduced by Rabin et al. and then present an ICP that attains the best communication complexity and round complexity among all the existing ICPs in the literature. We also show that our ICP satisfies several interesting properties such as linearity property which is an important requirement in many applications of ICP. Though not presented in this paper, we can design communication and round efficient statistical (i.e involves negligible error probability in computation) VSS and Multiparty Computation (MPC) protocol using our new ICP.
Open AccessCommunication and Round Efficient Information Checking Protocol
In this paper, we present a very important primitive called Information Checking Protocol (ICP) which plays an important role in constructing statistical Verifiable Secret Sharing (VSS) and Weak Secret Sharing (WSS) protocols. Informally, ICP is a tool for authenticating messages in the presence of computationally unbounded corrupted parties. Here we extend the basic bare-bone definition of ICP, introduced by Rabin et al. and then present an ICP that attains the best communication complexity and round complexity among all the existing ICPs in the literature. We also show that our ICP satisfies several interesting properties such as linearity property which is an important requirement in many applications of ICP. Though not presented in this paper, we can design communication and round efficient statistical (i.e involves negligible error probability in computation) VSS and Multiparty Computation (MPC) protocol using our new ICP.