This paper explores the idea of using simple secure and verifiable distributed protocols as building blocks for ccnstructing more complicated protocols. A notion of reduction among multi-party problems is introduced and formally defined. The very simple and natural distributed sum problem is shown to be universal under the notion of reduction. An optimally secure, verifiable, and robust protocol for the distributed sum problem and the closely related election problem is presented. The distributed sum protocol together with the proof of reduction from the multi-party problems yields an efficient systematic method for the automatic generation of secure and verifiable protocols for all multi-party problems.
Unfortunately, ACM prohibits us from displaying non-influential references for this paper.
To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=62577.