Secure and Verifiable Schemes for Election and General Distributed Computing Problems

Abstract

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.

DOI: 10.1145/62546.62577

Extracted Key Phrases

1 Figure or Table

Cite this paper

@inproceedings{Huang1988SecureAV, title={Secure and Verifiable Schemes for Election and General Distributed Computing Problems}, author={Ming-Deh A. Huang and Shang-Hua Teng}, booktitle={PODC}, year={1988} }