安全计算和秘密同享中的安全性.pdfVIP

Abstract A secret sharing scheme allows sharing a secret among several participants such that only certain groups of them can recover it. Verifiable secret sharing has been proposed to achieve security against cheating participants. We first recall the fundamental concepts, techniques and results of secure computation and secret sharing. The paper mainly denotes three related problems, namely secret sharing (SS), verifiable secret sharing (VSS) and multiparty computation (MPC). Under the assumption of the existence of one -way functions (i.e. discrete logarithms ), we present a very efficient multiparty computation protocol of n players unconditionally secure against an active adversary with an one -round bound commitment. The security is that active corruption of up to t n / 3 of the players is tolerated. And the only (and unavoidable) price for robustness is a reduction in the number of tolerable cheaters (t n / 3 instead of t n / 2 ) and the assumption of one-way function. Moreover, we analyze communication complexity of our protocol. Key Words and Phrases. secure multiparty computation, secret sharing, passive, adversary, player, monotone span program, hybrid, polynomial, protocol distribution, robustness. Acknowledgements his wouldliketothank mentor,formany 1 ShengmingShi，my professor ofthethesis the andconstant inthecourse writing．Igivespecial suggestions support Kewei an