版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领
文档简介
SwiftMPC:AcceleratingMLunderMPCwith
Secure-Chip-AssistedOne-WayCommunication
TianzeSong
ZhejiangUniversity
Hangzhou,Zhejiang,China
stz@
YangmingZhang
AlibabaCloud
Shenzhen,Guangdong,China
YuyangCui
TianjinUniversity
Tianjin,China
cuiyuyang@
TongChen
ZhejiangUniversity
Hangzhou,Zhejiang,China
tongc727@
ChengkunWei✉∗
ZhejiangUniversity
Hangzhou,Zhejiang,China
weichengkun@
YichenTuAlibabaCloudBeijing,China
HengCai
AlibabaCloud
Hangzhou,Zhejiang,China
MinghongTang
ZhejiangUniversity
Hangzhou,Zhejiang,China
tangmh@
HaiyuanGao
AlibabaCloud
Hangzhou,Zhejiang,China
JinShi
ZhejiangUniversity
Hangzhou,Zhejiang,China
shijin4300@
YinZhang
ZhejiangUniversity
Hangzhou,Zhejiang,China
zhangyin98@
WeiWang
AlibabaGroup
Shenzhen,Guangdong,China
WenzhiChen✉∗
ZhejiangUniversity
Hangzhou,Zhejiang,China
chenwz@
Abstract
Securemulti-partycomputation(MPC)isapromisingfoun-dationforprivacy-preservingmachinelearning.Itsdeploy-mentformodernMLislimitedbycommunication:Beaver-basedmultiplicationrequiresbidirectionalcommunicationthatplacesnetworklatencydirectlyonthecriticalpath.WepresentSwiftMPC,asecure-chip-assistedMPCarchitecturebuiltonasimpleprotocolinsight:ifonepartysetsitsfirsttwoBeaver-triplecomponentsequaltoitsexistinginputshares,thatparty’smaskeddifferencesbecomeidenticallyzeroandneednotbetransmitted.Securemultiplicationthusbecomesone-way,lettingcommunicationandcomputationbepipelined.Suchtriplescannotbeprecomputedcrypto-graphically,norsuppliedbyatrustedthirdpartywithoutreintroducingaroundtrip.SwiftMPCinsteadgeneratesthemwithasecurechipattachedtooneparticipant.Thechipplays
∗Correspondingauthors:WenzhiChenandChengkunWei.
ThisworkislicensedunderaCreativeCommonsAttribution4.0Interna-
tionalLicense.
SIGOPSATC2026,HongKong,China
©2026Copyrightheldbytheowner/author(s).ACMISBN979-8-4007-2818-1/2026/11
/10.1145/3828523.3857086
anarrow,fixed-functionrolelimitedtotriplegeneration,keepingitsimpletoverify.
WeimplementSwiftMPCwithanFPGAsecure-chippro-totypeandadrop-inruntimecompatiblewithPyTorch-styleprogramming.Tobettersupportmachine-learningwork-loads,SwiftMPCfurthergeneratesBeavertriplesatmatrixgranularity,whichreducestripleconsumptionandcommu-nicationvolumefordominantMLoperators.Acrossrepre-sentativeMLworkloads,SwiftMPCcompletesResNet-18inferencein2.22sat65msnetworklatency,achievingupto1.64×speedupoverthestrongestpriorhardware-assistedMPCdesignandupto125×oversoftware-onlyMPC.
CCSConcepts:•Securityandprivacy→Privacy-preservingprotocols;Hardware-basedsecurityproto-cols;•Hardware→Hardwareaccelerators;•Computingmethodologies→Machinelearning.
Keywords:Securemulti-partycomputation,Privacy-preservingmachinelearning
ACMReferenceFormat:
TianzeSong,ChengkunWei,YichenTu,YangmingZhang,HengCai,HaiyuanGao,YuyangCui,MinghongTang,JinShi,TongChen,YinZhang,WeiWang,andWenzhiChen.2026.SwiftMPC:AcceleratingMLunderMPCwithSecure-Chip-AssistedOne-WayCommunication.InThe2026ACMSIGOPSAnnualTechnicalConfer-ence(SIGOPSATC2026),November15-18,2026,HongKong,China.
ACM,NewYork,NY,USA,15pages.
/10.1145/3828523.
3857086
1Introduction
Securemulti-partycomputation(MPC)[12,33]isanappeal-ingfoundationforprivacy-preservingmachinelearningbe-causeitenablesmultiplepartiestojointlycomputeafunctionwithoutexposingtheirplaintextinputsduringexecution.Thepropertyisespeciallyattractiveincross-organizationsettings,whereparticipantsareunwillingtoentrustsensi-tivedatatoacentralizedexecutionplatform.Yet,despiteitsstrongsecuritysemantics,MPCremainsdifficulttodeployformodernmachine-learningworkloads.
Themainobstacleliesincommunication.Inadditive-secret-sharing-basedMPC[8,12,13],additionsarelocal,whereasmultiplicationsrelyonBeavertriples[5,6]andrequirepartiestoexchangemaskeddifferencesbeforethecomputationcanproceed.BecausemodernMLworkloadscontainmassivenumbersofmultiplications,thisbidirec-tionalcommunicationplacesnetworklatencydirectlyonthecriticalpath.Inrealisticwide-areadeploymentswhereround-triptimesreachtensorhundredsofmilliseconds,theresultingslowdownisprohibitive[15,39,55].
Inthispaper,weexploreadifferentdesignpoint:canthebidirectionalcommunicationinBeaver-basedmultiplicationberemovedaltogether?Weshowthattheanswerisyes.Ourkeyinsightisthatthebidirectionalcommunicationarisessolelybecausebothpartiesmustmasktheirsharesandex-changethemaskeddifferences.IfonepartysetsitsfirsttwoBeaver-triplecomponentsequaltoitsexistinginputshares(asillustratedinFigure1(b)),thatparty’smaskeddifferencesbecomeidenticallyzeroandneednotbetransmittedatall.Securemultiplicationthusreducesfrombidirectionaltoone-waycommunication,turningalatency-dominatedprimitiveintoapipelinabledataflowthatoverlapscommunicationwithcomputation.
Realizingthisinsight,however,isimpossiblewithexistingtriple-generationapproaches,sinceitrequiresgeneratingthetriplebasedonaparty’sliveinputshares.Cryptographicpreprocessing,e.g.,viahomomorphicencryption[13]oroblivioustransfer[32],producestriplesaheadoftime,buttheliveinputsharesareonlydeterminedduringonlinecom-putation,sothecorrespondingtriplecannotbeprecomputed.Atrustedthirdparty[46]couldgeneratesuchatriple,butonlyafterreceivingtheshare,whichreintroducesaroundtriponthecriticalpathofeverymultiplication.Neitherap-proachcanrealizeone-waysecuremultiplication,callingforanewtriple-generationmechanism.
Torealizethisinsightandovercomethelimitationsofex-istingmethods,wepresentSwiftMPC,asecure-chip-assisted
MPCarchitectureformachinelearning.Asecurechipat-tachedtoonlyoneparticipantgeneratesBeavertripleslo-callyfromthatparticipant’sliveinputsharesandpseudoran-domvaluesgeneratedfromaseedsharedwiththeremoteparticipant.Thislocalgenerationavoidsexpensivecrypto-graphicpreprocessingandnetworkroundtrips,preservingone-waycommunicationandenablingpipelinedexecution.Thechipisconfinedtoanarrow,fixed-functionrolelimitedtotriplegeneration,keepingitsdesignsimpleandthetrustedfunctionalitysmall.Thedesignalsoavoidsintroducinganexternaltrustedthirdpartythatcouldcolludewithapartici-pant.TosupportMLworkloadsefficiently,SwiftMPCfurtherextendsBeavertriplegenerationfromscalaroperationstomatrixgranularityinbothsoftwareandhardware,whichreducesbothtripleconsumptionandcommunicationvolumeformatrixmultiplicationandconvolution.
WeimplementSwiftMPCasahardware-softwareco-designthatcombinesanFPGAsecure-chipprototypewithadrop-inruntimecompatiblewithPyTorch-styleprogramming,allowinguserstoadoptSwiftMPCwithminimalcodechanges.OnrepresentativeconvolutionalandTransformer[50]workloads,SwiftMPCcompletesResNet-18[23]inferencein2.22sat65msnetworklatency,achievingupto1.64×speedupoverthestrongestpriorhardware-assistedMPCdesign[57]andupto125×oversoftware-onlyMPC.
Overall,thispapermakesthecaseforadifferentdesignpointforpracticalMPC:removingthebidirectionalcommu-nicationbyrestructuringtheprotocolwithtrustedhardware.Bykeepingthehardwarerolesmallwhilepreservingone-waycommunicationandstrongend-to-endperformance,SwiftMPCbringsMPCclosertopracticalprivacy-preservingmachinelearning.Insummary,thispapermakesthefollow-ingcontributions:
•Aprotocol-levelredesignforone-waysecuremul-tiplication.WeredesigntheBeaver-multiplicationprotocolsothatsettingoneparty’sfirsttwoBeaver-triplecomponentsequaltoitsexistinginputsharesmakesthatparty’smaskeddifferenceszero,reducingsecuremultiplicationfrombidirectionaltoone-waycommunicationandmakingitpipelinable.Werealizethisredesignedprotocolwithasecurechipattachedtooneparticipantthatgeneratesthetriplelocally,serv-ingasanarrowtrustanchorinplaceofatrustedthirdparty.
•Hardware-softwareco-designwithmatrix-leveltriplegeneration.WedesignSwiftMPCasahardware-softwareco-designwithaPyTorch-compatibledrop-inruntimeandanFPGAsecure-chipprototype.ByliftingBeavertriplegenerationtomatrixgranularity,SwiftMPCreducestripleconsumptionandcommunicationvolumefordominantMLoperators.
(a)BeaverMultiplicationUsingTTP
[m]0=...
[d']0,[e']0
[d'']0,[e'']0
[z]0=...
[d]0=[x]0-[a]0
[e]0=[y]0-[b]0
[p]0=...
Alice
Multiplication1Multiplication2Multiplication3
Waiting...
Waiting...
Waiting...
TTP
c=ab,...
[a]0,[b]0,[c]0,...
[d]0,[e]0
[d']1,[e']1
[z]1=...
Bob
[d]1=[x]1-[a]1
[e]1=[y]1-[b]1
[m]1=...
[d'']1,[e'']1
[p]1=...
[d]1,[e]1
[a]1,[b]1,[c]1,...
(b)SwiftMPCUsingSecureChip
...PRNG
[d'']0,[e'']0
[p]0=...
Alice
[z]0=...
[a]0,[b]0,[c]0
PRNG
...PRNG
[d']0,[e']0
[m]0=...
Multiplication1Multiplication2Multiplication3
[d]0=[x]0-[a]0
[e]0=[y]0-[b]0
[d]0,[e]0Unidirection
TimeSaved
0
Communication
SecureChip
[m]1=...
Bob
[p]1=...
PRNG
[c'']1=...
[z]1=...
PRNG
[c']1=...
[d]1=0
[e]1=0
[a]1=[x]1
[b]1=[y]1
...
[c]1ab-[c]0
PRNG
Multiplication1Multiplication2Multiplication3
Figure1.ComparisonbetweenBeavermultiplication(a)andSwiftMPC(b)whenperforming=×followedbytwomoremultiplications.In(b),bysettingBob’sBeaver-triplecomponentsequaltoBob’sexistinginputshares([]1=[]1,[]1=[]1),themaskeddifferences[]1,[]1becomezeroandneednotbetransmitted,enablingunidirectionalcommunicationandpipelinedexecution.Greenregionsindicatecomponentsthatbothpartiesmusttrust.
•End-to-endperformanceimprovements.AcrossrepresentativeMLworkloadsandlatencysettings,SwiftMPCachievesupto1.64×speedupoverapriorsecure-chip-baseddesignandupto125×overasoftware-onlybaseline,including2.22sResNet-18inferenceat65mslatency.
2Background
2.1SecureMulti-PartyComputation
SecureMPCallowsmultiplepartiestojointlycomputeafunctionovertheirprivateinputswithoutrevealingtheseinputstooneanother.Formally,givenparties1,2,...,holdingprivateinputs1,2,...,,thegoalistocompute(1,2,...,)suchthatnopartylearnsanythingbeyonditsowninputandtheoutputof.
AbroadclassofMPCprotocolshasbeendevelopedtobalancesecurity,efficiency,andexpressiveness.Thegarbledcircuit[7,29,33]isoneoftheearliestandmostfundamen-talconstructionsforsecuretwo-partycomputation.Inthisapproach,oneparty(thegarbler)encodesaBooleancir-cuitintoa“garbled”form,encryptingthetruthtablesofeachgate,whiletheotherparty(theevaluator)evaluatesthecircuitusingencryptedinputlabelsobtainedviaoblivioustransfer.Secret-sharing-basedprotocols[45,53]spliteachprivatevalueintorandomsharesdistributedamongpartici-pants.Afunctioncanthenbeevaluatedonthesesharesusingarithmeticoperationsoverafinitefield,withcorrectnessen-suredbythelinearityofadditionandmultiplicationsharingschemes.Homomorphicencryption[10,19,47]allowscom-putationsdirectlyonciphertextswithoutdecryption,makingitattractiveforoutsourcingprivacy-preservingcomputationtountrustedservers.
AmongtheseMPCparadigms,additivesecretsharing[8,12,13]hasbecomeawidelyadoptedapproachduetoitscom-putationalsimplicityandsuitabilityforlarge-scalenumericalworkloads.InanadditivesecretsharingschemeoverafinitefieldZ,avalueissplitintoshares[]1,[]2,...,[]suchthat=[]1+[]2+···+[](mod).Eachpartyholdsoneshare,andthereconstructionofrequiresallshares.Additivesecretsharingprovidesanelegantpropertythatadditioncanbeperformedlocallybecause[]+[]=[+],where[]and[]denotesharedvaluesofanar-bitraryparty.However,multiplicationisnotlocallycom-putableandrequiresinteractiveprotocolsbetweenparties.Efficientlyperformingsecuremultiplicationsthusbecomesthecentralchallengeinadditivesecretsharing-basedMPC.
2.2UsingBeaverTripletoComputeMultiplication
Beaver[5,6]introducesBeavertriplestoreducetheper-multiplicationcommunicationrequiredduringtheonlinephase.ABeavertripleisatuple(,,)ofpre-computedrandomvaluessatisfying=×.Givensuchatriple,partiescansecurelycomputetheproduct=×oftwosecret-sharedvalues[]and[](alsoillustratedinFigure1(a)):eachpartymasksitssharesbycomputing[]=[]−[]and[]=[]−[],thenallpartiesexchangeandreconstructtheplaintextand.Sinceandaremaskedbytherandomtriplecomponents,theyrevealnoinformationaboutor.Eachpartythenlocallyderives[]from[],,and.Notably,thisexchangeofandrequiresbidirectional,blockingcommunication.Computationmuststalluntilbothvaluesarereceivedfromallparties.
2.3GenerationofBeaverTriples
ThegenerationanddistributionofBeavertriplesremainperformance-criticalinMPCsystems.Becauseeachsecuremultiplicationconsumesatriple,thetriple-generationthroughputmustmatchthecomputationaldemand.Existingsystemsobtaintriplesthroughtwoprimaryapproaches:
Cryptographic-basedgeneration.Triplescanbegener-atedcollaborativelyusingoblivioustransfer[32]orhomo-morphicencryption[13,58].Inthisapproach,thepartici-pantsjointlyexecuteacryptographicpreprocessingproto-coltoobtainsharesofvalidBeavertriples,whicharethenconsumedduringthesubsequentBeaver-basedMPCcom-putation.
TTP-basedgeneration.Tomaketriplegenerationfaster,atrustedthirdpartycanbeintroducedtogenerateBeavertriplesinadvanceanddistributethecorrespondingsharestotheparticipants[43].Inthisapproach,thecomputationworkloadproceedsusingthesepre-generatedtriples,whilethetriplegenerationisoffloadedtotheTTP.ThismakesTTP-basedgenerationastraightforwardandefficientwaytosupplytriplesforBeaver-basedMPC.
3MotivationandChallenges
ThissectionmotivatesSwiftMPCbyanalyzingthetrustandperformancelimitationsofexistingMPCsystemsandiden-tifyingtheresultingdesignchallenges.
3.1LimitationsofExistingMPCforEnd-User
MachineLearning
Performancebottlenecks.ExistingMPCsystemsarefun-damentallylimitedbyinteraction-dominatedonlineexecu-tion.AsillustratedinFigure1(a),eachBeaver-basedsecuremultiplicationrequirespartiestoexchangemaskeddiffer-ences([],[])andsynchronizebeforeproceeding.Sincetheassociatedlocalarithmeticislightweight,thecostofsecuremultiplicationisgovernedprimarilybycommuni-cationlatencyratherthancomputation.Thisbottleneckisparticularlysevereformachine-learningworkloads,wheredominantoperatorssuchasmatrixmultiplicationandcon-volutiontranslateintomassivenumbersofsecuremultipli-cations.Theresultinginteractionoverheadplacesnetworklatencydirectlyonthecriticalpathandseverelylimitsend-to-endperformance.
Forexample,inarepresentativeMPCframework,ResNet-18inferencetakes63.31sunder65msnetworklatency(§7),indicatingthatinteraction,ratherthanlocalcomputation,istheprincipalobstacletopracticaldeployment.Abreakdownofend-to-endruntimefurthershowsthatcommunicationandsynchronizationdominateexecutiontimeunderreal-isticnetworklatency,whilelocalarithmeticaccountsfor
onlyasmallfractionofthetotalcost.Acrossalltestedwork-loads,communicationandsynchronizationdominaterun-timeunderrealisticWANlatency,confirmingthatexistingBeaver-basedMPCisfundamentallyinteraction-bound.
Trustlimitations.Beyondthisperformancebottleneck,ex-istingsystemsfaceasecondlimitationrootedinhowBeavertriplesareprovisionedforsecuremultiplications.Existingsystemsgeneratethesetripleseithercryptographically,e.g.,throughoblivioustransfer[32]orhomomorphicencryp-tion[13,58],orwiththehelpofatrustedthirdparty(TTP).Theformerincurssubstantialcomputationandcommunica-tionoverhead,whichisparticularlyburdensomeforpracticalmachine-learningworkloadsinresource-constrainedend-userenvironments.Thelatterismoreefficient,butenlargesthetrustboundarybyrequiringuserstotrustanexternalpartynottoleakinformationorcolludewithanyparticipant.Oncethisassumptionfails,plaintextvaluesmayberecov-eredimmediately[43].Existingapproachesthereforeexposeafundamentaltradeoffbetweenpreprocessingefficiencyandtrustexpansion.
Takentogether,theselimitationsrevealafundamentaltensioninexistingMPCsystems:practicaldeploymentre-quiresreducingbothtrustexpansioninpreprocessingandlatency-sensitiveinteractioninonlineexecution.
3.2Challenges
TheselimitationsrevealafundamentaldesigntensioninpracticalMPCformachinelearning:reducinginteractionandpreprocessingcostoftencomesatthepriceofexpandingthetrustboundary.Asuccessfuldesignmustthereforeaddressperformance,trust,anddeployabilityjointly,ratherthanoptimizinganyonedimensioninisolation.
C1:Removinglatency-sensitiveinteractionfromon-lineexecution.StandardMPCprotocolsrequirebidirec-tionalcommunicationforeachsecuremultiplicationorbit-wiseAND.Becausetheunderlyinglocalarithmeticisinex-pensive,networklatencyratherthancomputationdominatesexecutiontime.Thefirstchallengeisthereforetoeliminatemutualcommunicationfromthecriticalpathofonlineexe-cution.
C2:Avoidingtrustexpansionwhileretainingefficienttriplegeneration.EfficientBeavertriplegenerationisessential,butexistingmethodsareunsatisfactory:cryp-tographicpreprocessingiscostly,whereasTTP-basedprovisioningenlargesthetrustboundary.Morebroadly,acceleratingMPCthroughhardwareassistancecaneasilyshiftmoreofthesecurecomputationpathintotrustedhardware.Thesecondchallengeisthereforetoachieveefficienttriplegenerationandreducedinteractionwithoutrelyingoneitheranexternaltrustedpartyorplaintext-styletrustedexecution.
C3:MatchingthestructureofmodernMLworkloads.Realmachine-learningmodelsaredominatedbymatrixmul-tiplicationandconvolution.Thethirdchallengeistosupport
theseoperatorsefficientlyandexposethemthroughinter-facescompatiblewithmodernMLframeworks.
C4:Maintainingpracticaldeployability.Anydesignin-tendedforend-usersettingsmustkeephardwareassump-tions,deploymentcomplexity,andsoftwarechangesmodest.Otherwise,evenaperformantandsecuresystemwouldre-maindifficulttoadoptinpractice.
4Secure-Chip-AssistedOne-WayMPC
ThissectionpresentsthedesignintuitionbehindSwiftMPCanddefinesthethreatmodelunderlyingoursecure-chip-assistedapproach.
4.1DesignRationale
ThedesignofSwiftMPCstartsfromaprotocol-levelobserva-tionaboutthecommunicationcostofBeavermultiplication.AsillustratedinFigure1(b),ifBobsetstheirBeaver-triplecomponents([]1,[]1)equaltotheirexistinginputshares([]1,[]1),Bob’smaskeddifferencesbecomezeroandneednotbetransmittedtoAlice.Securemultiplicationthusbe-comesunidirectional:onlyAlicesendsdata,allowingcom-municationandcomputationtobepipelinedratherthansynchronizedateverymultiplication.
Realizingthisidea,however,requiresconstructingaBeavertriplewhosefirsttwocomponentsforaparticipantequalthatparticipant’sexistinginputshares,whichexistingtriple-generationmethodscannotprovide.Cryptographicpreprocessingfixestriplesaheadoftime,butthecorre-spondinginputsharesareonlyavailableduringonlinecomputation.Atrustedthirdpartycouldgeneratesuchatriple,butonlyafterreceivingtheshare,whichreintroducesaroundtriponthecriticalpath.SwiftMPCresolvesthiswithasecurechipattachedtoasingleparticipant.Itex-posesonlyarestrictedfixed-functioninterface,protectsitsinternalstatefromhostinspection,andparticipatessolelytoassisttriplegeneration,ratherthanexecutingthesecurecomputationitself.
Beforecomputation,AliceandBob’ssecurechipestablishasharedPRNGseedthatremainshiddenfromBob’shost.Foreachmultiplication,AliceusesthePRNGtogeneratehertripleshares,computesthemaskeddifferencesfromherin-putshares,andsendsthemtoBob.Bobsuppliestheexistinginputsharestothechip,whichsetsBob’sfirsttwotriplecom-ponentsequaltothosesharesandcomputestheremainingcomponentusingthesynchronizedrandomness,asdetailedinSection5.Bob’smaskeddifferencesarethereforezeroandneednotbesenttoAlice.Bothpartiesthencomputetheiroutputshareslocally,enablingone-waycommunicationtobepipelinedwithcomputation.
Beyondenablingone-waycommunication,generatingtriplesonthechipavoidsthedrawbacksofbothexistingmethods.Comparedwithcryptographicpreprocessing,itre-movestheheavycomputationoverheadofgeneratingtriples.
Comparedwithatrustedthirdparty,thechipisnotanex-ternalauthorityservingallparticipants.Itisattachedtoasingleparticipant,operatesonlyonthatparticipant’slocalsecretshares,andneverreceivestheotherparty’splaintextorshares.Itssimple,fixed-functiondesignkeepsthetrustedfunctionalitysmallandwell-defined.
4.2ThreatModel
WeconsideranMPCsettinginwhichparticipantsjointlyevaluateafunctionoveradditivelysecret-sharedinputs.OneparticipantisequippedwithasecurechipthatassiststheprotocolbygeneratingBeavertriplesfromlocalsecretshares.Participantscommunicateoveranuntrustednetwork.
Adversary.Weassumeasemi-honestthreatmodel:cor-ruptedparticipantsfollowtheprotocolbutattempttoinferprivateinputsfromtheirlocalstateandobservedmessages.Wedonotconsidermaliciousparticipantsthatarbitrarilydeviatefromtheprotocol.Ifthecorruptedpartyisthesecure-chipholder,itmayfullycontrolthehostplatformattachedtothechip,includingtheOS,drivers,user-spacesoftware,andDMA-capableperipherals.Side-channelattacksandphysicaltamperingareoutsideourthreatmodel.
Secure-chipassumptions.SwiftMPCassumesthatthese-curechipprovides:(1)confidentialityandintegrityofitsin-ternalstate,includingsynchronizedPRNGstate,ephemeralregisters,on-chipmemory,anddevice-rootedsecretsforau-thenticationandseedestablishment,evenwhenthehostisfullycompromised;(2)correctexecutionofthespecifiedfixed-functioninterface;(3)arestrictedI/Ointerfacethatexposesonlyintendedcommandsandoutputs;(4)supportforauthenticatedchipidentificationandsecureseedestab-lishmentbeforeprotocolexecution.
5SwiftMPCProtocolDesign
ThissectionpresentstheprotocolfoundationofSwiftMPC.WeformalizetheprotocolsforarithmeticoperationsandBooleanAND,explaintheinherentsupportformatrix-leveloperations,andanalyzecorrectnessandsecurityofthede-sign.
5.1ProtocolWorkflow
Protocol1showshowSwiftMPCcomputes=×.Specif-ically,Bobisequippedwithasecurechip,andAlicesynchro-nizesarandomseedwiththischipsothatbothofthemcangeneratethesamepseudorandomsequence.TheserandomnumberswilllaterbeusedaspartofBeavertriples.Tostartwith,Alicegenerates([]0,[]0,[]0)fromthepseudoran-domgeneratorandfollowsthestandardBeaverprotocolbycomputingthedifferences([]0,[]0)andsendingthemtoBob,andfinallycomputestheirlocaloutput[]0.Ontheotherside,Bobprovidestheirinputshares([]1,[]1)tothesecurechip,whicharetreatedas([]1,[]1)intheBeaverprotocol.Togetherwiththesynchronized([]0,[]0,[]0),
Protocol1Twopartiescompute⊗→withsecurechip
Input:AliceandthesecurechipofBobhaveapairof
synchronizedPRNGs.Theyhavesharedtheirdatatosecretshare[]0,[]1and[]0,[]1,where[]0+[]1=and[]0+[]1=.
Output:Alicegets[]0andBobgets[]1where
[]0+[]1=and⊗=.⊗herecanrepresentscalarorelement-wisevectormultiplication,matrixmultiplicationorconvolution,aslongastheshapeofandtoperform
⊗isvalid,andtheshapesof,,correspondone-to-onewiththoseof,,.Whenperforming
convolution,each⊗mustusethesamestrideandpadding.ProcedureofAlice:
1.Generates[]0,[]0,[]0aspartofaBeavertriplefromPRNGsequentially
2.←[]0−[]0
3.←[]0−[]0
4.Sends,toBob
5.[]0=[]0+⊗[]0+⊗[]0+⊗(inpractice,thiscouldbesimplifiedas
[]0=[]0+[]0⊗[]0−[]0⊗[]0)ProcedureofBobwithaSecureChip:
1.Sends[]1,[]1tosecurechip(as[]1,[]1intraditionalBeavermultiplication)
a.Securechipgenerates[]0,[]0,[]0identicaltothoseofAlicefromPRNGsequentiallyinsidethechip
b.Securechipcomputes
[]1=([]0+[]1)⊗([]0+[]1)−[]0andonlysends[]1toBob
2.Receives,andcomputes
[]1=[]1+⊗[]1+⊗[]1outsidethesecurechip
thechipcancompute[]1andreturnittoBob.Since[]1=[]1and[]1=[]1,thedifferences([]1,[]1)arealwayszeroandthusdonotneedtobetransmittedtoAlice(asthedashedlineinFigure1(b)indicates).Bobcandirectlycompute[]1astheiroutputshare.Inthisprocedure,BobdoesnotneedtosendanynetworkmessagetoAlice,sotheprotocolachievesunidirectionalcommunication.AsFig-ure1(b)shows,removingnetworklatencyfromthecriticalpathofeverymultiplicationenablespipelinedcomputationthatamortizesnetworklatencyacrossalloperations,therebyresolvingC1.ItalsoaddressesC2bygeneratingBeavertriplesinsidethesecurechip,therebyavoidingrelianceonanexternaltrustedthirdparty.ThebinaryANDprotocolfollowsthesameone-waystructureasProtocol1,exceptthatthe
温馨提示
- 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
- 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
- 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
- 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
- 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
- 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
- 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
最新文档
- 高三语文教学设计:二元思辨写作“勇与为”深度指导
- 八年级生物教学设计:遗传病与人类健康的科学防控
- 初中八年级语文《季夫老师的精神钙片》读写双通期末复习教学设计
- 高中英语高一年级必修第一册Unit 1 Teenage Life单元综合素养培育教学设计
- 高三政治二轮专题复习教案:经济全球化与对外开放考点精讲精练
- 高二英语教学设计:单元整体视域下《Food for thought》深度学习实践
- 初中地理八年级上册2.2《气候》首课时教学设计:核心素养视域下的要素认知与图表建模
- 高三地理《人口问题与人口策略》二轮复习教学设计
- 初中八年级物理《光的反射定律》情境化探究教学设计
- 初中化学实验与科学探究导学案教学设计
- 橡胶制品模具维护管理制度
- (2026年新教材)人教版小学数学六年级上册第五单元百分数《1.百分数的意义》示范课教学课件第一课时
- 2026年新教材统编版九年级上册语文期末复习:古诗词理解性默写 专项测试卷(含答案)
- 2026秋新教材统编版九年级上册语文第六单元测试卷(含答案)
- 2026年新教材人教版九年级上册英语Unit 1~8各单元写作范文合集(含中文翻译)
- T8联考2027届高三10月检测训练英语试题(含答案详解)
- 2026年公安招警(辅警)考试《公安基础知识》题库及答案解析(1000题)考试题库
- 人教版五年级上册语文第七单元第22课《白鹭》第2课时教学课件(新教材)
- 【MOOC】C语言程序设计精髓-哈尔滨工业大学 中国大学慕课MOOC答案
- 实习第三方协议合同范本
- 德力西检验报告下载
评论
0/150
提交评论