Mixing withBabel. CekiGulcu GeneTsudik. IBMResearchDivision,ZurichResearchLaboratory. Saumerstrasse4,CH-8803Ruschlikon.

Size: px
Start display at page:

Download "MixingEmailwithBabel. CekiGulcu GeneTsudik. IBMResearchDivision,ZurichResearchLaboratory. Saumerstrasse4,CH-8803Ruschlikon."

Transcription

1 Mixing withBabel CekiGulcu GeneTsudik IBMResearchDivision,ZurichResearchLaboratory Saumerstrasse4,CH-8803Ruschlikon Switzerland tel fax Abstract Increasinglylargenumbersofpeoplecommunicatetodayvia electronicmeanssuchas ornewsforums.oneofthebasic propertiesofthecurrentelectroniccommunicationmeansisthe identicationoftheend-points.however,attimesitisdesirable orevencriticaltohidetheidentityand/orwhereaboutsofthe end-points(e.g.,humanusers)involved. Thispaperdiscussesthegoalsanddesiredpropertiesof anonymous ingeneralandintroducesthedesignand salientfeaturesofbabelanonymousr er.babelallows userstoconverseelectronicallywhileremaininganonymouswithrespecttoeachotherandtoother{evenhostile{ parties.arangeofattacksandcorrespondingcountermeasures isconsidered.anattemptismadetoformalizeandquantify certaindimensionsofanonymityanduntraceablecommunication.keywords:security, ,mix,anonymity,untraceability, tracanalysis,r er Introduction Explosivegrowthandproliferationoftheglobal Internetinthepastdecadeallowedmillionsofpeopletocommunicateviaelectronicmail.Inmanyrespects, israpidlyreplacingtraditionalpaper mail. isnotonlyfastandconvenientbutalso{ atleastforthetimebeing{freeofchargeforalarge segmentofusers. Thereare,however,someaspectsof thatcan beimprovedupon.first,mostoftoday'sinternet isnotverysecure.senderauthentication,nonrepudiation,dataintegrityandprivacyaresomeofthe basicingredientsofsecure .whilebasic securityisaddressedtosomeextentbyrecentoerings suchaspgp[35]andpem[6],theiracceptanceisfar fromuniversal.anotherimportantfeaturemissingin current issupportforanonymityanduntraceabilityofusers.intheinternetmilieu,itisquiteunrealistictoexpectanysecurityfeaturesoftheunderlyingnetwork;eavesdropperscaneasilyrecord messagesandgatheraddressinginformation.traditionalpapermail,incontrast,allowsonetosendan envelopewithaprinteddestinationaddressandno returnaddress.this,coupledwithothercommonsenseprecautions,canmakethesenderuntraceable 0996SymposiumonNetworkandDistributedSystemSecurity,February22-23,996,SanDiego,California. andanonymous;policeandsleuthctiontothecontrarynotwithstanding. Inthispaperwediscussthegoalsanddesiredpropertiesofanonymous andthendescribethedesign andfeaturesofthebabel{ananonymousr er developedatibmzurichresearchlaboratory.in brief,ourapproachisbasedonaspecialentitycalled a"mix".theconceptofamixwasrstintroduced bychaum[2]intheearlyeighties.amixcanbe viewedasalogicalcomponent(e.g.,applicationlayer software)thatforwards messagesand{inthe process{obfuscatestherelationshipbetweenincomingandoutgoingmessagetrac. Thepaperisorganizedasfollows.Inthenextsectionwebeginbymotivatingtheneedforanonymity, brieyreviewingpreviousworkanddescribingthe goalsofanonymous/untraceable .then,insection3weintroducetheconceptofamixandconsider thethreatsitfaces.sections4,5and6aredevoted tothetechnicaldiscussionofbabelanonymousr er.section7presentsanattempttoquantify somemeasuresofanonymity.finally,section8describesthesalientimplementationissues. 2Motivation Itisnosurprisethatuntraceablecommunication isahighly-chargedand,attimes,evencontroversial, topic[,8,22,23].anonymous isananathematosomepeople.thisreputationisduelargelyto thepossibleabusesofanonymityforthepurposesof spreadinglibelousaccusations,hate-lledpropaganda, pornographyandotherunpleasantcontent. Atthesametime,anonymousmailhasitslegitimateandbenignuses.Wedividetheseintofourmain categories:.discussionofsensitiveandpersonalissues 2.Informationsearches 3.Freedomofspeechinintolerantenvironments 4.Polling/Surveying Manypeopleinneedofcounselingortherapy,such asvictimsofsexual,alcoholordrugabuse,canreceive Thelistisnotmeanttobeexhaustive.

2 supportandcounselingelectronicallywhileremaining anonymous.forexample,avictimofabusewould probablybereluctanttoparticipateinon-linetherapysessionsiftherewasachancethatsomeonethey knewwas"listening".thusitisoftencriticalforthe identityoftheusertoremainsecret.thisneedisalso widelyrecognizedbythemedicalprofession. Weoftenseekinformationanonymouslyinthe courseofoureverydaylife.forexample,anemployee ofonecompanymayinquireaboutajobopeningat another(perhapscompeting)company;theneedfor anonymityisobvious.2furthermore,peopleoften seekinformationfromsourcesthat,shouldtheidentity oftheseekerbecomeknown,wouldactinamanner notagreeabletotheseeker.forexample,aconsumer mightliketobrowseanumberofelectronicshopsand comparepricesbeforemakingapurchase.iftheconsumer'sidentitywererevealed,thevisitedshopscould placehisname/addressontheirmailinglistsandstart bombardinghismailboxwithunwanted\junk" . Thereareothereverydaycaseswhereanonymityisan integralpartofatransaction. Onamoresombernote,therearestill,alas,anumberoftotalitarianregimesintheworld;placeswhere nonviolent(e.g.,verbal)oppositionordissentcanhave seriousconsequencesincludingimprisonment,torture anddeath.furthermore,eveninthefreeworld,there areintolerantandfanaticalgroupsthatviolentlyand virulentlyharasscriticsformereopinions.examples abound::: Inthesamevein,therearealsomanywell-known situationsinwhichanindividualmayfeelcompelled toreportcorruption,criminalbehaviororothermisdeeds.insuchcases,beinganonymousmeansbeing safefromvaryingdegreesofretribution. Anotheruseful,albeitrathernon-controversial,applicationofanonymous isintheareaofpolling andsurveying.thereareanumberoforganizations specializinginopinionsurveysonawidevarietyof topics.participants'anonymityisoneofthebasic featuresofthisactivity. Admittedly,thefundamentalmotivationforhiding one'sidenticationisthefearofretribution(either rightfulorwrongful.)itisnotthegoalofthispaper topartakeinthecurrentlyon-goingdebateonprivacy andanonymityontheinternet.weonlynotethat anonymityisanoptional(andmostlylegal)partof regular,papermail.obviously,itcanbemisused, yettherearenogreatdebatesonbanninganonymous usageofpapermail.drawingaboundarybetweenuse andabuseoftechnologyisacomplicatedphilosophical matter;itisnottreatedinthispaper. 2.Previouswork Therstandthemostauthoritativepaperto-date dealingwithanonymouscommunicationwaspublishedbyd.chaumin98[2].thebabelr erdescribedinthisreportowesmuchtohisideas. 2Thisexampleisofproactivejobsearch;itisdierent fromtheusualreactivesearchwherebythejobdescriptionsare broadcastedtothe"masses",e.g.,bypostinginappropriate newsgroups. ChaumalsoinventedtheDC-network[4]whichprovidesunconditionaluntraceabilitycommensuratewith highbandwidthoverhead.ptzmannandwaidner havealsodoneaconsiderableamountofworkon anonymityanduntraceablecommunicationinlan andisdnenvironments.[24,26,25,27]. Theoldestand(currently)mostwidely-usedanonymousr erislocatedinFinland.ItiscalledPenet andisoperatedbyj.helsingius.penetperformsthe followingfunctions: Itstripsoallheaderinformationoftheincomingmailbeforeforwardingittoitsnaldestination. Then,ifnotalreadyassigned,analiasforthesender iscreated.intheoutgoingmessage,theaddressofthe senderisreplacedbyanalias.thealiasallowsthe recipient(s)ofthemessagetoreplytotherealsender withoutknowinghisidentity. ThedemandonthePenetr erisquitehigh: over7,000messagesaresentdaily.thealiasdatabase contains200,000entries[].recently,penethasbecomethesubjectofsomecontroversy3. Thesecondbrandofr ersarepromotedbya groupcalledcypherpunks[2].thereareabout20 publiclyavailablecypherpunkr ers.theser ersoersomeofthebasicfunctionalitydescribedin thispaper.althoughtheysharethesamecodebase, eachdiersinminorways;someallowpostingtonewsgroupswhileothersdonot,somedonotacceptpgp encryptedmessages;someevenusedierentformats. Theirlackofauniedmodusoperandicomplicates theiruseandhinderstheiracceptance.themixmaster[7]r erwrittenbyl.cottrellisasignicant stepforwardasitconstitutesthersttruemix. 2.2Overviewofdesiredproperties Webeginthetechnicaldiscussionbyenumerating thedesiredpropertiesofanonymousmail..anyoneabletosend shouldbeabletodo soanonymously. 2.Itshouldbeimpossible(or,atleast,computationallyhard)todeterminetheoriginatorofanonymousmail. 3.Thereceiver(s)ofanonymousmailcanreplyto thesender,whoremainsanonymous.moreover, receiver(s)mayreplywithmultiplemessages.(it isimportanttonotethatsomeonereplyingtoan anonymousmessage,bydenition,sacricessome anonymitybecausetheoriginalsender"knows" theintendedreceiver(s)andcancorrelateareply withanearliermessage.4) 3OnFebruary8,995,basedonaburglaryreportledwith thelosangelespolice,transmittedbyinterpol,finnishpolice presentedhelsingiusawarrantforsearchandseizure.bound todosobylaw,hecomplied,therebyrevealingtheelectronic addressofasingleuser. 4However,somedegreeofanonymitycanbepreserved.For example,areplytoananonymousnewsgrouppostonlyreveals thenewgrouptotheoriginalposter;theidentityofthereplying partyremainssecret. 2

3 4.Individualr ersinterveninginanonymizing messagesshouldbetrustedaslittleaspossible. Theanonymityoftheend-pointsshouldbepreservedevenifanumberofinterveningentities colludeoraresubverted. 5.Ther erinfrastructureshouldberesistantto bothpassiveandactiveattacks.(thisproperty iselaboratedonbelow.) 6.Thesenderofanonymous can(anonymously)obtainconrmationthatithasbeen properlyprocessedbyther ersystem. 7.Anonymous shouldnotoverloadtheglobal infrastructure.(forexample,ifanonymity requiresgenerationof noiseitsvolume shouldbekeptlow.) 2.3Notation Thefollowingnotationisusedthroughouttheremainderofthepaper: M message;sequenceofasciibits Ex(M)encryptionofMwithX'spublickey Dx(M)decryptionofMwithX'sprivatekey KfMgconventionalencryptionofMwithkeyK (M;M2)concatenationofMandM2 Ax X's address. dmepaddingstringmtolength (byappendingrandombits) bmctrimmingstringmtolength (byremovingtrailingbits) 3MIX-fundamentalbuildingblock Asalreadymentioned,ananonymousr er,ora mix,isanentitythat,inadditiontoforwardingincomingmessages,strivestohidetherelationshipbetween incomingandoutgoingmessagetrac.(seefigure.)inourmodelweassumetheexistenceofapowerful adversary{eve{capableofrecording,removingor alteringpacketsenteringorleavingamix.eveisalso abletogeneratespuriousmessages. Amixfunctionsaccordingtothefollowingprinciple[2].SupposeAlicewishestosendmessageMto Bobanonymously.Shesubmitsaspeciallycomposed messageitothemix.iincludesmandbob'snetworkaddress.itisintelligibleonlytothemix.a transformedversionofi,calledo,isforwardedby themixtobob.ideallytherelationbetweentheincomingmessage,i,andtheoutgoingmessage,o,is obfuscated.thus,eveisunabletoconnectaliceto Bob.Thiskindofanonymityiscalled\unlinkability ofsenderandrecipient"[27]. TherearetwowaysforEvetocorrelateincoming andoutgoingmessages:i)bycontents,i.e.,message dataormessagesize,or,ii)bycausality,i.e.,byassociatingtimeofmessagearrivalwiththatofitsdeparture. Ingeneral,contentcorrelationcanbeaddressedby usingstandardcryptographictechniquesalongwith Mix Alice Bob Eve Figure:BasicModel padding.causalcorrelationcanbeeasilycounteredif theincomingtracvolumeissucientlyhigh.inthe nextsectionwefocusonmakingcontentandcausal correlationdicult. 3.Passiveattacks Thissectionaddressesso-calledpassiveattacks,i.e. thosethatcanbecarriedoutbymerelyobservingmessagetrac. 3..Contentcorrelation Twoelementscanhelpincontentcorrelation:actualcontentandlength.Forpreventionitsucesthat allmessagesto/fromamixbeencryptedandbeof uniformlength.wedenotethislengthby. TheuserencryptshismessageMandthedestinationaddressABobwiththemix'spublickey.Thus, I=Emix(ABob;M)whereABobisBob'snetwork address. UponreceiptandsuccessfuldecryptionofI,the string(abob;m)isberevealed.theoutputmessageo,consistingofm(incleartext)andotherdata addedbytheunderlyingcommunicationsnetwork,is forwardedtobobatabob.evemayattempttocorrelateoandibycomparingemix(abob;m)andi. TooutwitEve,randomone-time"salt"mustfactored intotheencryptiontoensurethatsuccessiveencryptionsofthesamemessageyielddierentresults. Inhybridsystemsbasedonbothpublicandconventionalkeyencryptiontherandomstringmightbe unnecessary.suchsystemstypicallyusearandomsessionkeytoencryptuserdatawithasymmetrickey algorithmandapublickeyencryptionalgorithmto encrypttherandomsessionkey.eachencryptionwith apublickeyusesadierentsessionkey,whichisrevealedonlytotheowneroftheprivatekey(themix inthisparticularcase).thus,eveisunabletocorrelateiandoeventhoughsheisabletore-encrypt (ABob;M).There-encryptionresultsinI0,which bearsnoresemblancetoi;referto[26]forcryptographicattacksonstraight-rsaimplementationof mixes. Inordertoavoidsizecorrelation,messagesizes mustbeconstantthroughouttheentiremixnetwork. 3

4 Messagesizeuniformitycanbeachievedbypadding toaconstantlength()withrandomdata.although seeminglyinnocuous,paddingisanimportantissue andgreatlyinuencestheimplementationofamix. Adetaileddiscussionofthisissueispostponeduntil Section6. Notethatthesecurityofthesystemisbasedonthe integrityofamix.inasingle-mixarchitecture,ifthe mixissomehowforcedtorevealitsprivatekey,identitiesofuserscanbecompromised.multiplemixescan beusedtoincreasethesecurityofthewholesystem. Thisisdiscussedinthefollowingsections. 3..2Timecorrelation Obviously,thereisastrongcausalrelationshipbetweentheincomingandoutgoingmessages.ThisrelationshipcanbeexploitedbyEve.Onesimplesolution istooutputmessagesinbatches,asoutlinedin[2]. Inthisscheme,atleastNinputmessagesareaccumulatedbeforebeingforwardedinrandomorder.N iscalledtheminimumbatchsize.werefertothis schemeasnormalorregularbatching. Underlowloadconditions,incomingmessagesmay besoscarcethatabatchofsizencannotbeformed withinareasonabletime.sendingoutrandom-looking decoymessagestorandomdestinationssolves(orat leastalleviates)theproblem.decoysareindistinguishablefromnormalmessagesexceptthattheyare immediatelydiscardedbytheirrecipientsafterdecryption. Inanenhancedscheme,calledintervalbatching,we dividetimeintoequalperiodsoflengtht.letnbe thenumberofincomingmessagesinagivenperiod. Thefollowingprocedureisperformedattheendof eachperiod: normalbatching ifnn N?ndecoysfollowedbybatchingif0<n<N ThisapproachguaranteesthatamessagewillbedelayedatmostTunitsoftimebyamix.Note thatbatchingmessagesintroducesariskbecause anonymitythendependsonthebehaviorofother users.thisexternaldependencecanpavetheway forotherattacks(seesection3.2..) Anotherpopularapproachtosolvingthetimecorrelationprobleminvolvesintroducingarandomdelay foreachmessage.thisrandomnessmakesthesystem nondeterministicbutnotnecessarilysafer.weavoid thisvenue. 3.2Activeattacks Inthissectionwediscussactiveattacks,i.e.those involvingdirectmodicationstomessageow,byaltering,inserting,delayingandevendeleting,messages. 3.2.Isolate&Identify Ifregularbatchingisused,Evemaysubmitanumberofmessagestoamix,forminganalmostcomplete batch,withonlyonemessagemissing.uponarrival ofagenuinemessage,theentirebatchisforwarded andevecansimplypickoutthemessageshedidnot generate[27].notethat,althoughthegenuinemessagemaybeencrypted,eveisabletocorrelatethe genuinemessagewithitsoutgoingcounterpart.the mixisthusconsidereddefeated. Intheinterval-basedbatchingapproach,ooding amixisuselessifgenuinetracisheavy.however, whenfewlegitimatemessagesarriveinagiveninterval,oodingcausesthemixtobelievethatdecoysare unnecessary.evemightevenremoveorrearrangemessagessothatonerealmessagetricklesintothemixper period.then,byinjectingfalsemessageseveisable tolinkthesingleauthenticmessagewithitsoutgoing counterpart. Thisattackisdiculttothwartcompletely.One simplebutonlypartialcountermeasureistorequire acertainnumberofdecoysevenwhenabatchisfull. Amoreeectiveapproachistheintroductionofintermixdetours;itisdiscussedinSection MessageReplay Evecantrytodefeatamixbyrecordingagenuinemessageandreinsertingitlaterintothemessage stream.asanincomingmessageiresultsinthesame outputowhenreplayed,associatingthetwoistrivial.becauseofitssimplicity,messagereplayisan extremelyseriousthreat.itispossibletopreventreplaybykeepingtrackofincomingmessagesanddiscardingreplays[2].replaydetectionisawell-studied topic[8,9].basictechniquesconsistofusingsequence numbers,randomnumbers(nonces)ordataandtime stamps. Techniquesinvolvingsequencenumbersornonces implyatleastsomesynchronization.however,thereis aninherentcontradictionbetweenthetermssynchronizationandanonymity.moreover,traditionalmethodsareconcernedwithauthentication,whichisnot requiredinourcase.underthesecircumstances,we havedecidedtouseavariantofatime-stampscheme. Inbrief,eachmessageisuniquelyidentiedand time-stamped.clearly,theidentiershouldrevealno informationaboutthemessage.assumingtheuseof hybridmessageencryptioncryptosystem(e.g.,asin PEMorPGP)weusethepublickeyencryptedform ofthesessionkeyasthemessageidentier.sincea messagedoesnotdecryptcorrectlyevenifasinglebit oftheencryptedsessionkeyisaltered,itisaninvariantofreplays.thesessionkeyisuniquewithahigh degreeofprobabilitybecause,itisusuallygenerated atrandomfromaverylargekeyspace5.thismethod isalsoverycost-eectivesinceamixdoesnothaveto performanyexpensiveoperationstocalculateunique identiersfortheincomingmessages;itsimplycopies theencryptedsessionkey. Itiscertainlyundesirabletokeeptrackofmessages indenitelyasitwouldresultinexcessivespaceusage. Asimplesolutionistotime-stampmessagesandush messageentriesaftersomexedsystem-widetimeinterval.thispointisfurtherdiscussedinsection8. Replyingtomessagesissomewhatdierentbecause \replays"alongareplypathareperfectlylegitimate (seesection5.6). 5pgpuses28bitIDEA-keys.Moreover,beforeRSAencryptingthisIDEA-key,itrandomlypadsittothemodulus ofthepublickey. 4

5 Alice Mix Mix Mix 2 3 Bob 5 3.3Cascadingorchainingmixes users'disposal.asmentionedearlier,ifonlyasingle maydecidetouseaseriesofmixestoforwardher messagetobob[2],seefigure2.thesystemthus becomesmoresecure. mixisused,thatmixistrustedtowithholdcritical information.insteadoftrustingasinglemix,alice Wenowassumethatthereisapoolofmixesatthe messagereceivedbybob,evehastosubvert/defeat ingthesystemwithoutpayingattentiontointer-mix trac.ifthetracloadislow,thesecuritydegeneratestotheworst-casescenariooutlinedinsection 3..2.However,inpractice,alargenumber(>00) ofindependentmixesdistributedaroundtheworld wouldmakeitverydicultforevetobeaglobal 4ForwardPath observer. themixesonthepath. cansimplyconcentrateonmessagesenteringandleav- fact,inordertolinkthemessagesentbyalicetothe IfEveisaglobalobserverofthemixnetworkshe Eve'staskbecomessignicantlymoredicult.In Figure2:Chainingmixes tion/decryption)havenoimpactonmessagesize.we exceptions)presentedinthissectionisduetochaum [2,3,4]. timebeing)thatcryptographicoperations(encryp- atinterveningmixes.mostofthematerial(withfew willreturntothisissueinsection6. 4.Compositionbysender anonymousmessagesandtheirsubsequenthandling Forthesakeofclarity,weassume(forthe Inthissectionwedescribetheprocessofgenerating composeshermessageaccordingtothefollowingprocedure: setofmixesisreferredtoastheforwardpath6.she sagetobobthroughfmixes;f;f2;:::;ff.this ()Thecleartextmessageispaddedtoexactly SupposeAlicewishestosendananonymousmes- 6WeusetheletterFtodenotemixesontheforwardpath. suresthateachmessageispaddedwithatleast =?randombytes.thereasonforreserving bytes.themaximumallowedcleartextmessage sizeis,,where<.thisrestrictionen- bytesforpaddingwillbecomeclearinsection (2)ThepaddedmessagedMeisthenencrypted 6.Theparametersandaresystem-wideconstants. withthelast,ff,isencryptedinthefollowing onceforeverymixontheforwardpath,starting xi=eff?i+(aff?i+2;xi?);for<if manner: x=eff(abob;dme) Theresultisanalogoustoanonionwhereeach whereefirepresentspublickeyencryptionwith EF(AF2;EF2(:::EFf?(AFf;EFf(ABob;dMe)):::)) xf= mixfi'skey.thenaloutcomeis: encryptionislikenedtoalayerofskin.toaccess sagesizeisshowninthegure.inparticular,the innerlayers,outerlayersmustbestrippedorst increaseswitheachencryptionandconcatenation step. (seefigure3.)theeectofencryptiononmes- dimensionsoftheboxesshowhowmessagesize takesplaceatthesuccessivemixes.thisensuresthat theinformationrevealedtoeachmixiskepttoaminimum. 4.2Processingbymixes Therstr er,uponreceptionofAlice'smes- mixontheforwardpath,f.7 atthesender,theonlytrustedentity.noencryption (3)Oncetheonionisassembleditissenttotherst Notethattheencryptionstepsareallperformed Figure3:ForwardmessagepreparedbyAlice formatconversionmusttakeplace. ablefortransmissionas .inthatcase,anappropriate sage,decryptsitwithitssecretkeytodiscoverthe addressofthenexthop,af2.thisisanalogousto removingtherstofskinoftheonion. alayerofencryptionuntilthelasthopisreached. Thelastr erstripsotheremaininglayerand 7Thebinarydataproducedbyencryptionmightbeunsuit- Similarly,eachmixontheforwardpathremoves bytes Address F2 Address Ff Addr. Bob Data Padding encryption with F s key other encryptions encryption with F(f ) s key encryption with Ff s key

6 discoversabob.themessageisthendeliveredwith allpaddingremoved. TheactualmessagereceivedbyBobshowsthatit hasbeendeliveredbymixff.bobdoesnotknowthe identitiesoftheothermixesnorthatoftheoriginator, Alice8. Toaccommodatethelargestpossiblenumberof users,thesystemofr ersassumesthattherecipientofanonymousmessageshasonlybasic capabilitywithnospecicsoftwaretohandleanonymousmessages.onlyregularmailisdeliveredtothe naldestination.inotherwordsthelastmixseesthe messageincleartext. Ifthedestinationhasencryptioncapability(e.g., PGP)Alicecanencryptthemessageusingtherecipient'spublickey.Thus,thecontentsofthemessage arehiddenfromthelasthop,andahigherdegreeof securityisachieved.obviously,ifthedestinationisa publicnewsgroup,usingsecretkeysmakelittlesense. 4.3Whatdoesamixknow? Oneimportantsecuritymeasureoftheentiremix networkistheamountofknowledgegainedbyamix inthecourseofprocessingamessage.byexamining -specicelds(e.g.,smtpheaders)anintermediatemixontheforwardpathcandiscovertheidentity ofthepreviousmixhop.withoutsomequestionable hackingof softwareitappearsimpossibletopreventamixfromgainingthisknowledge. Anotherpieceofinformationvisibletoamixisthe identityofthenexthop.itispossible{albeitin theory{topreventanintermediatemixfromknowing thenexthop.9webrieysketchonesimplemethod: Alicecomposestheanonymousmessagemuchas beforebutomitsmixaddresses{afi{fromthelayers. Eachinterveningmix,insteadofsendingthemessage tothenexthop,postsittoanewsgroupperiodically scannedbyallmixes.(analternativeistobroadcast themessagetoallmixes.)allmixestrytodecryptthe messagebutonlyonesucceeds.thesameprocedure isrepeateduntilthelastmixisreached;thelastmix forwardsthemessagedirectlytobob. Althoughithalvestheknowledgegainedbyintermediatemixesthissolutionisfraughtwithdiculties: theperformanceoverheadalonewouldbestaggering. Amorepractical,butcommensuratelyscaleddown, variationistogivethesenderanoptiontoinclude multiplemixaddressesineachlayer.thisway,an intermediatemixforwardsanoutboundmessageto severalnext-hopmixesandremainsuncertainwithrespecttotheidentityoftheactualnexthop. 5ReturnPath Thusfarwediscussedhowtosendmessages anonymouslywithoutenablingreplies.although uni-directionalcommunicationismostamenableto anonymity,itissometimesdesirableforananonymous mailrecipienttoreplytothe(stillanonymous)sender. Thiscanbeachievedbygivingthesenderanoption 8UnlessofcoursethemessagebearsAlice'snameor signature. 9Notethatlittlecanbedoneincaseofthelasthopmix. ofincludingareturnpathinformation(rpi)inthe anonymousmessage. 5.CreatingtheRPI TheRPIiscomposedbyAliceaccordingtothefollowingprocedure. ()AlicechoosesmixesR;R2;:::;Rrforthereturn pathandmixesf;f2;:::;fffortheforward path.(seefigure4.) Alice Bob R R 2 F 2 F F f R r Figure4:ReturnPath Themixesontheforwardpathandreturnpath arecompletelyindependent.thetwosetsmay beidentical,overlappingorcompletelydisjoint. (2)Alicerandomlychoosesakeyseed{KS{ and,usingit,computesrkeys,k;k2;:::;kr. Therearemanywaystodoso,e.g.:Ki= E(KS;i)forirThesekeyswillbeused bythereturnmixestoencryptbob'sreply. (3)Thekeyseed(alongwiththenumberofhopsr) isrstencryptedwithalice'spublickeytoform y0=ealice(ks;r). (4)Then,onceforeverymixonthereturnpath, startingwiththelast,rr,thefollowingencryptionisperformed: yi=(arr?i+;err?i+(kr?i+;yi?)) (forir) Thenaloutcomeis: yr=ar;er(k;ar2;er2(k2;::: :::ERr(Kr;AAlice;EAlice(KS;r)):::)): Werefertotheresultantblock,showninFigure 5,asalittleonion,similarinconstruction,but smallerthan,theforward-pathonion. (5)AliceinsertstheresultingRPIblockintothebeginningofthecleartextmessageshewishesto send.thentheprocedureoutlinedintheprevioussectionisfolloweduntilthelastr eron theforwardpath,ff,isreached.ffdetectsthe 6

7 7 K, Address of R2 encryption with mix R s key RPIintheoutboundmessageandmodiesthe mailheadersuchthatalaterreplybybobwould Figure5:ReturnPathInformation other encryptions Kr, Address of Alice encryption with mix Rr s key [bytes] encryption with Alice s key KS, r RPIismeanttobetreatedopaquelybyBob. receivedbybobisprexedwithanrpiblock.the 5.2Replyingbyrecipient Asmentionedabove,themessagesentbyAliceand anycryptographiccapabilityfrombob.) destination{bob{butwetrytoavoidrequiring sumethattherpiis"visible"tothelasthopmix. ItwouldbemoresecuretoencryptRPIforthe besentdirectlytorandnottoff.0(weas- Padding prependstherpihereceivedfromalice.hethen namelyr. sendshisreplytotherstmixonthereturnpath, Bobcomposeshisreplyasusualandsimply ThemessagereceivedbyRisshowninFigure6. 5.3Replyprocessingbyr ers (SMTP) Header inga\reply-to"eld[6]intheheaderofthemessagesentto byrpi0.astherstmixonthereturnpath,r, RPIandextractsit.LetusdenotethisoriginalRPI UponreceivingBob'sreply,Rdetectstheincluded Figure6:Bob'sreplyasreceivedbyR Bob. performsthefollowingsteps: 0InRFC-822-compatiblesystems,thisisachievedbyinclud- Message Body ()Combinetheheaderandbodyofthereply(withouttheRPI)intoastringM0.Thisisthestring AR2,theaddressofR2.LetRPIdenotethe thatwillultimatelyreachalice. (3)DecryptRPI0,torevealtherandomkeyKand (2)PadM0tosize?!. (4)EncryptdM0e?!withKtoformY= (5)Send(RPI;Y)toR2.Notethatthesizeofthis Thenextr?r ersonthereturnpathwill messageis. tion. KfdHeader+Bodye?!g. newrpi,whichhasonefewerlayerofencryp- performasimilaroperation.atmixri: ()Afterreceptionof(RPIi?;Yi?)decryptRPIi? isidenticalexceptthatthenexthop'saddresswillbe (2)EncryptYi?byKitoform (3)Send(RPIi;Yi)tothenexthopARi+. Forthelastmixonthereturnpath,theoperation denotedrpii. torevealai+andki.theresultantvalueis AAliceinsteadofARr+. distinguishablefromamessageontheforwardpath becausebothhavesize.thestructureofbothmes- Itisimportanttonotethatareplymessageisin- Yi=KifYi?g. sageslookidenticaltoanoutsideobserver,i.e.en- cryptedgibberish. longstotheforwardorreplyowsbyperformingat mosttwodecryptionattempts. Amixisabletodeterminewhetheramessagebe- Alicesees: messageisonthereplypath. thedecryptionoftheentiremessage,bytes,should cryptionhavebeenremovedexceptthelast.therefore besuccessful2 5.4Handlingrepliesattheoriginator Bob'sreply.However,bythistime,alllayersofen- Otherwise,themessageisontheforwardpathand Ifdecryptionofrst!bytesissuccessfulthenthe Eventually,Alicereceivesthestring(RPIr;Yr)as RPIr=EAlice(KS;r)and still!. K;K2;:::;Kr,inordertoprocessthereply.Inour Chaum'smodel[2],Alicehastorememberthekeys icetoregeneratek:::kr.successivedecryptions ofyrwiththesekeysyieldm'.wenotethatin AssumeforthetimebeingthatthesizeofthisnewRPIis 2Ifbothencryptionattemptsfailthemessageisdiscarded. DecryptingRPIrrevealsKSandrandallowsAl- Yr=KrfKr?f:::KfdM0eg:::gg

8 Alice R r R 2 R F F 2 X X 2 X x F f Bob 8 mainstatelesswithrespecttooutstandingmessages. simplifyingtheprocessingandallowingalicetore- scheme,keysareembeddedinthereply,considerably ingananonymousmessagetoanewgrouporabulletin inbothdirections.supposethatalicebeginsbysendtions,foraliceandbobtocommunicateanonymously headerasseenbytherstmix.thisheadercanbe 5.5Two-wayAnonymousConversation messageisnotequallyanonymous. usedtoidentifybob.thus,areplytoananonymous Despitetheabove,itispossible,undersomecondi- NotethatM'iscomposedofBob'sreply,andits herrpibutitrepresentstheonlywaytocommunicatewithalice.hesendshisreplym'tor(sthop inrpi)anonymouslythroughmixesx;x2;:::;xx (seefigure7).inotherwords,bobcreateshisown forwardpathandconnectsittoalice'srpi. board.thismessage,amongotherthings,includesan RPI.SinceBobdoesnotknowAlice,hedoesnottrust anotherseriesofmixes,seefigure8.thus,itispossiblefortwopartiestocommunicateelectronicallyin AlicecanreplytoBob'sanonymousreplythroughyet bothdirectionswithouteitherpartyknowingtheidentityoftheother. 5.6Securityofreplies BobcanalsoincludeanRPIinhismessagesothat Figure7:Bob'sanonymousreplytoAlice. fectlylegitimateformultiplerecipientstogenerate toforward-boundmessages.thisisbecauseitisper- applysimilarreplaydetectionmeasurestorepliesas severalresponsestoasingleanonymousmessage.(this holdsonlyifaliceexplicitlyallowsrepliesbyincluding anrpiblock.) ever,thatincaseswhererepliesarenotwanted, Thus,Evecanmountareplayattack.Note,how- Unfortunately,itisdicult(ifnotimpossible)to X X 2 X x R r R 2 R F F 2 F f dress.inotherwords,sincerpi-sarenotdigitally dedrpi.also,anrpiisnot"tied"toagivensender; itistrivialtocreateanrpiwithafakereturnad- signed,theycanberepudiated. 5.6.Inter-MixDetours Babelallowsmessagestobesentwithoutanembed- Figure8:AlicereplyingtoBob'sanonymousreply. N N N 2 curity(i.e.,untraceability)ofrepliesbyintroducing n Y thereplytothenexthopri+.inthedetourmode, inter-mixdetours. path.normallyamixri(0i<r)forwarded Asimpleyetpowerfulwayofstrengtheningthese- LetR;R2;:::;Rrdenotethemixesonthereturn Y2 Yy Richoosesarandomforwardpath(calledadetour) Di;Di2;:::;Diri,whichconsistsofnormalmixesdrawn fromtheglobalmixnetwork.themessageisthen asshowninfigure9. anonymouslyforwardedtori+throughthesemixes toured.however,ifthemixesonthedeviatedpath whererepliestothesameanonymousmessagecanbe correlatedbymerelyexaminingtheexposedrpi. pearsdierentforeachreply,inparticular,during areplayattack.comparethistothepreviouscase structedbyamixandnotauser. theyarearegularanonymousmessagesonlycon- Messagesontheforwardpathcouldalsobede- AdetourensuresthatamessageleavingRiap- Thereisnothingspecialaboutdetour-edmessages; benetthatcanbederivedfromdetouringforwardboundmessagesisthat,unlikechaum'smixes[2],we wouldhavetobetaggedaccordingly.animportant canguaranteethateventheoriginatorofananonymousmessagecannotrecognizeitsownmessageasit leavesamix. furtherdetouredmessages,endlessdetourloopswould occur.toavoidthisproblem,detouredmessages Oneslightdrawbackofintroducinginter-mixde-

9 R r R R Alice Bob envisaged:insteadofdeliveringareplydirectlytoal- toursisthatamixnowhastoknowaboutothermixes; Figure9:Inter-mixdetoursonreplies. analogoustothebroadcastsolutionasdescribedin 2 [0] Indirectreplies thusfar,ithasnotbeenarequirement. matchingthatnumbertag.thismethodisroughly ice,bobcandeliverittoalocalnewsgroupwithaspe- cialnumbertag.alicescansthisnewsgroupforreplies Anentirelydierentapproachtorepliescanalsobe F F 2 F f tice,however,ciphertextisusuallysomewhatlonger cleartextcanbedevised,e.g.cfbmodeofdes 6KeepingMessageSizesConstant withapre-distributedinitializationvector.inprac- thancleartext.inhybrid-keycryptosystemsthesize increaseisparticularlynoticeableduetotheneedto sagesareofthesamelengthasthecorresponding shortermessage. includeanencryptedrandomsessionkeyinaddition totheciphertext.conversely,decryptionresultsina Inprinciple,acryptosystemwhereencryptedmes- mixes.thedierencesinsizecanbeexploitedbyeve. wouldstillvisibletor ers.thisallowsthemto creaseaftereachdecryptionasittravelsthroughthe outgoingmessageto.althoughallmessageswould havethesamesizeforaneavesdropper,thedecrease Theproblemcanbesolvedifeachmixpadsthe Thus,thelengthofan messagewouldde- D r D r D r 2 D r 2 rr D D 9 orfollowinghops,andiscontrarytooneofourgoals makeeducatedguessesastothenumberofpreceding trac,thersthopcaninferthatitisthersthop setinsection2.2. bycomparingalice'saddresswiththelistofknown sentbyaliceisindistinguishablefromotherinter-mix inghopsshouldbekeptsecret.althoughthemessage therecipient,respectively. becausetheycanlearntheidentityofthesenderand viousandnexthopandnothingelseaboutthepathof amessage.therstandlasthopsarealittledierent Furthermore,thenumberofprecedingandfollow- Eachmixshouldknowonlytheidentityofthepre- hopsnorthenumberoffollowingones. diatehops,shouldnotknowthenumberofpreceding mixes.inasimilarfashion,thelasthopcandeduce thatitisthelast.however,allothers,i.e.interme- thepointclear. isdividedintoaxednumberofxed-sizeblocks. ThisisthesolutionimplementedintheMixmaster information-carryingdata.anexampleshouldmake thatsomepadding(encryptedornot)alwaysfollows package[7]. andmorestorage-ecient.thebasicideaistoensure Chaum[2]presentsageneralsolutionwheredata bytesofc0hasnoimpactontheencryptedversion havinglength+.if<pthentrimmingtrailing ofdatafollowedbyp=?mbytesofpadding.also supposetheencryptedversionofcisdenotedbyc0 LetstringCoflengthbecomposedofMbytes Herewepresentanotherapproachthatissimpler padding,seefigure0.inotherwords,trimming ofthedatabutonlyontheencryptedversionofthe bytesresultsmerelyinthelossoftheoriginalpadding butnotindataloss. ciphertextwillbedetected,leadingtopossiblerejec- mationaboutthecleartext,alterationsmadetothe algorithmshouldbesuchthatcorrectdecryptionof agivenblockdependsonsomeoralloftheprevious blocksbutnotonfollowingblocks.thisistruefor mostencryptionalgorithms.wealsonotethatifthe encryptionpackageusedembedscrcorlengthinfor- Forthepreviousstatementtohold,theencryption Figure0:Padding Encrypting Trimming bytes Data Padding Encryption Data Padding Trimming excess bytes Data Padding

10 ticularr ersystemprovides.inparticular,the quirementsforconstructingmixesthatprovidebi- ofamix,thepotentialthreatsfacingitandre- tionofthemessage.thisissueisfurtherdiscussedin notionsofconfusionandstaunchnessareintroduced malizeandanalyzethedegreeofanonymityapar- Section Heedinganonymity anddened. 7.Fixed-PathSystems directionalanonymity.thissectionattemptstofor- Intheprecedingsectionswedenedthenotion estingwaytoincreasetheoveralltracloadistouse mixes.thisshouldnotnecessarilybeso.aninter- thesamexedmixpathforallmessages[24].we uration,messagesalwaysenterthesystematm,are denotethispathbym;m2;:::;mm.inthiscong- ischosenatrandomfromalargepoolofavailable forwardedtom2,thentothenextmix,andsoonuntil theyleavethesystematmm. Byforcingallmessagestovisitallmixespertaining Untilnowwemadeanassumptionthatamixpath maximal.thereareotheradvantagesofusingaxed tothexedpath,thetracgoingthrougheachis path.themixnetworkbecomesmorereliable,less chaoticandmucheasiertomanage. goodengineeringpractices.clearly,ifamixisoverwhelmedbysheertracvolume,datalosscanoccur. Thisisnotaseriousdrawbackbecause,asthetrac increasesbeyondtheprocessingcapacityofthemixes, otherxedpathscanbeintroducedtoooadthepreviousxedpath(s). Maximizingtracloadmightseemcontraryto lowingattackwhereeveallowsonlyasinglemessage therstandlastmixes,mandmm.considerthefoltem.shecanevenlearnagreatdealbywatchingonly NowitismucheasierforEvetomonitortheentiresys- mixesonthexedpath,m,isclearlylimited.thus, theadvantageofusingalargenumberofmixesislost. Owingtopracticalconsiderations,thenumberof causeeveallowsonlyasinglegenuinemessagetoenter Thisattackisreferredtoasthetrickleattackbe- Figure:TheTrickleAttack totrickleintoaintervalbatchingmixnetwork.eve thesystem.byobservingtheoutputofthelastmix, Mm,shecancorrectlycorrelatethegenuinemessage withitscorrespondingoutput. 0 single message per period Controlled by Eve... M M 2 M m 7.2Systemstaunchness,miss&guessfactormixdecoysdonotconfuseEve. However,asmanyuserswouldbealarmedoreven themtoleavethemixnetwork.unfortunately,inter- upsetbyreceivingdecoymessages,wedonotallow Decoysmightbeusedtooutfoxthetrickleattack. makingacorrectcorrelation.(obviously,g+m=.) ofconfusionintroducedbythemixes.similarly,the andamessageleavingit.itrepresentsthemeasure mixesuseregularbatchingwiththebatchsizesetto guessfactor,denotedg,isdenedastheprobabilityof relationbetweenamessageenteringthemixnetwork networkastheprobabilityofmakinganincorrectcor- Wedenethemissfactor,denotedM,foramix Considerthexed-pathcasewheretheintervening ismoresecurethanasinglemixbutnotnecessarily advantageofchainingthroughseveralmixes? becauseevehastosubvertallmixesinordertobreak theanonymitychain.inotherwords,achainofmixes theguessfactorofasinglemix.whatisthenthe N.Then,Gforthexedpathisequalto=N.It isinterestingtonotethattheresultisidenticalto amessagetravelsthrough. 7.3TheQuestforConfusion thisfar,staunchnessisequaltothenumberofmixes defeatmessageanonymity.inallschemesdescribed moreconfusing.wedenethestaunchness,s,ofa mixnetworkasthenumberofsecretkeysneededto Achainofmixesismoresecurethanasinglemix mixesuseinterval-basedbatchinginsteadofregular sagesarrivingduringintervaliisdepictedinfigure fectlysynchronizedandmessagetransmissiontimeis smallbutnon-zero3,theitineraryofagroupofmes- batching.assumingtheclocksofr ersareper- leaveitattime(mt),alongwiththerestofthe messagesenteredduringthesameinterval.theguess 2.Amessageenteringthesystematintervaliwill Considerthexedpathcasewhereintervening teminintervali. whereniisthenumberofmessagesenteringthesysabilityforcorrectcorrelationisclosetoone.thisis factorforperiodiisgivenby missfactor,thebetter.onecouldsimplyincreasethe whatonewouldexpectbyintuition. Thus,iffewmessagesenterthesystem,theprob- Forobviousreasons,thehigherthevalueofthe Gi=ni; durationoftheinterval,t,toaugmenttheaverage numberofincomingmessagesperperiod.however, interval. thishasanegativeimpactontheaveragedelayexperiencedbymessages.theywillbedelayedonthe thefollowingmixes.thus,thetotalaveragedelayfor averagebyt=2intherstmixandforafullperiodat 3Sothatmessagesarriveatthefollowingmixduringanew

11 messages leaving M messages leave the mix system 2 messages leaving M messages entering M 2 messages entering M3 messages leaving M m messages entering M m Figure2:Intervalbatchingwithsynchronizedclocks thexedpath,neglectingtransmissionandprocessing time,isgivenby messages entering M... time butwithanaddedtwist.the"twist"isthatattheend wheremisthenumberofr ersonthexedpath. 7.3.Probabilisticdeferment duceanewschemebasedonthetimeintervalmethod Continuingourpursuitofconfusion,wenowintro- E[Delay]=T(2+m?)[sec] it (i+)t (i+2)t (i+m )T (i+m)t aredeferredforanadditionaltimeperiodwhileall foranadditionalperiod. intervalandd=?qtheprobabilityofdeferringit refertothisschemeasprobabilisticdefermentwith intervalbatching. takenbyippingabiasedcoin.letqbetheprobabilityofforwardingthemessageattheendofthecurrent othermessagesaresentwithnofurtherdelay4.we ofeachtimeinterval,someoftheincomingmessages deferred.theprobabilitymassfunctionofkisgiven timesagivenmessageleavingthemixsystemhasbeen LettherandomvariableKdenotethenumberof Thedecisiontodeferagivenincomingmessageis ingappropriatestateinformation. PfK=kg=mkqm?kdkwherek=0;:::;m; 4Incominganddeferredmessagesaredistinguishedbykeep- whichisthebinomialdistribution.theexpectedvalue ofkissimplye[k]=md layedaslongas2tmseconds;delayedforafullinter- valandalsodeferredonallmmixes. eragewillbedelayedby: E[delay]=T(2+m?)+Tmd Thus,withthenewscheme,amessageontheav- toguessboththeintervaltowhichamessagebelongs (i.ek)andalsoitspositioninthatinterval.presuming thatthenumberofmessagesarrivingateachperiod Notethatintheworstcaseamessagemaybede- Withthenewschedulingpolicytheopponenthas avgaddtldelay[sec] {z} themostlikelydefermentevent. isroughlythesame5,eve'sbestguessistoassume where0<d<,asbgoesfrom0tom,pfb=bg forsimpleintervalbatching,timestheprobabilityof themostlikelydefermentevent,i.e. intervali,designatedbgi,isgivenbytheguessfactor Thustheguessfactorforthenewpolicyforthe arigorousproof,referto[34].foralessrigorous rstincreasesmonotonicallyandthendecreasesmonotonically,reachingitslargestvaluefor6de[b]e,the butamusingproof,thereadercanapproximatethe binomialbythepoissondistribution,generalizethe smallestintegergreaterthanorequaltomd.for ForabinomialvariableB,withparameters(m;d), bgi=gipfmostlikelykg derivativewithrespecttoanowcontinuousb. factorialtothegammafunction7andthentakethe =2.Themostlikelyvalueforkis3,withprobability isreachedforvaluesofdnottoofarawayfrom=2. event,pfb=de[b]eg,asafunctionofthedeferment dierentforevenvaluesofm,forwhichtheminimum mostlikelyeventisminimalford==2.thisisalittle probabilitydforevenandoddvaluesofm. Foranumericexample,supposem=5andd=q= Figure3showstheprobabilityofthemostlikely plydoubledthetimeintervaltot0=2t,astohave ducesanadditionaluncertaintyof0 32.Thus,theprobabilisticdefermentmethodintro- Clearly,foroddvaluesofm,theprobabilityofthe latedinterval. thesamedelayintheworstcase,thenthedecreasein theguessfactorwouldbeonly=2.theprobabilistic batchingforallvaluesofm>,evenintheworst defermentmethodcompareswellwithsimpleinterval case. 6"E"doesnotmeanencryptionhere. 5Otherwise,messagesarelikelytobelongtothemostpopu- 32.Ifwehadsim- equaltoitselfwhenderived.however,itisonlydenedfor<+. 7Liketheexponentialfunctionthegammafunctionisalso

12 Probability of the most likely b Odd number of mixes m= Even number of mixes m= m=3 tionofd m=4 m= AHybridApproach m= m= domorderpath,imposesaxedsetofmixesbutallows Figure3:Probabilityofthemostlikelybasafunc- m= method,thetracloadisoptimal.however,there arenocriticallines.evemustobserveandcontrolall communicationslinestodefeatthemixnetwork.the traversingtheminanyorderchosenatrandom,with eachmixvisitedonlyonce.aswiththexedpath m=00 m=000 usetoincreasetheconfusionfactorfurther. Ahybridconguration,referredtoasxed-setran forthexed-setrandomordersystem.however,it probabilisticdefermentapproachcanalsobeputto Itisverydiculttocalculatetheconfusionfactor Deferment probability, d Deferment probability, d combinessomeofthebestfeaturesofthemethods mentionedsofar. 8Implementation andrequirementsdescribedinthispaperhasbeenimplementedtheibmzurichresearchlaboratoryduringrsthalfof995.thissectiondiscussessomeof 8.Computingenvironment toimplementbabel.perlisreadilyavailableon Ananonymousr erconformingtotheideas thesalientaspectsoftheimplementation. ThepopularscriptlanguagePerl[32,33]wasused Probability of the most likely b 2 mostunixplatformsandiswell-suitedforprocessing looselystructureddatasuchas messaged.we optedforthelatestincarnationofperl,version5. ware,wechosepgptoprovidethecryptographicbase. 8.2PrettyGoodPrivacyorPGP pgpcombinestheconvenienceandsecurityofpublickeyalgorithmswiththehighspeedofconventional thisisnotthecaseforautomated(batch)processing; errorconditionsrequireunexpecteduserinteraction, cryptography.itoersfull-blownmessageprivacyand andthereturncodesareattimesconfusing. 8.2.PGPleformat pgpiswell-suitedforinteractiveuse.unfortunately, authentication,basedonrsa[30]andidea[4,5]. encryptedandsigned,buttheusercanviewitscontentsandverifyitssignaturewithasinglecommand. Atthebytelevelthisisachievedbyembeddingacom- Withpgp,an messagecanbecompressed, Sinceitwasdesignedwiththemassappealinmind, tographicoperations,whicharenotoriouslycostlyin termsofprocessingpower. Perl.However,theimpactofinterpretingthecode atruntimeisnegligiblecomparedtothatofcryp- costinvolvedinusinganinterpretedlanguagesuchas Itbeingthemostpopular encryptionsoft- Werecognizethatthereisaninherentperformance pressedpacketinsideahybridrsa-ideaencrypted packet.thispacketitselfisthenembeddedinasignaturepacket(figure4)whichcaninturnbeembedded inaradix-64asciiarmor. unknowntype,i.e.userdata,isencountered.althoughthismightbethecorrectbehaviorattheuser level,itisinadequatewhenmultipleencryptionis pgprecursivelyprocesseseachpackettypeuntilan Figure4:MultiplePacketEmbedding signature batchprocessing. used.inthatcase,pgp8attemptstocontinuede- mixes). missing(amixdoesnotknowthesecretkeyofother cryptingafterarstsuccessfuldecryption.thesec- onddecryptionoperationwillusuallyfailbecausethe secretkeyneededtoperformtheoperationwillbe 8Behaviorobservedwiththe\+force"optionrequiredforin radix 64 Armor RSA IDEA compressed compressed data

13 Cipher byte type CTB 8 bits messageheadersalsocontainssensitiveinformation PEMisevenworseinthisrespect,astheunencrypted PEMmessageheaderscontainidenticationofboth senderandrecipient[3].thecleartextpartofpgp privacyandauthenticationbutnotsenderanonymity. thatcanbeusedbyanattackertocorrelatemessages.thispotentialthreatwascarefullystudied,anopedattheearlierstagesoftheproject. aversion-independentpgpformatparserwasdevel- Furthermore,pgpismeanttobeusedfor packet length 8/6 bits algorithm type 8 bits byte (= for RSA) Figure5:Dataformatforencryptedle recipient key ID 64 bits RSA encrypted IDEA key variable variable mentionedinsection6,trimmingisusedtoenforce 8.2.2Sideeectsofencryption IDEA uniformmessagesize.fortunately,whencompression textintotheciphertext.thiscausespgptoreject foreencryptingit9.however,sinceuniformmessage lesalteredinanyway,particularlytrimmedles.as sizeisaconcern,compressionisalwaysturnedo. Incompressionmode,pgpaddsaCRCoftheclear- Thispreventsmessagesfromshrinking. Bydefault,pgpattemptstocompresscleartextbe- Thereisanotherreasonforturningocompression. (message body) isturnedo,pgprecordsonlythelengthofthecleartextmessage.thus,alterationstodatalengtharphertext.wecapitalizeonthisbehaviortoimplement cleartext(e.g.,mailheaders)usuallyprecedesthepgp partofthemessage.moreover,additionalcleartext thantheprerecordedvalue,butacceptslongerones. inan messagethatincludespgpciphertext,the detectedbutnotthosetocontents. Thisbehaviorcanbeexplainedbyconsideringthat, (e.g.acleartextsignature)usuallyfollowsthepgpci- 9Somethinkthatcompressionenhancessecurity;wedonot. Tobeprecise,pgprejectsmessagesthatareshorter 3 presentedinsection Radix-64format sortofconversionmusttakeplacetosendencrypted simpleandecientconversionmethodisradix-64armoring.itisdenedin[6]. 8.3R erdeployment dataover7-bitchannelssuchas .aremarkably Aspgp-encryptedlesareinbinaryformat,some theforwardandreplymessagesindistinguishably,as minutes,withouthavinganyadministratorprivileges. pavesthewayforasecuritybreach.sincebabelis Personal istreatedasusual,butanonymous accountintoananonymousr erinamatterof on lters.anyusercantransformhiscomputer inthe.forwardle.referto[5]forfurtherinformation theuser'smailbox20.thisiscompatiblewiththeinternet'spopulistphilosophy.however,notethatthis mailislteredandprocessedwithoutevercluttering ABabelmixisdesignedtoactasalterinstalled designedwithaminimumofhumaninterventionin mailersitecanattractswarmsofmessages.thiscan mind,thepasswordneededtoaccessthesecretkeyof congurationle.althoughthisleisnotaccessible toacasualuser,thesystemadministratorcanusually overridethesafeguards.furthermore,apopularre- ar erisstoredincleartext,inaread-protected mentionedexportrestrictions. resultinseriousperformancedegradationonthelocal 8.4Proxies raphypersebutalsotoequipmentthatmakesuse duetou.s.exportrestrictionsoncryptographicparaphernalia.restrictionsapplynotonlytocryptog- notcontainasinglelineofcryptographiccodeandreliescompletelyonpgpitisstillsubjecttotheafore- ofcryptography.inparticular,althoughbabeldoes host. TheactualdeploymentofBabelhasbeendelayed ontheuser'sbehalf.theproxymixisalsoabletosubstituteitselffortheuserinordertoprocessmultiply encryptedreplies.consequently,itispossibleforany bare-bones usertosendanonymousmessages Babeloersaso-calledproxymodeofoperation.In thismode,auserwithnobabelsoftwarecanaskany andreceivereplies.2 mixtocomposeandforwardananonymousmessage Inordertoappealtothegreatestnumberofusers, 8.5Messagelength Concretevalues cansendtheirordersencryptedwiththeproxymix's publickey. However,usersequippedpgpbutnoBabelsoftware curebecausetractotheproxymixowsincleartext. esthatanymailersoftwareshouldbeabletosend andreceivemessagesatleast64kbytesinlength(includingheader).takingintoaccounta33%increase 20Unlessanerroroccurswhileprocessingthemessage. 2Thisisparticularlyapplicabletonon-Unixusers. Theproxymodeofoperationsissomewhatlessse- ofradix-64armoring,themaximumuniformmessage TheInternet "bible",RFC23[3],speci-

14 size,,wecouldsafelyadoptis48kbytes22.being concernedbynetworkbandwidth,weoptedforhalf thatnumber,i.e.24kbytes. Fora52-bitpublickey,pgpincreasesmessagesize byabout5bytesateachencryption.experiments showthatthethicknessofalayeroftheanonymous onionisonaverageapproximately220bytes.therefore,when2kbytesofpaddingareused,amessage cansafelyincludeninelayersofencryption.therecommendedrpisize!is.5kbytes.thisallowsapproximatelysevenmixesonthereturnpath. Weintentionallychosenottoprovidesupportfor largerles.thisistheacceptedpracticeonexistingr ers.itismeanttofrustratetheanonymous transmissionofgraphicles,whichtendtobevery large23.itisstillpossibletosplitlargerlesinto smallerpiecesandsendthemanonymously. 8.6TimeSynchronization&ReplayDetection AsmentionedinSection3.2.2,eachlayerofthe onioncreatedbyaliceincludesatimestamp.the valueofthetimestamp,referredtoas,isthenumberofsecondselapsedinsecondssincejanuary,970 GMT,tothemomentofmessagecompositionbythe sender. ABabelmixusesatwo-stepreplaydetection. First,itrecordsauniqueidentierofthemessageas describedinsection3.2.2.aslongastherecordis inthedatabase,replaysaredetected.however,inordertokeepthedatabasesizereasonable,therecord isdeletedattime(+).thereafter,anymessage bearingthetimestamporolderwillbediscardedas beingtooold;notnecessarilyforbeingareplay. Timestampsareintroducedmerelytokeepthereplaydatabasesmall.Thus,onlylooseclocksynchronizationisneeded.Assumingthetotaldelayexperiencedbymessagesatr erstobeaboutonehour, wechosetobe24hours,oneorderofmagnitude largerthanmessagethedelay.thus,thetimeittakes tovisitallmixesontheforwardpathisconsidered negligiblewithrespectto. Withsuchacoarsevalueof,itissucientthat hostskeepclocksaccuratewithinadayforthesystem tofunctionproperly. 9Conclusions Thispaperpresentedananonymousr ersystemcalledBabel.Babelisexibleenoughtoallow bothsendingandreceivinganonymouselectronicmessages.anonymitycriteriahavebeendenedinorder tocomparedegreesofanonymityprovidedbyvarious congurations. ThebasiccomponentsofBabel,mixes,arenot awareofeachotherandlearnverylittleaboutmessagestheyprocess.incontrasttosomecurrentlyoperatingr ers,babelmixesdonotdependon (potentiallytreacherous)aliastables. ThesoftwareimplementationofBabelisbasedon freelyavailableingredients:perlandpgp.atthe 22nottakingtheheadersizeintoaccount. 23andofquestionablenature. sametime,thesystemremainsaccessibletouserswith onlyabasic capabilitythroughtheuseofits proxymode. ABabelmixcanbeveryeasilysetupbyany userhavingonlyasimpleunixaccount.however, itisenvisagedthatsettingupaninternet-widemix network(mesh)willtakesometime. Aswithanynewtechnology,someabuseisunavoidable.CaveatEmptor! Acknowledgments TheauthorswishtothankPh.Janson,M.Waidner,M.Steiner,R.Hauserandtheanonymizedrefereesformanyhelpfulcommentsandsuggestions. References []D.Akst,\Postcardfromcyberspace,"LosAngelesTimes, February [2]D.Chaum,\UntraceableElectronicMail,ReturnAddresses,andDigitalPseudonyms,"Communicationsofthe ACM,v.24,n.2,Feb98,pp.84{88. [3]D.Chaum,\SecuritywithoutIdentication:Transaction SystemstomakeBigBrotherObsolete,"Communications oftheacm,28/0,985,pp.030{044. [4]D.Chaum,\TheDiningCryptographersProblem:UnconditionalSenderandRecipientUntraceability,"Journalof Cryptology,/,988,pp.65{75. [5]B.Costales,E.AllmanandN.Rickert,\Sendmail", O'Reilly&Associates,993. [6]D.H.Crocker,\StandardfortheformatofArpaInternet messages",rfc822,august982. [7]L.Cottrell,\MixmasterandR erAttacks," [8]D.W.DaviesandW.L.Price,\SecurityforComputer Networks,"JohnWiley&Sons,984,pp.37{43. [9]D.E.R.Denning,\CryptographyandDataSecurity," Addison-Wesley,982 [0]D.J.FarberandK.C.Larson,\NetworkSecurityviaDynamicProcessRenaming,"FourthDataCommunications Symposium,Oct975,QuebecCity,pp.8{8. []J.Helsingius:Pressrelease,February20th995. [2]E.Hughes,\CypherpunksManifesto,"distributedon Usenetandvariousmailinglists,March993. [3]InternetEngineeringTaskForce,\RequirementsforInternetHosts{ApplicationandSupport,"RFC23,October 989. [4]X.Lai,\OntheDesignandSecurityofofBlockCiphers," ETHSeriesinInformationProcessing,v.,Konstanz: Hartung-GorreVerlag,992. [5]X.LaiandJ.Massey,\AproposalforaNew BlockEncryptionStandard,"AdvancesinCryptology EUROCRYPT'90Proceedings,Berlin:Springer-Verlag, 99,pp.389{404. 4

15 [6]J.Linn,\PrivacyEnhancementforInternetElectronic Mail PartI:MessageEncryptionandAuthentication Procedures,"RFC42,Feb993. [7]S.Maguire,\WritingSolidCode.",MicrosoftPress,993, pp.79{80. [8]T.May,\CryptoAnarchyandVirtualcommunities,"InternetSecurityJournal,April995. [9]D.L.Mills,\Algorithmsforsynchronizingnetwork clocks."rfc956,september985. [20]D.L.Mills,\Experimentsinnetworkclocksynchronization,"RFC957,September985. [2]D.L.Mills,\NetworkTimeProtocol(Version3)Specication,ImplementationandAnalysis,"RFC305,March 992. [22]W.Mossberg,\Personaltechnology,"WallStreetJournal, Jan [23]J.Quittner,\UnmaskedontheNet,"Timemagazine, March6995. [24]A.Ptzmann,\HowtoimplementISDNswithoutuser observability Someremarks,"InstitutfurInformatik, UniversityofKarlsruhe,InternerBericht4/85,985. [25]A.Ptzmann,B.PtzmannandM.Waidner,\ISDN- Mixes:UntraceableCommunicationwithVerySmall BandwidthOverhead,"GI/ITGConference:CommunicationinDistributedSystems,MannheimFeb.20{ 2299,Informatik-Fachberichte267,Springer-Verlag, Heildelberg99,pp.45{463. [26]A.PtzmannandB.Ptzmann,\Howtobreak thedirectrsa-implementationofmixes,"advances incryptology EUROCRYPT'89Proceedings,Berlin: Springer-Verlag,990,pp.373{38. [27]A.PtzmannandM.Waidner,\NetworksWithoutUser Observability designoptions,"eurocrypt85,springer- Verlag,Berlin986,pp.245{253.Revisionin:Computers &Security,6/2987,pp.58{66. [28]J.B.Postel,\Simpl TransferProtocol",RFC82, August982. [29]R.RivestandA.Shamir,\HowtoExposeanEavesdropper,"CommunicationsoftheACM,v.2,n.2,Feb978, pp.20{26. [30]R.Rivest,A.Shamir,andL.M.Adleman,\CryptographicCommunicationsSystemandMethod,"U.S Patent4,405,829,20Sep983. [3]B.Schneier,\AppliedCryptography,"JohnWiley&Sons, 994. [32]R.Schwartz,\LearningPerl,"O'Reilly&Associates,993 [33]L.WallandR.Schwartz,\ProgrammingPerl,"O'Reilly &Associates,993. [34]R.Sheldon,\ArstCourseinProbability,"Macmillan, fourthedition,994,pp.47{67. [35]P.Zimmerman,\PGPUser'sGuide",includedinPGP distribution2.6i,october994. [36]P.Zimmerman,\PGP2.6leformats",includedinPGP distribution2.6,may994. 5

CS 356 Lecture 27 Internet Security Protocols. Spring 2013

CS 356 Lecture 27 Internet Security Protocols. Spring 2013 CS 356 Lecture 27 Internet Security Protocols Spring 2013 Review Chapter 1: Basic Concepts and Terminology Chapter 2: Basic Cryptographic Tools Chapter 3 User Authentication Chapter 4 Access Control Lists

More information

CS 393 Network Security. Nasir Memon Polytechnic University Module 11 Secure Email

CS 393 Network Security. Nasir Memon Polytechnic University Module 11 Secure Email CS 393 Network Security Nasir Memon Polytechnic University Module 11 Secure Email Course Logistics HW 5 due Thursday Graded exams returned and discussed. Read Chapter 5 of text 4/2/02 Module 11 - Secure

More information

NETWORK ADMINISTRATION AND SECURITY

NETWORK ADMINISTRATION AND SECURITY NETWORK ADMINISTRATION AND SECURITY Unit I (NAS) (W- 10) Q. 1) What is Security Attack? Explain general categories of attack with examples. 7 Q. 2) List and define the five security services. 5 Q. 3) Define

More information

Outline. Computer Science 418. Digital Signatures: Observations. Digital Signatures: Definition. Definition 1 (Digital signature) Digital Signatures

Outline. Computer Science 418. Digital Signatures: Observations. Digital Signatures: Definition. Definition 1 (Digital signature) Digital Signatures Outline Computer Science 418 Digital Signatures Mike Jacobson Department of Computer Science University of Calgary Week 12 1 Digital Signatures 2 Signatures via Public Key Cryptosystems 3 Provable 4 Mike

More information

PGP - Pretty Good Privacy

PGP - Pretty Good Privacy I should be able to whisper something in your ear, even if your ear is 1000 miles away, and the government disagrees with that. -- Philip Zimmermann PGP - Pretty Good Privacy - services - message format

More information

Lab 7. Answer. Figure 1

Lab 7. Answer. Figure 1 Lab 7 1. For each of the first 8 Ethernet frames, specify the source of the frame (client or server), determine the number of SSL records that are included in the frame, and list the SSL record types that

More information

Mathematics of Internet Security. Keeping Eve The Eavesdropper Away From Your Credit Card Information

Mathematics of Internet Security. Keeping Eve The Eavesdropper Away From Your Credit Card Information The : Keeping Eve The Eavesdropper Away From Your Credit Card Information Department of Mathematics North Dakota State University 16 September 2010 Science Cafe Introduction Disclaimer: is not an internet

More information

First Semester Examinations 2011/12 INTERNET PRINCIPLES

First Semester Examinations 2011/12 INTERNET PRINCIPLES PAPER CODE NO. EXAMINER : Martin Gairing COMP211 DEPARTMENT : Computer Science Tel. No. 0151 795 4264 First Semester Examinations 2011/12 INTERNET PRINCIPLES TIME ALLOWED : Two Hours INSTRUCTIONS TO CANDIDATES

More information

Network Security. HIT Shimrit Tzur-David

Network Security. HIT Shimrit Tzur-David Network Security HIT Shimrit Tzur-David 1 Goals: 2 Network Security Understand principles of network security: cryptography and its many uses beyond confidentiality authentication message integrity key

More information

Discrete logarithms within computer and network security Prof Bill Buchanan, Edinburgh Napier

Discrete logarithms within computer and network security Prof Bill Buchanan, Edinburgh Napier Discrete logarithms within computer and network security Prof Bill Buchanan, Edinburgh Napier http://asecuritysite.com @billatnapier Introduction. Encryption: Public/Private Key. Key Exchange. Authentication.

More information

Network Security (2) CPSC 441 Department of Computer Science University of Calgary

Network Security (2) CPSC 441 Department of Computer Science University of Calgary Network Security (2) CPSC 441 Department of Computer Science University of Calgary 1 Friends and enemies: Alice, Bob, Trudy well-known in network security world Bob, Alice (lovers!) want to communicate

More information

Network Security. Abusayeed Saifullah. CS 5600 Computer Networks. These slides are adapted from Kurose and Ross 8-1

Network Security. Abusayeed Saifullah. CS 5600 Computer Networks. These slides are adapted from Kurose and Ross 8-1 Network Security Abusayeed Saifullah CS 5600 Computer Networks These slides are adapted from Kurose and Ross 8-1 Public Key Cryptography symmetric key crypto v requires sender, receiver know shared secret

More information

Chapter 8 Security. IC322 Fall 2014. Computer Networking: A Top Down Approach. 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012

Chapter 8 Security. IC322 Fall 2014. Computer Networking: A Top Down Approach. 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 Chapter 8 Security IC322 Fall 2014 Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 All material copyright 1996-2012 J.F Kurose and K.W. Ross, All

More information

Cryptography and Security

Cryptography and Security Cunsheng DING Version 3 Lecture 17: Electronic Mail Security Outline of this Lecture 1. Email security issues. 2. Detailed introduction of PGP. Page 1 Version 3 About Electronic Mail 1. In virtually all

More information

User Guide. Description of method for setting up secure communication with CDS using Outlook Express

User Guide. Description of method for setting up secure communication with CDS using Outlook Express User Guide Description of method for setting up secure communication with CDS using Outlook Express Version: C 23.10.2007 CDS D4_Instalace_OutlookExpressSettings_Eng.doc Page 1 / 11 CONTENTS 1 Introduction

More information

Cryptography and Network Security

Cryptography and Network Security Cryptography and Network Security Spring 2012 http://users.abo.fi/ipetre/crypto/ Lecture 11: Email security: PGP and S/MIME Ion Petre Department of IT, Åbo Akademi University February 14, 2012 1 Email

More information

Lightweight Security using Identity-Based Encryption Guido Appenzeller

Lightweight Security using Identity-Based Encryption Guido Appenzeller Lightweight Security using Identity-Based Encryption Guido Appenzeller Chief Technology Officer Voltage Security Inc. Identity-Based Encryption (IBE) IBE is a new public key encryption algorithm A number

More information

Chapter 10. Network Security

Chapter 10. Network Security Chapter 10 Network Security 10.1. Chapter 10: Outline 10.1 INTRODUCTION 10.2 CONFIDENTIALITY 10.3 OTHER ASPECTS OF SECURITY 10.4 INTERNET SECURITY 10.5 FIREWALLS 10.2 Chapter 10: Objective We introduce

More information

Communication Security for Applications

Communication Security for Applications Communication Security for Applications Antonio Carzaniga Faculty of Informatics University of Lugano March 10, 2008 c 2008 Antonio Carzaniga 1 Intro to distributed computing: -server computing Transport-layer

More information

Network Security. Omer Rana

Network Security. Omer Rana Network Security Omer Rana CM0255 Material from: Cryptography Components Sender Receiver Plaintext Encryption Ciphertext Decryption Plaintext Encryption algorithm: Plaintext Ciphertext Cipher: encryption

More information

Practice Questions. CS161 Computer Security, Fall 2008

Practice Questions. CS161 Computer Security, Fall 2008 Practice Questions CS161 Computer Security, Fall 2008 Name Email address Score % / 100 % Please do not forget to fill up your name, email in the box in the midterm exam you can skip this here. These practice

More information

Network Security. Security. Security Services. Crytographic algorithms. privacy authenticity Message integrity. Public key (RSA) Message digest (MD5)

Network Security. Security. Security Services. Crytographic algorithms. privacy authenticity Message integrity. Public key (RSA) Message digest (MD5) Network Security Security Crytographic algorithms Security Services Secret key (DES) Public key (RSA) Message digest (MD5) privacy authenticity Message integrity Secret Key Encryption Plain text Plain

More information

Principles of Public Key Cryptography. Applications of Public Key Cryptography. Security in Public Key Algorithms

Principles of Public Key Cryptography. Applications of Public Key Cryptography. Security in Public Key Algorithms Principles of Public Key Cryptography Chapter : Security Techniques Background Secret Key Cryptography Public Key Cryptography Hash Functions Authentication Chapter : Security on Network and Transport

More information

Introduction to Cryptography

Introduction to Cryptography Introduction to Cryptography Part 3: real world applications Jean-Sébastien Coron January 2007 Public-key encryption BOB ALICE Insecure M E C C D channel M Alice s public-key Alice s private-key Authentication

More information

Network Security [2] Plain text Encryption algorithm Public and private key pair Cipher text Decryption algorithm. See next slide

Network Security [2] Plain text Encryption algorithm Public and private key pair Cipher text Decryption algorithm. See next slide Network Security [2] Public Key Encryption Also used in message authentication & key distribution Based on mathematical algorithms, not only on operations over bit patterns (as conventional) => much overhead

More information

Network Security - Secure upper layer protocols - Background. Email Security. Question from last lecture: What s a birthday attack? Dr.

Network Security - Secure upper layer protocols - Background. Email Security. Question from last lecture: What s a birthday attack? Dr. Network Security - Secure upper layer protocols - Dr. John Keeney 3BA33 Question from last lecture: What s a birthday attack? might think a m-bit hash is secure but by Birthday Paradox is not the chance

More information

3.2: Transport Layer: SSL/TLS Secure Socket Layer (SSL) Transport Layer Security (TLS) Protocol

3.2: Transport Layer: SSL/TLS Secure Socket Layer (SSL) Transport Layer Security (TLS) Protocol Chapter 2: Security Techniques Background Chapter 3: Security on Network and Transport Layer Network Layer: IPSec Transport Layer: SSL/TLS Chapter 4: Security on the Application Layer Chapter 5: Security

More information

Secure Socket Layer (SSL) and Trnasport Layer Security (TLS)

Secure Socket Layer (SSL) and Trnasport Layer Security (TLS) Secure Socket Layer (SSL) and Trnasport Layer Security (TLS) CSE598K/CSE545 - Advanced Network Security Prof. McDaniel - Spring 2008 1 SSL/TLS The Secure Socket Layer (SSL) and Transport Layer Security

More information

Cryptography and Network Security Chapter 15

Cryptography and Network Security Chapter 15 Cryptography and Network Security Chapter 15 Fourth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 15 Electronic Mail Security Despite the refusal of VADM Poindexter and LtCol North

More information

Forging Digital Signatures

Forging Digital Signatures Forging Digital Signatures Albert Levi Sabanci University Istanbul, TURKEY levi@sabanciuniv.edu ACSAC 2002 Outline What s a digital signature? How S/MIME handles digital signatures? How to obtain a certificate

More information

Announcement. Final exam: Wed, June 9, 9:30-11:18 Scope: materials after RSA (but you need to know RSA) Open books, open notes. Calculators allowed.

Announcement. Final exam: Wed, June 9, 9:30-11:18 Scope: materials after RSA (but you need to know RSA) Open books, open notes. Calculators allowed. Announcement Final exam: Wed, June 9, 9:30-11:18 Scope: materials after RSA (but you need to know RSA) Open books, open notes. Calculators allowed. 1 We have learned Symmetric encryption: DES, 3DES, AES,

More information

Network Security. Computer Networking Lecture 08. March 19, 2012. HKU SPACE Community College. HKU SPACE CC CN Lecture 08 1/23

Network Security. Computer Networking Lecture 08. March 19, 2012. HKU SPACE Community College. HKU SPACE CC CN Lecture 08 1/23 Network Security Computer Networking Lecture 08 HKU SPACE Community College March 19, 2012 HKU SPACE CC CN Lecture 08 1/23 Outline Introduction Cryptography Algorithms Secret Key Algorithm Message Digest

More information

ECE 428 Network Security

ECE 428 Network Security ECE 428 Network Security 1 Learning objectives Security requirements and tools Symmetric-key (secret key) cryptography Substitution, transposition, and product ciphers (DES) Public key cryptography: RSA

More information

Security. Contents. S-72.3240 Wireless Personal, Local, Metropolitan, and Wide Area Networks 1

Security. Contents. S-72.3240 Wireless Personal, Local, Metropolitan, and Wide Area Networks 1 Contents Security requirements Public key cryptography Key agreement/transport schemes Man-in-the-middle attack vulnerability Encryption. digital signature, hash, certification Complete security solutions

More information

Chapter 8. Network Security

Chapter 8. Network Security Chapter 8 Network Security Cryptography Introduction to Cryptography Substitution Ciphers Transposition Ciphers One-Time Pads Two Fundamental Cryptographic Principles Need for Security Some people who

More information

Protocol Rollback and Network Security

Protocol Rollback and Network Security CSE 484 / CSE M 584 (Spring 2012) Protocol Rollback and Network Security Tadayoshi Kohno Thanks to Dan Boneh, Dieter Gollmann, Dan Halperin, John Manferdelli, John Mitchell, Vitaly Shmatikov, Bennet Yee,

More information

Electronic Mail Security. Email Security. email is one of the most widely used and regarded network services currently message contents are not secure

Electronic Mail Security. Email Security. email is one of the most widely used and regarded network services currently message contents are not secure Electronic Mail Security CSCI 454/554 Email Security email is one of the most widely used and regarded network services currently message contents are not secure may be inspected either in transit or by

More information

Introduction to Computer Security

Introduction to Computer Security Introduction to Computer Security Hash Functions and Digital Signatures Pavel Laskov Wilhelm Schickard Institute for Computer Science Integrity objective in a wide sense Reliability Transmission errors

More information

CSci 530 Midterm Exam. Fall 2012

CSci 530 Midterm Exam. Fall 2012 CSci 530 Midterm Exam Fall 2012 Instructions: Show all work. No electronic devices are allowed. This exam is open book, open notes. You have 100 minutes to complete the exam. Please prepare your answers

More information

NETWORK SECURITY. Farooq Ashraf. Department of Computer Engineering King Fahd University of Petroleum and Minerals Dhahran 31261, Saudi Arabia

NETWORK SECURITY. Farooq Ashraf. Department of Computer Engineering King Fahd University of Petroleum and Minerals Dhahran 31261, Saudi Arabia NETWORK SECURITY Farooq Ashraf Department of Computer Engineering King Fahd University of Petroleum and Minerals Dhahran 31261, Saudi Arabia O u t l i n e o f t h e P r e s e n t a t i o n What is Security

More information

Elements of Security

Elements of Security Elements of Security Dr. Bill Young Department of Computer Sciences University of Texas at Austin Last updated: April 15, 2015 Slideset 8: 1 Some Poetry Mary had a little key (It s all she could export)

More information

IPSEC: IKE. Markus Hidell mahidell@kth.se. Based on material by Vitaly Shmatikov, Univ. of Texas, and by the previous course teachers

IPSEC: IKE. Markus Hidell mahidell@kth.se. Based on material by Vitaly Shmatikov, Univ. of Texas, and by the previous course teachers IPSEC: IKE Markus Hidell mahidell@kth.se Based on material by Vitaly Shmatikov, Univ. of Texas, and by the previous course teachers 1 Reading Kaufman, chapter 18 (and some of 16) 2 Secure Key Establishment

More information

ANALYSIS OF RSA ALGORITHM USING GPU PROGRAMMING

ANALYSIS OF RSA ALGORITHM USING GPU PROGRAMMING ANALYSIS OF RSA ALGORITHM USING GPU PROGRAMMING Sonam Mahajan 1 and Maninder Singh 2 1 Department of Computer Science Engineering, Thapar University, Patiala, India 2 Department of Computer Science Engineering,

More information

SubmitedBy: Name Reg No Email Address. Mirza Kashif Abrar 790604-T079 kasmir07 (at) student.hh.se

SubmitedBy: Name Reg No Email Address. Mirza Kashif Abrar 790604-T079 kasmir07 (at) student.hh.se SubmitedBy: Name Reg No Email Address Mirza Kashif Abrar 790604-T079 kasmir07 (at) student.hh.se Abid Hussain 780927-T039 abihus07 (at) student.hh.se Imran Ahmad Khan 770630-T053 imrakh07 (at) student.hh.se

More information

Key Management (Distribution and Certification) (1)

Key Management (Distribution and Certification) (1) Key Management (Distribution and Certification) (1) Remaining problem of the public key approach: How to ensure that the public key received is really the one of the sender? Illustration of the problem

More information

CS 348: Computer Networks. - Security; 30 th - 31 st Oct 2012. Instructor: Sridhar Iyer IIT Bombay

CS 348: Computer Networks. - Security; 30 th - 31 st Oct 2012. Instructor: Sridhar Iyer IIT Bombay CS 348: Computer Networks - Security; 30 th - 31 st Oct 2012 Instructor: Sridhar Iyer IIT Bombay Network security Security Plan (RFC 2196) Identify assets Determine threats Perform risk analysis Implement

More information

Managing and Securing Computer Networks. Guy Leduc. Chapter 3: Securing applications. Chapter goals: security in practice:

Managing and Securing Computer Networks. Guy Leduc. Chapter 3: Securing applications. Chapter goals: security in practice: Managing and Securing Computer Networks Guy Leduc Chapter 3: Securing applications Computer Networking: A Top Down Approach, 6 th edition. Jim Kurose, Keith Ross Addison-Wesley, March 2012. (section 8.5)

More information

NEMA Standards Publication PS 3 Supplement 41. Digital Imaging and Communications in Medicine (DICOM) Digital Signatures

NEMA Standards Publication PS 3 Supplement 41. Digital Imaging and Communications in Medicine (DICOM) Digital Signatures NEMA Standards Publication PS 3 Supplement 1 Digital Imaging and Communications in Medicine (DICOM) Digital Signatures Status: Final Text Sep 001 Prepared by DICOM Standards Committee, Working Group 1

More information

, ) I Transport Layer Security

, ) I Transport Layer Security Secure Sockets Layer (SSL, ) I Transport Layer Security _ + (TLS) Network Security Products S31213 UNCLASSIFIED Location of SSL -L Protocols TCP Ethernet IP SSL Header Encrypted SSL data= HTTP " Independent

More information

EDA385 Embedded Systems Design. Advanced Course

EDA385 Embedded Systems Design. Advanced Course EDA385 Embedded Systems Design. Advanced Course Encryption for Embedded Systems Supervised by Flavius Gruian Submitted by Ahmed Mohammed Youssef (aso10ayo) Mohammed Shaaban Ibraheem Ali (aso10mib) Orges

More information

Cryptosystems. Bob wants to send a message M to Alice. Symmetric ciphers: Bob and Alice both share a secret key, K.

Cryptosystems. Bob wants to send a message M to Alice. Symmetric ciphers: Bob and Alice both share a secret key, K. Cryptosystems Bob wants to send a message M to Alice. Symmetric ciphers: Bob and Alice both share a secret key, K. C= E(M, K), Bob sends C Alice receives C, M=D(C,K) Use the same key to decrypt. Public

More information

4.1 SSL: Secure Socket Layer

4.1 SSL: Secure Socket Layer 4.1 SSL: Secure Socket Layer The following is a dramatization. Alice is hunched over her computer, browsing the Internet. Her wedding is in a week, and she is still looking for a wedding dress. She has

More information

Adobe Digital Signatures in Adobe Acrobat X Pro

Adobe Digital Signatures in Adobe Acrobat X Pro Adobe Digital Signatures in Adobe Acrobat X Pro Setting up a digital signature with Adobe Acrobat X Pro: 1. Open the PDF file you wish to sign digitally. 2. Click on the Tools menu in the upper right corner.

More information

Internet Packets. Forwarding Datagrams

Internet Packets. Forwarding Datagrams Internet Packets Packets at the network layer level are called datagrams They are encapsulated in frames for delivery across physical networks Frames are packets at the data link layer Datagrams are formed

More information

How to use Certificate in Outlook Express

How to use Certificate in Outlook Express How to use Certificate in Outlook Express Macau Post esigntrust Version. 2006-01.01p Agenda Configure Outlook Express for using esigntrust Certificate Use certificate to sign email Use Outlook Express

More information

Key Management. CSC 490 Special Topics Computer and Network Security. Dr. Xiao Qin. Auburn University http://www.eng.auburn.edu/~xqin xqin@auburn.

Key Management. CSC 490 Special Topics Computer and Network Security. Dr. Xiao Qin. Auburn University http://www.eng.auburn.edu/~xqin xqin@auburn. CSC 490 Special Topics Computer and Network Security Key Management Dr. Xiao Qin Auburn University http://www.eng.auburn.edu/~xqin xqin@auburn.edu Slide 09-1 Overview Key exchange Session vs. interchange

More information

Outline. CSc 466/566. Computer Security. 8 : Cryptography Digital Signatures. Digital Signatures. Digital Signatures... Christian Collberg

Outline. CSc 466/566. Computer Security. 8 : Cryptography Digital Signatures. Digital Signatures. Digital Signatures... Christian Collberg Outline CSc 466/566 Computer Security 8 : Cryptography Digital Signatures Version: 2012/02/27 16:07:05 Department of Computer Science University of Arizona collberg@gmail.com Copyright c 2012 Christian

More information

Chapter 7: Network security

Chapter 7: Network security Chapter 7: Network security Foundations: what is security? cryptography authentication message integrity key distribution and certification Security in practice: application layer: secure e-mail transport

More information

Multimedia Networking and Network Security

Multimedia Networking and Network Security CMPT371 12-1 Multimedia Networking and Network Security 1 Multimedia Networking and Network Security This note is based on Chapters 7 and 8 of the text book. Outline of multimedia networking Multimedia

More information

Cryptographic hash functions and MACs Solved Exercises for Cryptographic Hash Functions and MACs

Cryptographic hash functions and MACs Solved Exercises for Cryptographic Hash Functions and MACs Cryptographic hash functions and MACs Solved Exercises for Cryptographic Hash Functions and MACs Enes Pasalic University of Primorska Koper, 2014 Contents 1 Preface 3 2 Problems 4 2 1 Preface This is a

More information

Chapter 8. Cryptography Symmetric-Key Algorithms. Digital Signatures Management of Public Keys Communication Security Authentication Protocols

Chapter 8. Cryptography Symmetric-Key Algorithms. Digital Signatures Management of Public Keys Communication Security Authentication Protocols Network Security Chapter 8 Cryptography Symmetric-Key Algorithms Public-Key Algorithms Digital Signatures Management of Public Keys Communication Security Authentication Protocols Email Security Web Security

More information

SECURITY IN NETWORKS

SECURITY IN NETWORKS SECURITY IN NETWORKS GOALS Understand principles of network security: Cryptography and its many uses beyond confidentiality Authentication Message integrity Security in practice: Security in application,

More information

Final Exam. IT 4823 Information Security Administration. Rescheduling Final Exams. Kerberos. Idea. Ticket

Final Exam. IT 4823 Information Security Administration. Rescheduling Final Exams. Kerberos. Idea. Ticket IT 4823 Information Security Administration Public Key Encryption Revisited April 5 Notice: This session is being recorded. Lecture slides prepared by Dr Lawrie Brown for Computer Security: Principles

More information

Chapter 6 CDMA/802.11i

Chapter 6 CDMA/802.11i Chapter 6 CDMA/802.11i IC322 Fall 2014 Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 Some material copyright 1996-2012 J.F Kurose and K.W. Ross,

More information

Authentication Applications

Authentication Applications Authentication Applications CSCI 454/554 Authentication Applications will consider authentication functions developed to support application-level authentication & digital signatures Kerberos a symmetric-key

More information

Designing Hash functions. Reviewing... Message Authentication Codes. and message authentication codes. We have seen how to authenticate messages:

Designing Hash functions. Reviewing... Message Authentication Codes. and message authentication codes. We have seen how to authenticate messages: Designing Hash functions and message authentication codes Reviewing... We have seen how to authenticate messages: Using symmetric encryption, in an heuristic fashion Using public-key encryption in interactive

More information

Cryptography and Network Security

Cryptography and Network Security Cryptography and Network Security Spring 2012 http://users.abo.fi/ipetre/crypto/ Lecture 9: Authentication protocols, digital signatures Ion Petre Department of IT, Åbo Akademi University 1 Overview of

More information

Network Security Essentials Chapter 5

Network Security Essentials Chapter 5 Network Security Essentials Chapter 5 Fourth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 5 Transport-Level Security Use your mentality Wake up to reality From the song, "I've Got

More information

Communication Systems SSL

Communication Systems SSL Communication Systems SSL Computer Science Organization I. Data and voice communication in IP networks II. Security issues in networking III. Digital telephony networks and voice over IP 2 Network Security

More information

Overview Keys. Overview

Overview Keys. Overview Overview Keys Overview The PGPmail program performs fast, high-security, public-key encrypting (with optional compression), decrypting, and authenticating of electronic messages and files. The program

More information

1 Step 1: Select... Files to Encrypt 2 Step 2: Confirm... Name of Archive 3 Step 3: Define... Pass Phrase

1 Step 1: Select... Files to Encrypt 2 Step 2: Confirm... Name of Archive 3 Step 3: Define... Pass Phrase Contents I Table of Contents Foreword 0 Part I Introduction 2 1 What is?... 2 Part II Encrypting Files 1,2,3 2 1 Step 1: Select... Files to Encrypt 2 2 Step 2: Confirm... Name of Archive 3 3 Step 3: Define...

More information

Properties of Secure Network Communication

Properties of Secure Network Communication Properties of Secure Network Communication Secrecy: Only the sender and intended receiver should be able to understand the contents of the transmitted message. Because eavesdroppers may intercept the message,

More information

Netzwerksicherheit: Anwendungen

Netzwerksicherheit: Anwendungen Internet-Technologien (CS262) Netzwerksicherheit: Anwendungen 22. Mai 2015 Christian Tschudin & Thomas Meyer Departement Mathematik und Informatik, Universität Basel Chapter 8 Security in Computer Networks

More information

Network Security Essentials Chapter 7

Network Security Essentials Chapter 7 Network Security Essentials Chapter 7 Fourth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 7 Electronic Mail Security Despite the refusal of VADM Poindexter and LtCol North to appear,

More information

Standards and Products. Computer Security. Kerberos. Kerberos

Standards and Products. Computer Security. Kerberos. Kerberos 3 4 Standards and Products Computer Security Standards and Products Public Key Infrastructure (PKI) IPsec SSL/TLS Electronic Mail Security: PEM, S/MIME, and PGP March 24, 2004 2004, Bryan J. Higgs 1 2

More information

FL EDI SECURE FTP CONNECTIVITY TROUBLESHOOTING GUIDE. SFTP (Secure File Transfer Protocol)

FL EDI SECURE FTP CONNECTIVITY TROUBLESHOOTING GUIDE. SFTP (Secure File Transfer Protocol) FL EDI SECURE FTP CONNECTIVITY TROUBLESHOOTING GUIDE This troubleshooting guide covers secure file transfers using the SFTP file transfer protocols for Claims, POC, and Medical EDI transmissions. SFTP

More information

Ciphire Mail Email Encryption and Authentication

Ciphire Mail Email Encryption and Authentication Ciphire Mail Email Encryption and Authentication Lars Eilebrecht Ciphire Labs le@ciphirelabs.com Abstract. Ciphire Mail is cryptographic software that provides email encryption and digital signatures.

More information

CSC 774 -- Network Security

CSC 774 -- Network Security CSC 774 -- Network Security Topic 6: Transport Layer Security Dr. Peng Ning CSC 774 Network Security 1 Transport Layer Security Protocols Secure Socket Layer (SSL) Originally developed to secure http Version

More information

Security Sensor Network. Biswajit panja

Security Sensor Network. Biswajit panja Security Sensor Network Biswajit panja 1 Topics Security Issues in Wired Network Security Issues in Wireless Network Security Issues in Sensor Network 2 Security Issues in Wired Network 3 Security Attacks

More information

Authentication applications Kerberos X.509 Authentication services E mail security IP security Web security

Authentication applications Kerberos X.509 Authentication services E mail security IP security Web security UNIT 4 SECURITY PRACTICE Authentication applications Kerberos X.509 Authentication services E mail security IP security Web security Slides Courtesy of William Stallings, Cryptography & Network Security,

More information

Computer Security: Principles and Practice

Computer Security: Principles and Practice Computer Security: Principles and Practice Chapter 20 Public-Key Cryptography and Message Authentication First Edition by William Stallings and Lawrie Brown Lecture slides by Lawrie Brown Public-Key Cryptography

More information

Three attacks in SSL protocol and their solutions

Three attacks in SSL protocol and their solutions Three attacks in SSL protocol and their solutions Hong lei Zhang Department of Computer Science The University of Auckland zhon003@ec.auckland.ac.nz Abstract Secure Socket Layer (SSL) and Transport Layer

More information

CSC 474 Information Systems Security

CSC 474 Information Systems Security CSC 474 Information Systems Security Topic 4.5 Transport Layer Security CSC 474 Dr. Peng Ning 1 Transport Layer Security Protocols Secure Socket Layer (SSL) Originally developed to secure http Version

More information

Web Security. Mahalingam Ramkumar

Web Security. Mahalingam Ramkumar Web Security Mahalingam Ramkumar Issues Phishing Spreading misinformation Cookies! Authentication Domain name DNS Security Transport layer security Dynamic HTML Java applets, ActiveX, JavaScript Exploiting

More information

Network Security Part II: Standards

Network Security Part II: Standards Network Security Part II: Standards Raj Jain Washington University Saint Louis, MO 63131 Jain@cse.wustl.edu These slides are available on-line at: http://www.cse.wustl.edu/~jain/cse473-05/ 18-1 Overview

More information

Network Security Technology Network Management

Network Security Technology Network Management COMPUTER NETWORKS Network Security Technology Network Management Source Encryption E(K,P) Decryption D(K,C) Destination The author of these slides is Dr. Mark Pullen of George Mason University. Permission

More information

18-731 Midterm. Name: Andrew user id:

18-731 Midterm. Name: Andrew user id: 18-731 Midterm 6 March 2008 Name: Andrew user id: Scores: Problem 0 (10 points): Problem 1 (10 points): Problem 2 (15 points): Problem 3 (10 points): Problem 4 (20 points): Problem 5 (10 points): Problem

More information

CSCE 465 Computer & Network Security

CSCE 465 Computer & Network Security CSCE 465 Computer & Network Security Instructor: Dr. Guofei Gu http://courses.cse.tamu.edu/guofei/csce465/ Public Key Cryptogrophy 1 Roadmap Introduction RSA Diffie-Hellman Key Exchange Public key and

More information

Communication Systems 16 th lecture. Chair of Communication Systems Department of Applied Sciences University of Freiburg 2009

Communication Systems 16 th lecture. Chair of Communication Systems Department of Applied Sciences University of Freiburg 2009 16 th lecture Chair of Communication Systems Department of Applied Sciences University of Freiburg 2009 1 25 Organization Welcome to the New Year! Reminder: Structure of Communication Systems lectures

More information

The Secure Sockets Layer (SSL)

The Secure Sockets Layer (SSL) Due to the fact that nearly all businesses have websites (as well as government agencies and individuals) a large enthusiasm exists for setting up facilities on the Web for electronic commerce. Of course

More information

Chapter 6 Electronic Mail Security

Chapter 6 Electronic Mail Security Cryptography and Network Security Chapter 6 Electronic Mail Security Lectured by Nguyễn Đức Thái Outline Pretty Good Privacy S/MIME 2 Electronic Mail Security In virtually all distributed environments,

More information

Email, SNMP, Securing the Web: SSL

Email, SNMP, Securing the Web: SSL Email, SNMP, Securing the Web: SSL 4 January 2015 Lecture 12 4 Jan 2015 SE 428: Advanced Computer Networks 1 Topics for Today Email (SMTP, POP) Network Management (SNMP) ASN.1 Secure Sockets Layer 4 Jan

More information

Secure Sockets Layer (SSL ) / Transport Layer Security (TLS) Network Security Products S31213

Secure Sockets Layer (SSL ) / Transport Layer Security (TLS) Network Security Products S31213 Secure Sockets Layer (SSL ) / Transport Layer Security (TLS) Network Security Products S31213 UNCLASSIFIED Example http ://www. greatstuf f. com Wants credit card number ^ Look at lock on browser Use https

More information

19531 - Telematics. 13th Tutorial - Application Layer Protocols

19531 - Telematics. 13th Tutorial - Application Layer Protocols 19531 - Telematics 13th Tutorial - Application Layer Protocols Bastian Blywis Department of Mathematics and Computer Science Institute of Computer Science 03. February, 2011 Institute of Computer Science

More information

Overview Windows NT 4.0 Security Cryptography SSL CryptoAPI SSPI, Certificate Server, Authenticode Firewall & Proxy Server IIS Security IE Security

Overview Windows NT 4.0 Security Cryptography SSL CryptoAPI SSPI, Certificate Server, Authenticode Firewall & Proxy Server IIS Security IE Security Overview Windows NT 4.0 Security Cryptography SSL CryptoAPI SSPI, Certificate Server, Authenticode Firewall & Proxy Server IIS Security IE Security Ch 7 - Security 1 Confidentiality and privacy: Protect

More information

RSA Attacks. By Abdulaziz Alrasheed and Fatima

RSA Attacks. By Abdulaziz Alrasheed and Fatima RSA Attacks By Abdulaziz Alrasheed and Fatima 1 Introduction Invented by Ron Rivest, Adi Shamir, and Len Adleman [1], the RSA cryptosystem was first revealed in the August 1977 issue of Scientific American.

More information

CRYPTOGRAPHY IN NETWORK SECURITY

CRYPTOGRAPHY IN NETWORK SECURITY ELE548 Research Essays CRYPTOGRAPHY IN NETWORK SECURITY AUTHOR: SHENGLI LI INSTRUCTOR: DR. JIEN-CHUNG LO Date: March 5, 1999 Computer network brings lots of great benefits and convenience to us. We can

More information

Chapter 7 Transport-Level Security

Chapter 7 Transport-Level Security Cryptography and Network Security Chapter 7 Transport-Level Security Lectured by Nguyễn Đức Thái Outline Web Security Issues Security Socket Layer (SSL) Transport Layer Security (TLS) HTTPS Secure Shell

More information

Client Server Registration Protocol

Client Server Registration Protocol Client Server Registration Protocol The Client-Server protocol involves these following steps: 1. Login 2. Discovery phase User (Alice or Bob) has K s Server (S) has hash[pw A ].The passwords hashes are

More information

Network Security Protocols

Network Security Protocols Network Security Protocols EE657 Parallel Processing Fall 2000 Peachawat Peachavanish Level of Implementation Internet Layer Security Ex. IP Security Protocol (IPSEC) Host-to-Host Basis, No Packets Discrimination

More information