Computer Science and Engineering Computer System Security CSE 5339/7339 Session 21 November 2, 2004.

Slides:



Advertisements
Similar presentations
Concurrency Control WXES 2103 Database. Content Concurrency Problems Concurrency Control Concurrency Control Approaches.
Advertisements

TRANSACTION PROCESSING SYSTEM ROHIT KHOKHER. TRANSACTION RECOVERY TRANSACTION RECOVERY TRANSACTION STATES SERIALIZABILITY CONFLICT SERIALIZABILITY VIEW.
Em Spatiotemporal Database Laboratory Pusan National University File Processing : Transaction Management 2004, Spring Pusan National University Ki-Joune.
Database Systems, 8 th Edition Concurrency Control with Time Stamping Methods Assigns global unique time stamp to each transaction Produces explicit.
ICOM 6005 – Database Management Systems Design Dr. Manuel Rodríguez-Martínez Electrical and Computer Engineering Department Lecture 16 – Intro. to Transactions.
Information Security Principles & Applications
Transaction Processing Lecture ACID 2 phase commit.
More on transactions…. Dealing with concurrency (OR: how to handle the pressure!) Locking Timestamp ordering Multiversion protocols Optimistic protocols.
Transaction Management and Concurrency Control
Database management concepts Database Management Systems (DBMS) An example of a database (relational) Database schema (e.g. relational) Data independence.
Database Systems: Design, Implementation, and Management Eighth Edition Chapter 10 Transaction Management and Concurrency Control.
Security in Databases. 2 Srini & Nandita (CSE2500)DB Security Outline review of databases reliability & integrity protection of sensitive data protection.
Transaction Processing IS698 Min Song. 2 What is a Transaction?  When an event in the real world changes the state of the enterprise, a transaction is.
Chapter 8 : Transaction Management. u Function and importance of transactions. u Properties of transactions. u Concurrency Control – Meaning of serializability.
DBMS Functions Data, Storage, Retrieval, and Update
Security in Databases. 2 Outline review of databases reliability & integrity protection of sensitive data protection against inference multi-level security.
Transaction Processing
Database Systems: Design, Implementation, and Management Eighth Edition Chapter 10 Transaction Management and Concurrency Control.
Transaction Management WXES 2103 Database. Content What is transaction Transaction properties Transaction management with SQL Transaction log DBMS Transaction.
Transaction Management and Concurrency Control
Transactions and Recovery
Academic Year 2014 Spring. MODULE CC3005NI: Advanced Database Systems “DATABASE RECOVERY” (PART – 1) Academic Year 2014 Spring.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 Transaction Management Overview Chapter 16.
Chapter 6 – Database Security  Integrity for databases: record integrity, data correctness, update integrity  Security for databases: access control,
Introduction. 
Multi-user Database Processing Architectures Architectures Transactions Transactions Security Security Administration Administration.
Database Management Systems, 2 nd Edition. R. Ramakrishnan and J. Gehrke1 Transaction Management Overview Chapter 18.
1 Transactions BUAD/American University Transactions.
Database Security And Audit. Databasics Data is stored in form of files Record : is a one related group of data (in a row) Schema : logical structure.
Sensitive Data  Data that should not be made public  What if some but not all of the elements of a DB are sensitive Inherently sensitiveInherently sensitive.
1 Database Systems CS204 Lecture 21 Transaction Processing I Asma Ahmad FAST-NU April 7, 2011.
BIS Database Systems School of Management, Business Information Systems, Assumption University A.Thanop Somprasong Chapter # 10 Transaction Management.
CS 162 Discussion Section Week 9 11/11 – 11/15. Today’s Section ●Project discussion (5 min) ●Quiz (10 min) ●Lecture Review (20 min) ●Worksheet and Discussion.
Transaction Processing Concepts. 1. Introduction To transaction Processing 1.1 Single User VS Multi User Systems One criteria to classify Database is.
Database Systems/COMP4910/Spring05/Melikyan1 Transaction Management Overview Unit 2 Chapter 16.
1 Transaction Management Overview Chapter Transactions  Concurrent execution of user programs is essential for good DBMS performance.  Because.
Ch 10: Transaction Management and Concurrent Control.
Database Security Outline.. Introduction Security requirement Reliability and Integrity Sensitive data Inference Multilevel databases Multilevel security.
Introduction to Database Systems1. 2 Basic Definitions Mini-world Some part of the real world about which data is stored in a database. Data Known facts.
Concurrency Control. Objectives Management of Databases Concurrency Control Database Recovery Database Security Database Administration.
The Relational Model1 Transaction Processing Units of Work.
Database Systems Recovery & Concurrency Lecture # 20 1 st April, 2011.
Chapter 10 Recovery System. ACID Properties  Atomicity. Either all operations of the transaction are properly reflected in the database or none are.
Chapter 20 Transaction Management Thomas Connolly, Carolyn Begg, Database System, A Practical Approach to Design Implementation and Management, 4 th Edition,
Introduction.  Administration  Simple DBMS  CMPT 454 Topics John Edgar2.
Section 06 (a)RDBMS (a) Supplement RDBMS Issues 2 HSQ - DATABASES & SQL And Franchise Colleges By MANSHA NAWAZ.
Transaction Management Transparencies. ©Pearson Education 2009 Chapter 14 - Objectives Function and importance of transactions. Properties of transactions.
Transactions.
1 Advanced Database Concepts Transaction Management and Concurrency Control.
10 1 Chapter 10 - A Transaction Management Database Systems: Design, Implementation, and Management, Rob and Coronel.
ICOM 6005 – Database Management Systems Design Dr. Manuel Rodríguez-Martínez Electrical and Computer Engineering Department Lecture 16 – Intro. to Transactions.
18 September 2008CIS 340 # 1 Last Covered (almost)(almost) Variety of middleware mechanisms Gain? Enable n-tier architectures while not necessarily using.
Chapter 13 Managing Transactions and Concurrency Database Principles: Fundamentals of Design, Implementation, and Management Tenth Edition.
MULTIUSER DATABASES : Concurrency and Transaction Management.
SYSTEMS IMPLEMENTATION TECHNIQUES TRANSACTION PROCESSING DATABASE RECOVERY DATABASE SECURITY CONCURRENCY CONTROL.
Transaction Management and Concurrency Control
Introduction to Database Systems
Transaction Management
Transactions Properties.
Transaction Properties
Ch 21: Transaction Processing
CS 632 Lecture 6 Recovery Principles of Transaction-Oriented Database Recovery Theo Haerder, Andreas Reuter, 1983 ARIES: A Transaction Recovery Method.
Database management concepts
Chapter 10 Transaction Management and Concurrency Control
Database Security Transactions
Database management concepts
Introduction of Week 13 Return assignment 11-1 and 3-1-5
Transaction management
Concurrency Control.
Security in Computing, Fifth Edition
Presentation transcript:

Computer Science and Engineering Computer System Security CSE 5339/7339 Session 21 November 2, 2004

Computer Science and Engineering Contents  Introduction to Database  Database Security  Group Work  Kay’s presentation

Computer Science and Engineering Introduction to Database  Consider an enterprise, airline, for example  Large amount of data kept for long period of time  Information about: passengers, flights, aircraft, and personnel  Queries  Operations

Computer Science and Engineering Four major Components  Data  Hardware  Software  Users – end user + application programmer + administrator

Computer Science and Engineering Levels of Abstraction in a DBMS Physical Database View 1 View 2 View n Conceptual Database

Computer Science and Engineering Important Concepts in Database  Data independence -- storage media; application  Schema -- record definition  Relation – table  Indexing – B trees  Entity/ Relationship model – entity, entity set, attributes, key, relationship  Relational Database – information for an enterprise  entities and relationships  relational database  SQL – Query language, programming language, embedded vs. interactive

Computer Science and Engineering Recover and Concurrency  Transaction  Transaction – single execution of a program – logical unit of work  Concurrency Problems  Lost update problem  Uncommitted dependency problem  Inconsistent analysis problem Solving the problem Solving the problem – the use of locks

Computer Science and Engineering Locks  Problems – live lock, deadlock  Serial schedule, serializable schedule  Transactions must have the ACID properties  Atomicity – all or nothing  Consistency – only correct results are committed  Isolation – events within a transaction are hidden  Durability – committed results must be guaranteed

Computer Science and Engineering Transaction execution ***Failure*** Begin Commit Begin ***Abort*** Begin ** System Abort ** Begin Okay System Crash By the user Time out or deadlock

Computer Science and Engineering Four Recovery Actions  Transaction UNDO  Global UNDO – all incomplete transactions must be rolled back  Partial REDO – results of complete transactions that may have not been reflected in the DB  Global REDO – Archive recovery – old copy + archive log

Computer Science and Engineering Famous Diagram Time T1 T2 T3 T4 T5 CheckpointFailure

Computer Science and Engineering Group Work  Discuss the two-phase update technique. Why is it needed? Work a simple example with your group.

Computer Science and Engineering Sensitive Data  Data that should not be made public  Nothing sensitive and everything sensitive – can be handled by access control to the database itself  Some but not all are sensitive -- not only data elements but context and meaning  Factors that make data sensitive  Inherently sensitive  From a sensitive source  Declared sensitive  Part of a sensitive attribute or a sensitive record  Sensitive in relation to previously disclosed information

Computer Science and Engineering Types of Disclosures  Exact data -- most serious disclosure  Bounds – sensitive data is between L and H  Negative result -- a value that is not a zero  Existence  Probable value -- probability that a certain element has a certain value A successful security strategy must protect against both direct and indirect disclosures

Computer Science and Engineering Inference Problem A way to infer or derive sensitive data from non-sensitive data Consider the following database: NameSexRaceAidFinesDrugsDorm

Computer Science and Engineering Direct Attack  Obvious Select Name where Sex = M and Drug = 1  Less Obvious Select Name where (Sex = M and Drug = 1) or (Sex  M and Sex  F) or (Dorm = Caruth)

Computer Science and Engineering Indirect Attack To infer a final result based on one or more intermediate statistical results.  SUM Example: it might seem safe to report student aid total by sex and dorm HolmesEastWestTotal M F Total We can infer that any female living in East such as Mary is not receiving AID

Computer Science and Engineering Indirect Attack To infer a final result based on one or more intermediate statistical results.  Count Example: report the count of records for students by dorm and sex HolmesEastWestTotal M1315 F Combined with the sum report, one can infer that the two males in Holmes and West are receiving $5000 and $4000. Names can be found easily.

Computer Science and Engineering Indirect Attack  Tracker attacks Count (( Sex = F) and (RACE = White) and (DORM = Holmes))  If the result is one, the system may conceal it count(a and b and c) = count (a) – count(a and not(b and c) Count ( Sex = F) Count (( Sex = F) and (RACE  White) or (DORM  Holmes))

Computer Science and Engineering Control for Statistical Inference attacks  Suppress obviously sensitive information  Track what the user knows – very costly, how about two people or user with multiple IDS  Disguise the data – statistical results are close but not exact

Computer Science and Engineering Group Work  Discuss a situation in which the sensitivity of an aggregate is greater than that of its constituent values. Discuss a situation in which the sensitivity of an aggregate is less than that of its constituent values