Introduction
SecureMulti-PartyComputation(English:SecureMulti-PartyComputation)researchismainlyaimedatuntrustedthirdpartiesTheproblemofhowtosafelycalculateaconventionfunction.Securemulti-partycomputingisthecryptographicbasisfortheimplementationofmanyapplicationssuchaselectronicelections,thresholdsignatures,andelectronicauctions.
Asecuremulti-partycomputingprotocol,ifitissafeforanattackerwithunlimitedcomputingpower,itiscalledinformation-theoreticsecurityorunconditionallysecure;ifitissafeforanattackerwithpolynomialcomputingpower,Itissaidtobecryptographicallysecureorconditionallysecure.
Existingresultsprovethatundertheunconditionalsecuritymodel,ifandonlyifthenumberofmaliciousparticipantsislessthan1/3ofthetotalnumberofparticipants,asafesolutionexists.Undertheconditionalsecuritymodel,ifandonlyifthenumberofmaliciousparticipantsislessthanhalfofthetotalnumberofparticipants,asafesolutionexists.
Securemulti-partycomputingoriginatedfromYaoQizhi’smillionaireproblemin1982.Later,OdedGoldreichmadeamoredetailedandsystematicdiscussion.
YaoQizhi
YaoQizhi(December24,1946-),Chinesecomputerscientist,TuringPrizewinnerin2000,istheonlyonesofarTheChinesewhowonthisaward.HeiscurrentlythedirectorandprofessoroftheTheoreticalComputerScienceResearchCenterofTsinghuaUniversity,Beijing,theBowenChairProfessoroftheChineseUniversityofHongKong,theHonoraryLectureofNationalTsinghuaUniversityinHsinchu,andtheDistinguishedResearchLectureofNationalTaiwanUniversity,andtheDistinguishedUniversityProfessorofTheChineseUniversityofHongKong(Shenzhen).