AT Cyber Security
AT Cyber Security CS 6393
Popular in Course
Popular in ComputerScienence
verified elite notetaker
This 13 page Class Notes was uploaded by Mireya Heidenreich on Thursday October 29, 2015. The Class Notes belongs to CS 6393 at University of Texas at San Antonio taught by Shouhuai Xu in Fall. Since its upload, it has received 8 views. For similar materials see /class/231385/cs-6393-university-of-texas-at-san-antonio in ComputerScienence at University of Texas at San Antonio.
Reviews for AT Cyber Security
Report this Material
What is Karma?
Karma is the currency of StudySoup.
You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!
Date Created: 10/29/15
S ra re Machine Replica rion The Problem Clienfs Server Solu on replicnfe server The Solu rion 1 Make server dererminisrir shlfe machine 0 Rd svace mncMne The Solu rion 1 Make server dererminisrir shlfe machine 2 Replirare server 0 K we mncmne lt2 O The Solu rlon 1 Make server dererminisric srare machine 2 Replicare server 3 Ensure correcr replicas srep fhrough rhe same sequence of share frnnsifions emi 4 i v The Solu rlon 1 Make server deferminisfic srare machine 2 Replicare server 3 Ensure correcr replicas 5 ep fhrough rhe same sequence of share frnnsifions 4 Vote on replica oufpufs For Faulf folemnce wems i O f O i i O The Solu rion 1 Make server dererminisric smre machine 2 Replimre server 3 Ensure correcf replicas s sequence of shite frnnsifi ep fhrough fhe same OHS 4 Vote on replica oufpufs For Faulf folemnce cumi g K snne mncMne f i and clienf share Fafe Ahhh Java 3 o u 392 m o Seman ric Charac reriza rion of a S ra re Machine ufpufs of n sfnfe machine are complefely defermined by fhe sequence of requesfs if processes independenf 0F Hme and any ofher ncfivify in n sysfem Replica Coordinafion All nonFaulfy sfaie machines receive all requesfs in the same order 9 Agreement Every nonFauli y si39ai39e machine receives every requesf in Order Every nonFauli39y sfafe machine processes HIE requesfs if receives in HIE same or er Consensus and Reliable Broadcas1L Broadcasf IF a process sends a message m rhen every process even ruully delivers m Broadcasf If a process sends a message m rhen every process even rually delivers m Broadcas r IF a process sends a message m rhen every process even ruully delivers m How can we adap r rhe spec for an environmen r where processes can fail And wha r does fail mean A hierarchy of Failure models 0 Crash A hierarchy of Failure models Fail7slch 7 7 7 7 7 0 Crush A hierarchy of Failure models Feil7siopO7 7 7 7 7 7 Crush 52nd Omission Receive Omission A hierarchy of Failure models Fail7sich 7 7 7 7 7 Crush Send Omission Receive Omission a benign failures Seneml Omission A hierarchy of Failure models Fail7sicpogt 7 7 7 7 7 Crush Send Omission Receive Omission a benign failures Geneml Omission Arbiimny Failures wilh message nuiheniicniicn A hierarchy of Failure models FailesiopO r 7 r 7 7 Crush 52nd Omission Receive Omission D Wequot mm Geneml Omission Arbitrary Failures with message authentication Arninnry Byznn ne Failures Reliable Broadcas r Validity IF the sender is correct and broadcasts a message m then all correct processes eventually deliver m Agreement IF a correct process delivers a messagem then all correct processes eventually de iver m Integrity Every correct process delivers at most one message and if it delivers m then some process must have broadcast m Validiiy Agreemeni Iniegriiy Terminaiion Validiiy Agreemeni Iniegriiy Terminaiion T rn na ng Re able Broadcasf IF ihe sender is correci and broadcasis a message m ihen all correci processes eveniually deliver m IF a correci process delivers a messagem ihen all correci processes eveniually deliver m Every correci process delivers ai mosi one message and iF ii delivers m n some process musi have broadcasi m SFJ Every corred process evenhmlly delivers some message Consensus IF all processes ihai propose a value ro ose o ihen all corred processes eveniually decide o IF a corred process decides o ihen all correci processes eveniually decide 1 Every corred process decides ai mosi one value and iF ii decides 1 ihen some process mu proposed 1 Every corred process eveniually decides some value Proper ries of sendm and receivem Benign Failures Validiiy IF 10 sends mio q andp q ihe link beiween ihem are correcl eveniually receives m uniFonn Inlegrily For any messagem q receives mai mosi once Fromp and only M y and hen q 52m m lo q A properly is uniForm iF ii applies lo boll correcl and Faulty processes Proper ries of sendm and receivem Arbifrary Failures Inlegrily For any message39m iF p are correcl lhen q receives m al mo From 10 and only ifp 52m mlo q and q sl once
Are you sure you want to buy this material for
You're already Subscribed!
Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'