Communication and Round Efficient Information Checking Protocol

Details Communication and Round Efficient Information Checking Protocol Communication and Round Efficient Information Checking Protocol

2010-04-20

arxiv.org/abs/1004.3504v1

Computer Science

Cryptography and Security

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Communication and Round Efficient Information Checking Protocol does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Communication and Round Efficient Information Checking Protocol, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Communication and Round Efficient Information Checking Protocol will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-473861