PTI-20092-23-Intro To Security & Privacy
PTI-20092-23-Intro To Security & Privacy
PTI-20092-23-Intro To Security & Privacy
Taxonomy
Example
Cryptography: Requirements
Basic: be able to turn plaintext into ciphertext in such a way that only the intended recipientthe holder of the decryption key can recover the plaintext secrecy of the key, and not of the algorithm itself, is the only thing that is needed to ensure the privacy of the data
Asymmetric
DES
64-bit key (56-bits + 8-bit parity) 16 rounds
Initial permutation
Each Round
Li
Ri
Round 1
F +
Ki
Li
Ri
Round 16
Final permutation
DES
DES
DES
DES
Cipher 1
Cipher2
Cipher3
Cipher4
RSA (cont)
Choose two large prime numbers p and q (each 256 bits) Multiply p and q together to get n Choose the encryption key e, such that e and (p - 1) x (q - 1) are relatively prime. Two numbers are relatively prime if they have no common factor greater than one Compute decryption key d such that
So now we have the public key e, n = 7, 77 and the private key d, n = 43, 77
Message Digest
Cryptographic checksum
just as a regular checksum protects the receiver from accidental changes to the message, a cryptographic checksum protects the receiver from malicious changes to the message.
One-way function
given a cryptographic checksum for a message, it is virtually impossible to figure out what message produced that checksum; it is not computationally feasible to find two messages that hash to the same cryptographic checksum.
Relevance
if you are given a checksum for a message and you are able to compute exactly the same checksum for that message, then it is highly likely this message produced the checksum you were given.
http://en.wikipedia.org/wiki/Message_digest
Security Mechanism
Authentication
Is he really C? I am C
I am Server X
I am A
A Server X
A Server X
Authentication Protocols
Three-way handshake Client & Server share a secret key
Client Server
CHK = client handshake key SHK = server handshake key SK = session key
Trusted third party (Kerberos) Authentication Server A and B each share a secret key with S (KA & KB)
S
A, B
K) 1 , E(T +
Spring 2002
CS 461
21
Message integrity
I am sending a message Is this message genuine?
Keyed MD5
sender: m + MD5(m + k) + E(k, private) sender: m + MD5(m + k) + E(E(k, rcv-pub), receiver
private)
recovers random key using the senders public key applies MD5 to the concatenation of this random key message MD5 with RSA signature
sender: m receiver
+ E(MD5(m), private)
decrypts signature with senders public key compares result with MD5 checksum sent with message
Key Distribution
Certificate
special type of digitally signed document:
I certify that the public key in this document belongs to the entity named in this document, signed X.
the name of the entity being certified the public key of the entity the name of the certified authority a digital signature
Example Systems
PGP
PGP encryption
IP Security (IPSec)
a framework for providing all the security services consists of two pieces:
The first piece is a pair of protocols that implement the available security services.
Authentication Header (AH): provides access control, connectionless message integrity, authentication, and antireplay protection Encapsulating Security Payload (ESP), which supports these same services, plus confidentiality
The second piece is support for key management, which fits under an umbrella protocol known as ISAKMP: Internet Security Association and Key Management Protocol
Firewalls
Firewall Rest of the Internet Local site
Filter-Based Solution
example
( 192.12.13.14, 1234, 128.7.6.5, 80 ) (*,*, 128.7.6.5, 80 )
Proxy-Based Firewalls
Problem: complex policy Example: web server
Remote company user Firewall Web server
Internet
Company net
Solution: proxy
External client
Proxy
Biometric
Human factor