Byzan&ne(Resilient.Rou&ng.and.Key. Management.Protocols.using.Network.Coding. Cris&na.Nita(Rotaru.. . Department.of.Computer.Science.and.CERIAS. Purdue.University.
Acknowldegment. This.work.was.funded.by. NSF,% Secure.Networking.Using.Network.Coding. % Relevant.publica&ons. ! Node%Capture,Resilient,Key,Establishment,in,Sensor,Networks:,Design, Space,and,Protocols. .Andrew.Newell,.Hongyi.Yao,.Alex.Ryker,.Tracey.Ho,. and.Cris&na.Nita(Rotaru..ACM.Compu&ng.Surveys,.Jan..2015 .. ! On,the,PracBcality,of,Cryptographic,Defenses,against,PolluBon,AEacks,in, Wireless,Network,Coding. .Andrew.Newell,.Jing.Dong,.and.Cris&na.Nita( Rotaru..In.ACM.Compu&ng.Surveys,.June.2013.. ! PolluBon,AEacks,and,Defense,in,Inter%flow,Network,Coding,Systems. .Jing. Dong,.Reza.Curtmola,.Cris&na.Nita(Rotaru,.and.David.Yau..In.IEEE. Transac&ons.on.Dependable.and.Secure.Systems,.Sept..2012... ! PracBcal,Defenses,Against,PolluBon,AEacks,in,Wireless,Network,Coding. . Jing.Dong,.Reza.Curtmola,.and.Cris&na.Nita(Rotaru..In.ACM.Transac&ons. on.Systems.and.Informa&on.Security,.vol..14.no..1,.May.2011... . Cris&na.Nita(Rotaru. 2.
hUp://ds2.cs.purdue.edu. ! Overarching.goal:.. ! Create.and.build.distributed.systems.and.network.protocols. that.achieve. security ,. availability ,.and. performance .in.spite.of. misconfigura1ons ,. failures ,.and. a5acks% ! Approach:.. ! Combine.theore&cal.principles.and.experimental. methodologies.from.distributed.systems,..cryptography,. networking,.informa&on.theory,.and.machine.learning... Cris&na.Nita(Rotaru. 3.
The.Internet.of.everything.is.here.…. ! Compu&ng.services. ! Everything.is.connected. ! Many.types.of.devices.. ! Tremendous.amount.of.data. ! Available.via.cloud.compu&ng,. accessed.via.personal.devices. ! Higher.expecta&ons. ! Services.must.be.available.24h,. working.correctly.100%.of.the. Users.called.911.because. &me. Facebook.was.down.!!!.. ! Data(centric.business,.policy. decisions. Cris&na.Nita(Rotaru. 4.
What.does.it.mean.for.security. ! Large.number.of.devices.with.different.capabili&es. and.vulnerabili&es.managed.by.different.en&&es. ! Higher.chances.that.some.system.components.are.going. to.be.compromised. ! The%next%a5ack%is%going%to%come%from%your%kitchen% ! Subset.of.compu&ng.systems.or.protocol.par&cipants. controlled.by.an.adversary.can.influence. ! Communica&on.and.availability. ! Data.quality,.processing,.and.learning. Designing.systems.resilient.to.only. . outsider.aUackers.no.longer.sufficient,.. . need.for.insider(resilient.systems. Cris&na.Nita(Rotaru. 5.
Seeing.the.world.through.a.Byzan&ne.len. ! An.insider.can.not.be.trusted.to. correctly.generate.or.process. data.(i.e..lie):.. ! Trus&ng.info.limita&ons. ! Many.insider.nodes.collude. ! Not.enough.history.is.available. ! Single.source.of.informa&on. ! An.insider.can.not.be.trusted.to. correctly.deliver.data:.. ! Dissemina&ng.info.limita&ons. ! Lack.of.non(adversarial.paths... ! Not.enough.redundancy.. ! Correlated.failures. Cris&na.Nita(Rotaru. 6.
Network.coding:.A.New.paradigm.. ! Key,principle: .packet.mixing.at.intermediate.nodes. =. f (.. ...,.......,...... ) . A. A. Tradi&onal.rou&ng. Network.coding. ! Benefits :.Higher.throughput,.reliability,.robustness,.energy. efficiency. ! ApplicaBons :.wireless.unicast.and.mul&cast,.p2p.storage.and. content.distribu&on,.delay(tolerant.networks,.vehicular.networks. Cris&na.Nita(Rotaru. 7.
Network.coding.in.wireless.networks. ! Opportuni&es.. ! Broadcast.advantage.. ! Opportunis&c.listening. ! Benefits. ! Improved.throughput. ! Reduced.delay. ! Improved.reliability. p2 Cris&na.Nita(Rotaru. 8.
This.talk. ! Network.coding.under. aUack:. ! Pollu&on.aUacks.in. intra(flow.network. coding. ! Network.coding.to.the. rescue:. ! All.pairwise.and. connected.graph.key. management.resilient. to.node.capture. Cris&na.Nita(Rotaru. 9.
Wireless.network.coding.systems. ! Intra(Flow.Network.Coding. ! Mix.packets.within.individual.flows. ! Examples:.[Park;.2006],.MORE.[Chachulski;.2007],.[Zhang;. 2008a],.[Zhang;.2008b],.MIXIT.[Kap;.2008],.[Lin;.2008]. ! Inter(Flow.Network.Coding. ! Mix.packets.across.mul&ple.flows. ! Examples:.COPE.[Kap;.2006],.DCAR.[Le;.08],.[Das;.2008],. [Omiwade;.2008a],.[Omiwade;.2008b]. Cris&na.Nita(Rotaru. 10.
Intra(flow.network.coding. 1. Buffer.overheard.coded.packets. Forwarder.nodes. 2. Broadcast.new.coded.packets. 1. Divide. plain%packets .into.genera&ons. 2. Broadcast. coded%packets% A D …. G Source.node. …. S E Plain.packets. B R H …. …. Receiver.node. F C 1. Buffer.coded.packets. Generation# 2. Decode.packets. p 1 ,# p 2 ,#…# p n # 3. Send.ACK.to.source. Cris&na.Nita(Rotaru. 11.
Packet.coding.and.decoding. G ! p i = ( p i1 , p i2 , …, p im ) T , p ij ∈ F q ................................................................. p i ! G = [ p 1 , p 2 ,…, p n ] ! Coding.with.random.linear.combina&on. p ij c = ( c 1 , c 2 , …, c n ), c i ∈ F q …. …, …, …, e = c 1 p 1 + c 2 p 2 +…+ c n p n = G c ! Decoding. ! Given.n.linearly.independent.coded.packets. ( c 1 , e 1 ) … ( c n , e n ) . solve.a.system.of.linear.equa&ons. ! AUacks. ! Packet,PolluBon :.injec&ng.incorrect.packets. . Cris&na.Nita(Rotaru. 12. .
Pollu&on.aUacks. Defini&on. ! Pollu&on.aUacks.are.aUacks.where. a5ackers% inject. polluted(coded(packets( into.the.network.. ! A.coded.packet.(c,.e).is.a.polluted. coded%packet% if. c = ( c 1 , c 2 , …, c n ), c i ∈ F q but. e ≠ c 1 p 1 + c 2 p 2 +…+ c n p n ! Generic.aUack.to.any.network.coding.system. Cris&na.Nita(Rotaru. 13.
Impact.of.pollu&on.aUacks. . Forwarder.nodes. A D …. G Source.node. S B …. R E H …. …. Receiver.node. C F Generation# p 1 ,# p 2 ,#…# p n # Epidemic#attack#propagation# Cris&na.Nita(Rotaru. 14.
Prior.work. ! Cryptographic.approaches.[Krohn;.2004],.[Li;.2006],.[Charles;. 2006],.[Zhao;.2007],.[Yu;.2008],.[Boneh;.2009]. ! Homomorphic.digital.signatures.or.hash.func&ons. ! Too%expensive%computa1onally% ! Informa&on.theore&c.approaches.[Ho;.2004],.[Jaggi;.2007],. [Wang;.2007]. ! Coding.redundant.informa&on. ! Low%achievable%throughput% ! Network.error.correc&on.coding.[Yeung;.2006],.[Cai;.2006],. [Silva;.2007],.[KoeUer;.2008]. ! Using.error.correc&on.coding.techniques. ! Limited%error%correc1on%capability,%unsuitable%for%adversarial% environment% Cris&na.Nita(Rotaru. 15.
Throughput.CDF.when.no.aUack.happens. ...The.high.overhead.of.crypto(based.schemes. render.them.imprac&cal.for.wireless.networks. Cris&na.Nita(Rotaru. 16.
Our.approach. Non(cryptographic.checksum.created.by.the.source. Based.on.lightweight.random.linear.transforma&ons. Carries.the.&mestamp.of.when.it.was.created. Disseminated.by.the.source.in.an.authen&cated.manner. Not.pre(image.or.collision.resistant!. S ecurity.relies.on.&me.asymmetry. checksum.verifica&on. A.node.verifies.a.packet.against.a. checksum.that.is.created. a-er .the. packet.is.received. 17. Cris&na.Nita(Rotaru.
Our.approach:.Example. AUacker.can.not.inject.a.checksum.or.modify. &mestamp.because.checksum.is.signed.by.source. CS 1. p.received. p. CS 1 .created. by.B. &me. S t 2 t 4 A t 1 t 3 B CS 2. CS 1 .received. CS 2 .created. by.A. Packet.p.will.be.verified.against.CS 2 .and.not.CS 1 ..The. aUacker.does.not.gain.anything.by.observing.CS 1 ... Cris&na.Nita(Rotaru. 18.
DART.and.EDART. ! DART. ! Forwarder.nodes.buffer.packets.. checksum.verifica&on. ! Only.verified.packets.are.combined.to.. form.new.packets.for.forwarding. ! Polluted.packets.are.dropped.at.first.hop,. elimina&ng.epidemic.propaga&on. ! EDART. ! Improves.performance.with.op&mis&c.forwarding. Cris&na.Nita(Rotaru. 19.
Checksum.computa&on.and.verifica&on. ! A.genera&on.of.packets. G = [ p 1 , p 2 ,…, p n ] , Checksum.computa&on. ! Compute. H s .a.random. b × m matrix.from.a.seed. s ! Compute.the.checksum CHK s ( G ) = H s G ! b.is.a.system.parameter.that.trades.off.security.and.overhead. Checksum.verifica&on. Given. CHK s ( G ) ,. s and t ,.check.if.a.coded.packet. ( c , e ) .is.valid ! Check CHK s ( G ) c = H s e . ! Why?. CHK s ( G ) c = ( H s G ) c = H s ( G c ) = H s e ! No,false,posiBve,,may,have,false,negaBve, Cris&na.Nita(Rotaru. 20.
Batch.Checksum.Verifica&on. ! Verify.a.set.of.coded.packets. {( c 1 , e 1 ), …, ( c k , e k )} at once ( c 1 , e 1 ) . ( c 2 , e 2 ) . ( c k , e k ) . ( c , e ) . Declare.all.k.packets. are.valid. Random.linear. combina&on. Verify. …. …, …, …, At.least.one.input. …, packet.is.invalid. Divide.and.verify. Invalid.packets. ! For.higher.accuracy,.we.can.repeat.the.procedure. Cris&na.Nita(Rotaru. 21.
DART.Algorithm. Source.node Forwarder.node ! Disseminate.coded.packets.as.usual. ! On.sending.a.packet. ! Periodically.disseminate.a.signed.random. .Code.packets.in.verified.set. checksum. (CHK, s , t ) ! On.receiving.coded.packet.p. . .Add.p.to.unverified.set,.record.receive.&me. ! On.receiving.checksum. (CHK, s , t ) . .Verify.packets.in.unverified.set.with.receive. Unverified. Verified. &me.before. t . checksum. D G A R . B E S Receiver.node. H Source.node. C F Cris&na.Nita(Rotaru. 22.
Recommend
More recommend