DOC PREVIEW
UMBC CMSC 691 - LECTURE NOTES

This preview shows page 1-2-24-25 out of 25 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 25 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 25 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 25 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 25 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 25 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Transaction Fusion in the Wake of Information WarfareOverviewNew and SignificantWhat is Information Warfare?Defensive Information WarfareDatabase Information AttackPrevious WorkTraditional Recovery TechniquesTransaction Fusion ModelTypes of TransactionDefinitions (I)Definitions (II)ExampleModel Description (I)Model Description (II)Recovery Procedure (I)Recovery Procedure (II)Recovery Procedure (II)- AlgorithmRecovery Procedure (III)ConclusionFuture WorkReferencesThanks a lot …Slide 24HomeworkSweety Chauhan12 October 2005Proceedings of the 2001 ACM symposium on Applied computing Brajendra Panda, Rajesh Yalamanchili, March 2001Security and Error Correction/Detection in 802.1x and GSMTransaction Fusion in the Wake of Information WarfareSweety ChauhanOctober 19, 2005CMSC 691IBrajendra Panda, Rajesh Yalamanchili Computer Science Department, University of North Dakota Proceedings of the 2001 ACM symposium on Applied Computing March 2001 Information WarfareCMSC 691I 2Information WarfareOverviewNew and SignificantDefensive Information WarfarePrevious WorkTransaction Fusion ModelRecovery AlgorithmConclusionFuture workCMSC 691I 3Information WarfareNew and SignificantThe existing recovery techniques first undo all malicious and affected transactions and  then redo all affected transactionsNew a model to fuse groups of malicious and affected transactionsSignificant by combining transactions, several data items that were required to be accessed multiple times in each individual transaction are now accessed only once in a fused transaction. Acceleration of recovery processCMSC 691I 4Information WarfareWhat is Information Warfare?Any electronic attack intended to disrupt a computer system is termed as “Information Warfare”Defensive information warfare - safeguarding systems from malicious attacksDatabases form the prime target for many of the malicious activities carried out by intrudersCMSC 691I 5Information WarfareDefensive Information WarfareA functional paradigm of defensive information warfare1. ProtectTechniques designed to guard hardware, software and user dataagainst threats from both outsiders as well as from malicious insiders2. Detect1. critical to the survival of information systems2. can be achieved by gaining an accurate understanding of the “state” of the system at any given point in time e.g. Intrusion Detection Systems3. React1. assessing damage2. finding malicious hidden programs3. locating and closing any back doors left by an attacker for future reentry4. recovering dataCMSC 691I 6Information WarfareDatabase Information AttackIn the protect phase, an attempt is made to prevent an attack on the database.Absolute prevention can never be achieved and hence there is a detect phase. intrusion detection mechanisms to identify attacksOnce an attack is detected, react phase makes every effort to completely wipe out the effect of malicious transaction andrestore the database to a consistent state, the state database would have reached if there was no malicious transactionmust be performed in the shortest time possibleCMSC 691I 7Information WarfarePrevious WorkThe damage inflicted on a database can spread manifold within a short timewhen the transactions are interdependant and there is lot of activity in the systemTraditional recovery techniques, which deal with media and system failures, are not efficient in dealing with malicious attacksrollback the database to the point of attackall transactions except for the malicious transaction(s) are then redone to bring the database to a consistent stateHighly time-consuming process which is UNACCEPTABLE!!!CMSC 691I 8Information WarfareTraditional Recovery TechniquesTransaction dependency approachmalicious transaction(s) and the transactions that depend on the malicious transaction(s) are considered for recovery purposes.Data dependency approachdata items that are affected by the malicious transaction(s) and their dependant data items are restored to their correct values.log has to be scanned from the point of attack to the end => time consuming processCMSC 691I 9Information WarfareTransaction Fusion ModelAssumptions:The schedule produced by the scheduler is strictly serializableBlind writes are not allowedThe entire schedule is logged and the log cannot be modified or purged by any userTransaction dependency approachfuses a group of transactions into a single transactionFast and efficient recoveryaccelerating the redo and undo phasesCMSC 691I 10Information WarfareTypes of TransactionMalicious TransactionAuthentic TransactionSet Notationsmalicious transactions (M),authentic transactions (A),affected transactions (F), and unaffected transactions (U)A schedule is a collection of transactions that are interleaved and there exists a partial ordering among the operations of these transactionsCMSC 691I 11Information WarfareDefinitions (I)A transaction Tj is said to be dependant upon another transaction Ti,if there exists a data item x such that Ti is the last committed transaction to update x before Tj reads x. dependency relationship is denoted by Ti → TjFor any two schedules of transactions Si and Sj, combined schedule where Si and Sj do not have any transaction in common the combined effect of executing schedule Si followed by SjSj is a sub-schedule of Si (Sj ⊂s Si ) ifSj contains all the transactions that are present in Sithe order among these transactions is same(Si Sj)CMSC 691I 12Information WarfareDefinitions (II)If Sj ⊂s Si then the effect of executing Si and undoing all the transactions belonging to Sj is represented by Si Θ SjTwo schedules are said to be value equivalents, if they produce the same final state when they start from the same initial stateCMSC 691I 13Information WarfareExampleSi : T1, T3, T5, T4, T2, T6 Sj : T1, T2, T6T4 and T5 depend on T3T6 depends on T1T2 depends on T1 and T3 Following steps are carried out for finding Si Θ Sj1. Dependency graph for original schedule (Si) is drawn first2. The last transaction in Si (T6) is undone only if it is a leaf node3. Node representing the transaction undone is deleted and the process is repeated.Si Θ Sj: T3, T5, T4T2T3T1T4T5T6Dependency GraphCMSC 691I 14Information WarfareModel Description (I)When an attack by one or more malicious


View Full Document

UMBC CMSC 691 - LECTURE NOTES

Documents in this Course
NOTES

NOTES

8 pages

OWL

OWL

109 pages

Security

Security

53 pages

SIP

SIP

45 pages

Proposals

Proposals

30 pages

Proposals

Proposals

30 pages

Load more
Download LECTURE NOTES
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view LECTURE NOTES and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view LECTURE NOTES 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?