Multiparty computation unconditionally secure against Q^2 adversary structures

Simple item page
dc.creatorSmith, Adam
dc.creatorStiglic, Anton
dc.date1999-02-08
dc.date.accessioned2026-07-07T03:23:57Z
dc.date.available2026-07-07T03:23:57Z
dc.descriptionWe 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.
dc.description11 pages. McGill University School of Computer Science tech. report
dc.identifierhttps://arxiv.org/abs/cs/9902010
dc.identifierhttp://arxiv.org/abs/cs/9902010
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/33142
dc.subjectCryptography and Security
dc.subjectF.m
dc.titleMultiparty computation unconditionally secure against Q^2 adversary structures
dc.typetext

Files

Collections

arXiv