Multiparty computation unconditionally secure against Q^2 adversary structures

Details Multiparty computation unconditionally secure against Q^2 adversary structures Multiparty computation unconditionally secure against Q^2 adversary structures

1999-02-08

arxiv.org/abs/cs/9902010v1

Computer Science

Cryptography and Security

11 pages. McGill University School of Computer Science tech. report

Scientific paper

We present here a generalization of the work done by Rabin and Ben-Or. We give a protocol for multiparty computation which tolerates any Q^2 active adversary structure based on the existence of a broadcast channel, secure communication between each pair of participants, and a monotone span program with multiplication tolerating the structure. The secrecy achieved is unconditional although we allow an exponentially small probability of error. This is possible due to a protocol for computing the product of two values already shared by means of a homomorphic commitment scheme which appeared originally in a paper of Chaum, Evertse and van de Graaf.

Affiliated with

Also associated with

No associations

Rating

Multiparty computation unconditionally secure against Q^2 adversary structures 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 Multiparty computation unconditionally secure against Q^2 adversary structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiparty computation unconditionally secure against Q^2 adversary structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-490495