scuholliday12–1 schedule today: u security, object-relational systems. u read section 8.7. next u...

39
SCU Holliday 12–1 Schedule • Today: Security, Object-Relational Systems. Read Section 8.7. • Next Indexing. Read Section 6.6.5 • And Then Query optimization. No Readings in Text

Upload: camron-preston

Post on 01-Jan-2016

218 views

Category:

Documents


4 download

TRANSCRIPT

Page 1: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–1

Schedule

• Today: Security, Object-Relational Systems. Read Section 8.7.

• Next Indexing. Read Section 6.6.5

• And Then Query optimization. No Readings in Text

Page 2: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–2

Terminology

• A Vulnerability is a weakness in the system that might (or might not) be exploited to cause loss or harm.

• Threats to computing systems are circumstances that have the potential to cause loss or harm. Human attacks from disgruntled employees, natural disasters, human errors, hardware and software flaws are threats. Threats can be assigned a probability.

Page 3: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–3

Security Goals

• Identify the assets: hardware, software, data

• Maintain three properties: Confidentiality – only authorized people can

see protected data Integrity – only acceptable and authorized

modifications, internally consistent and meaningful, error detection and correction

Availability – fair allocation of resources, can be used as intended

Page 4: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–4

Security Vulnerabilities• Database system level

Authentication and authorization mechanisms to allow specific users access only to required data

DBMS has automatic backup and recovery mechanism Audit files

• Operating system level O.S. super-users can do anything they want to the

database! O.S. level security is required.

• Network level: must use encryption to prevent Eavesdropping (unauthorized reading of messages) Masquerading (pretending to be an authorized user or

sending messages supposedly from authorized users)

Page 5: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–5

Sources of Vulnerabilities Physical level

• Physical access to computers allows destruction of data by intruders; traditional lock-and-key security is needed

• Computers must also be protected from floods, fire, etc.

Human level• Users must be screened to ensure that authorized

users do not give access to intruders

• Users should be trained on password selection and secrecy

Page 6: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–6

Authorization in SQL

• File systems identify certain access privileges on files, e.g., read, write, execute.

• Similarly, SQL identifies six access privileges on relations, of which the most important are:

1. SELECT = the right to query the relation. (READ)

2. INSERT = the right to insert tuples into the relation – may refer to one attribute, in which case the privilege is to specify only one column of the inserted tuple.

3. DELETE = the right to delete tuples from the relation.

4. UPDATE = the right to update tuples of the relation – may refer to one attribute.

Page 7: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–7

Granting Privileges• You have all possible privileges to the relations you create.

• You may grant privileges to any user if you have those privileges “with grant option.”

You have this option to your own relations.

Example1. Here, Sally can query Sells and can change prices, but cannot

pass on this power:GRANT SELECT ON Sells,

UPDATE(price) ON SellsTO sally;

2. Here, Sally can also pass these privileges to whom she chooses:GRANT SELECT ON Sells,

UPDATE(price) ON SellsTO sallyWITH GRANT OPTION;

Page 8: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–8

Revoking Privileges

• Your privileges can be revoked.• Syntax is like granting, but REVOKE ... FROM instead

of GRANT ... TO.• Determining whether or not you have a privilege is tricky,

involving “grant diagrams”. However, the basic principles are:

a) If you have been given a privilege by several different people, then all of them have to revoke in order for you to lose the privilege.

b) Revocation is transitive. if A granted P to B, who then granted P to C, and then A revokes P from B, it is as if B also revoked P from C.

Page 9: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–9

Schema Privileges

Forms of authorization to modify the database schema:

• Index authorization - allows creation and deletion of indices.

• Resources authorization - allows creation of new relations.

• Alteration authorization - allows addition or deletion of attributes in a relation.

• Drop authorization - allows deletion of relations.

Page 10: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–10

View Privileges

• Users can be given authorization on views, without being given any authorization on the relations used in the view definition

• Ability of views to hide data serves both to simplify usage of the system and to enhance security by allowing users access only to data they need for their job

• A combination of relation-level security and view-level security can be used to limit a user’s access to precisely the data that user needs.

Page 11: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–11

Views• Suppose a bank clerk needs to know the names of

the customers of each branch, but is not authorized to see specific loan information. Approach: Deny direct access to the loan relation, but

grant access to the view cust-loan, which consists only of the names of customers and the branches at which they have a loan.

The cust-loan view is defined in SQL as follows:

create view cust-loan as select branchname, customer-name from borrower, loan where borrower.loan-number =

loan.loan-number

Page 12: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–12

• The clerk is authorized to see the result of the query:

select *from cust-loan

• When the query processor translates the result into a query on the actual relations in the database, we obtain a query on borrower and loan.

• Authorization must be checked on the clerk’s query before query processing begins. (Can you guess why?)

Page 13: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–13

• Creation of view does not require resources authorization since no real relation is being created.

• The creator of a view gets only those privileges that provide no additional authorization beyond that he already had.

• E.g. if creator of view cust-loan had only read authorization on borrower and loan, he gets only read authorization on cust-loan

Page 14: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–14

• The passage of authorization from one user to another may be represented by an authorization graph.

• The nodes of this graph are the users.

• The root of the graph is the database administrator.

• Consider graph for update authorization on loan.

• An edge Ui Uj indicates that user Ui has granted update authorization on loan to Uj.

U1 U4

U2 U5

U3

DBA

Page 15: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–15

• Requirement: All edges in an authorization graph must be part of some path originating with the database administrator

• If DBA revokes grant from U1: Grant must be revoked from U4 since U1 no longer has

authorization Grant must not be revoked from U5 since U5 has another

authorization path from DBA through U2

• Must prevent cycles of grants with no path from the root: DBA grants authorization to U7

U7 grants authorization to U8

U8 grants authorization to U7

DBA revokes authorization from U7

• Must revoke grant U7 to U8 and from U8 to U7 since there is no path from DBA to U7 or to U8 anymore.

Page 16: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–16

Another Look at GRANT• The grant statement is used to confer authorization

grant <privilege list>

on <relation name or view name> to <user list>

• <user list> is: a user-id public, which allows all valid users the privilege granted A role (more on this later)

• Granting a privilege on a view does not imply granting any privileges on the underlying relations.

• The grantor of the privilege must already hold the privilege on the specified item (or be the database administrator).

Page 17: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–17

The GRANT Statement• select: allows read access to relation,or the ability to query

using the view Example: grant users U1, U2, and U3 select authorization on the

branch relation:

grant select on branch to U1, U2, U3

• insert: the ability to insert tuples• update: the ability to update using the SQL update

statement• delete: the ability to delete tuples.• references: ability to declare foreign keys when creating

relations.• usage: In SQL-92; authorizes a user to use a specified

domain• all privileges: used as a short form for all the allowable

privileges

Page 18: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–18

More on GRANT

• with grant option: allows a user who is granted a privilege to pass the privilege on to other users. Example:

grant select on branch to U1 with grant option

gives U1 the select privileges on branch and allows U1 to grant this

privilege to others

Page 19: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–19

Roles• Roles permit common privileges for a class of users which

can be specified just once by creating a corresponding “role”• Privileges can be granted to or revoked from roles, just like

to/from users• Roles can be assigned to users, and even to other roles• SQL:1999 supports roles

create role tellercreate role manager

grant select on branch to tellergrant update (balance) on account to tellergrant all privileges on account to manager

grant teller to manager

grant teller to alice, bobgrant manager to JoAnne

Page 20: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–20

More on REVOKE• The revoke statement is used to revoke authorization.

revoke<privilege list>

on <relation name or view name> from <user list> [restrict|cascade]

• Example:revoke select on branch from U1, U2, U3 cascade

• Revocation of a privilege from a user may cause other users also to lose that privilege; referred to as cascading of the revoke.

• We can prevent cascading by specifying restrict:revoke select on branch from U1, U2, U3 restrict

With restrict, the revoke command fails if cascading revokes are required.

Page 21: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–21

Revoking Continued

• <privilege-list> may be all to revoke all privileges the revokee may hold.

• If <revokee-list> includes public all users lose the privilege except those granted it explicitly.

• If the same privilege was granted twice to the same user by different grantees, the user may retain the privilege after the revocation.

• All privileges that depend on the privilege being revoked are also revoked.

Page 22: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–22

Limitations

• SQL does not support authorization at a tuple level E.g. we cannot restrict students to see only (the tuples storing)

their own grades (but Oracle 9i does)

• All end-users of an application (such as a web application) may be mapped to a single database user

• The task of authorization in above cases falls on the application program, with no support from SQL Authorization must be done in application code, and may be

dispersed all over an application Checking for absence of authorization loopholes becomes very

difficult since it requires reading large amounts of application code

Page 23: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–23

Encryption

• Data may be encrypted when database authorization provisions do not offer sufficient protection.

• Properties of good encryption technique: Relatively simple for authorized users to encrypt and

decrypt data. Encryption scheme depends not on the secrecy of the

algorithm but on the secrecy of a parameter of the algorithm called the encryption key.

Extremely difficult for an intruder to determine the encryption key. (AMTH 387 Cryptology – 4 units)

Page 24: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–24

Encryption Continued• Data Encryption Standard (DES) substitutes characters and rearranges

their order on the basis of an encryption key. Scheme is no more secure than the key transmission mechanism since the key has to be shared.

• Advanced Encryption Standard (AES) is a new standard replacing DES, and is based on the Rijndael algorithm, but is also dependent on shared secret keys

• Public-key encryption is based on each user having two keys: public key – publicly published key used to encrypt data, but cannot be

used to decrypt that data private key -- key known only to individual user, and used to decrypt

data. Need not be transmitted to the site doing encryption.

Encryption scheme is such that it is impossible or extremely hard to decrypt data given only the public key.

• The RSA public-key encryption scheme is based on the difficulty of factoring a very large number (100's of digits) into its prime components.

Page 25: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–25

Authentication• Password based authentication is widely used, but is

susceptible to sniffing on a network – do you use telnet??• Challenge-response systems avoid transmission of

passwords DB sends a (randomly generated) challenge string to user User encrypts string and returns result. DB verifies identity by decrypting result Can use public-key encryption system by DB sending a message

encrypted using user’s public key, and user decrypting and sending the message back

• Digital signatures are used to verify authenticity of data E.g. use private key (in reverse) to encrypt data, and anyone can

verify authenticity by using public key (in reverse) to decrypt data. Only holder of private key could have created the encrypted data.

Digital signatures also help ensure nonrepudiation: sendercannot later claim to have not created the data

Page 26: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–26

Statistical Databases

• Problem: how to ensure privacy of individuals while allowing use of data for statistical purposes (e.g., finding median income, average bank balance etc.)

• How to allow:Select avg(balance)

From Account

Where branch-name=“Oakland”

• Without allowingSelect balance

From Account

Where acc#=101

Page 27: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–27

Statistical Databases

• Solutions: System rejects any query that involves fewer than some

predetermined number of individuals.

Still possible to use results of multiple overlapping queries to deduce data about an individual

Data pollution -- random falsification of data provided in response to a query.

Random modification of the query itself.

• There is a tradeoff between accuracy and security.

Page 28: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–28

Physical Level Security• Protection of equipment from floods, power failure, etc.

• Protection of disks from theft, erasure, physical damage.

• Protection of network and terminal cables from wiretaps non-invasive electronic eavesdropping, physical damage.

Solutions:

• Replicated hardware: mirrored disks, dual busses, etc. multiple access paths between every pair of devices

• Physical security: locks, police, etc.

• Software techniques to detect physical security breaches.

Page 29: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–29

Human Level Security

• Protection from stolen passwords, sabotage, etc.

• Primarily a management problem: Frequent change of passwords Use of “non-guessable” passwords Log all invalid access attempts Data audits Careful hiring practices

Page 30: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–30

Operating System Level

• Protection from invalid logins

• File-level access protection (often not very helpful for database security)

• Protection from improper use of “superuser” authority.

• Protection from improper use of privileged

machine instructions.

Page 31: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–31

Network Level Security

• Each site must ensure that it communicate with trusted sites (not intruders).

• Links must be protected from theft or modification of messages

• Mechanisms: Identification protocol (password-based), Cryptography.

Page 32: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–32

Database Level Security

• Assume security at network, operating system, human, and physical levels.

• Database specific issues: each user may have authority to read only part

of the data and to write only part of the data. User authority may correspond to entire files or

relations, but it may also correspond only to parts of files or relations.

• Oracle 9i allows row-level authorization

Page 33: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–33

Object-Relational DBMS

• Get the advantages of Object Orientation without losing the advantages of Relational DBMS.

Page 34: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–34

Object-Relational Systems

• Keep relation as the fundamental abstraction.

• Compare with “object-oriented DBMS,” which uses the class as the fundamental abstraction and tacks on relations as one of many types.

Motivations• Allow DBMS’s to deal with specialized types – maps,

signals, images, etc. – with their own specialized methods as in O-O programming languages.

• Supports specialized methods even on conventional relational data.

• Supports structure more complex than “flat files.”

Page 35: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–35

User-Defined Types

SQL allows UDT’s that play a dual role:

1. They can be the types of relations; i.e., the type of their tuple.

Sometimes called a row type.

2. They can be the type of an attribute in a relation.

Page 36: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–36

Defining UDT’s – Example in Oracle Syntax

CREATE TYPE BarType AS OBJECT (name CHAR(20) UNIQUE,addr CHAR(20)

);

CREATE TYPE BeerType AS OBJECT (name CHAR(20) UNIQUE,manf CHAR(20)

);

CREATE TYPE MenuType AS OBJECT (bar REF BarType,beer REF BeerType,price FLOAT

);

Page 37: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–37

Creating Tables

Type declarations do not create tables.• They are used in place of element lists in CREATE TABLE statements.

ExampleCREATE TABLE Bars OF BarType;

CREATE TABLE Beers OF BeerType;

CREATE TABLE Sells OF MenuType;

Page 38: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–38

Values of User-Defined Types – Oracle Approach

• Each UDT has a type constructor of the same name.

• Values of that type are the values of its fields wrapped in the constructor.

ExampleSELECT * FROM Bars;

produces values such as

BarType('Joe''s Bar','Maple St.')

Page 39: SCUHolliday12–1 Schedule Today: u Security, Object-Relational Systems. u Read Section 8.7. Next u Indexing. u Read Section 6.6.5 And Then u Query optimization

SCU Holliday 12–39

Accessing Fields of an Object – Oracle Approach

The dot operator works as expected.• Thus, if we want the bar name and address

without the constructor:SELECT bb.name, bb.addrFROM Bars bb;

• The alias bb is not technically necessary, but there are other places where we must use an alias in order to access objects, and it is a good habit to use an alias always.