Research Triangle Park, NC, USA
Oct. 30, 1989 to Nov. 1, 1989
D. Beaver , Aiken Comput. Lab., Harvard Univ., Cambridge, MA, USA
The problem of performing a multiparty computation when more than half of the processors are cooperating Byzantine faults is addressed. It is shown how to compute any Boolean function of n inputs distributively, preserving the privacy of inputs held by nonfaulty processors and ensuring that faulty processors obtain the function value if and only if the nonfaulty processors do. If the nonfaulty processors do not obtain the correct function value, they detect cheating with high probability. The solution is based on a new type of verifiable secret sharing in which the secret is revealed not all at once but in small increments. This process ensures that all processors discover the secret at roughly the same time. The solution assumes the existence of an oblivious transfer protocol and uses broadcast channels. The processors are not required to have equal computing power.
oblivious transfer protocol, faulty majority, multiparty computation, Byzantine faults, Boolean function, nonfaulty processors, faulty processors, cheating
D. Beaver, "Multiparty computation with faulty majority", FOCS, 1989, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1989, pp. 468-473, doi:10.1109/SFCS.1989.63520