• No results found

4.1: Securing Applications Remote Login: Secure Shell (SSH) PEM/PGP. Chapter 5: Security Concepts for Networks

N/A
N/A
Protected

Academic year: 2021

Share "4.1: Securing Applications Remote Login: Secure Shell (SSH) PEM/PGP. Chapter 5: Security Concepts for Networks"

Copied!
21
0
0

Loading.... (view fulltext now)

Full text

(1)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 1 Chapter 4.1: Secure Applications

4.1: Securing Applications

• Remote Login: Secure Shell (SSH)

• E-Mail: PEM/PGP Chapter 2: Security Techniques Background

Chapter 3: Security on Network and Transport Layer Chapter 4: Security on

the Application Layer

• Secure Applications

• Network Authentication Service: Kerberos

Chapter 5: Security Concepts for Networks

(2)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 2 Chapter 4.1: Secure Applications

Application Layer Security

All common application layer protocols transfer data in plain text. Two possibilities to secure data transfer on application layer:

1. Use IPSec and/or SSL/TLS for secure

• E.g. HTTPS = HTTP over SSL/TLS

2. Develop own secure application layer protocols, e.g.

 SSH (Secure Shell) as secure remote login

 PGP (Pretty Good Privacy) as a secure e-mail protocol

 S-HTTP (Secure Hypertext Transfer Protocol) as secure enhancement of HTTP

 …

(3)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 3 Chapter 4.1: Secure Applications

Secure Shell (SSH)

One of the oldest applications: remote login SSH is a secure protocol for this purpose:

• Log into a remote machine

• Execute commands on that machine

• Transport files from one machine to another SSH provides:

• Strong encryption, server authentication, integrity protection

• Compression (optional)

• An own secure transport layer protocol SSH protocol is subdivided into:

• Connection Protocol

• Authentication Protocol

• Transport Layer Protocol

Client Host / Server

Authentication Request Host Key + Server Key Encrypted Session Key

OK

(4)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 4 Chapter 4.1: Secure Applications

SSH Transport Layer Protocol

Runs on top of TCP and provides:

Connection Setup

• Over TCP, SSH connections use port 22 Security functions

• Server authentication (no user authentication)

• Data confidentiality

• Integrity protection

Negotiation of the functions during connection setup

• Key exchange method (e.g. Diffie-Hellman)

• Public key algorithm (e.g. RSA)

• Symmetric encryption algorithm (e.g. 3DES or IDEA in CBC mode)

• Message authentication algorithm

• Hash algorithm (e.g. MD5)

• Optionally, also a compression algorithm

(5)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 5 Chapter 4.1: Secure Applications

SSH Authentication and Connection Protocol

SSH authentication protocol for user authentication

• Located on top of the SSH transport protocol

• Supported SSH authentication methods:

 Public key (required): signature created with a private key of the user. Often:

private keys stored encrypted at client side and the user must supply a paraphrase before the signature can be generated

 Password (optional)

 Host-based (optional): the name of the host on which the user is logged in is used in authentication

SSH connection protocol for remote work

• Located on top of the SSH transport protocol

• All channels established by a user are multiplexed onto a single, encrypted tunnel provided by the SSH transport protocol

• Provides interactive login sessions, remote execution of commands, forwarded TCP/IP connections, and forwarded X11 connections

(6)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 6 Chapter 4.1: Secure Applications

Secure E-Mail

The sending of e-mails raises several security issues:

Privacy - prevent anyone but the intended recipient from reading the message

• Usually, the sender generates a session key S and sends it to the receiver, encrypted with the receiver‘s key

• Purpose of using a session key S for an e-mail m encryption instead of the receiver‘s key:

only need to encrypt the message ones even if there is a receiver list:

Alice

Bob Carol Dave KBob[S],S[m]

KCarol[S],S[m]

KDave[S],S[m]

Message flow confidentiality

• Hide from an eavesdropper the information about sender-recipient relationships

• Use mix concepts from anonymity

(7)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 7 Chapter 4.1: Secure Applications

Secure E-Mail

Authentication

• Guarantee the identity of the sender to the recipient

• Implementation: sender digitally signs a message digest of the e-mail Integrity

• Guarantee to the recipient that the message has not been altered since it was transmitted by the sender by using encryption

• Usually implemented together with authentication Message sequence integrity

• Verify that a sequence of messages arrived in the order it was transmitted, without any loss e.g. by including sequence numbers before encryption

Containment

• Ability of the network to prevent messages with certain security levels from leaving a particular region (for instance a virtual private network)

• Need to assign a security level marker to each sent message which would be considered by routers in the forwarding process (e.g. as part of a firewall)

(8)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 8 Chapter 4.1: Secure Applications

Secure E-Mail

Non-repudiation

• The recipient is able to proof that the sender really sent the message; the sender cannot deny having sent the message

• Simplest way: digitally sign the message Proof of submission

• Proof (to the sender) that a message with certain content was sent to the mail delivery system on a particular date

• Implementation by computing a message digest from the message concatenated with other useful information, as e.g. time of submission; then sign the message.

• User can later use the signed message digest to prove message and time at once Proof of delivery

• Proof that the recipient received a certain message on a particular date

• Implemented by having either the recipient or the mail delivery system sign a message digest from the message concatenated with the time of receipt (as in proof of submission)

(9)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 9 Chapter 4.1: Secure Applications

Privacy Enhanced Mail (PEM)

PEM was developed by IETF with the aim of enhancing e-mail with

• encryption,

• authentication

• integrity protection

The PEM specification consists of four parts:

• Message format (in addition to RFC 2822)

• Certificates (as defined in X.509), a certification authority (CA) hierarchy, and Certificate Revokation Lists (CRLs)

• Cryptographic algorithms to be used (e.g. DES-CBC, RSA, MD5, …)

• Formats of control messages

PEM has been designed to work with a mail infrastructure that only handles plain text

→ Enhancement: S/MIME to integrate Multi-purpose Internet Mail Extensions (MIME) into a secure mail standard

(10)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 10 Chapter 4.1: Secure Applications

PEM Message Format

PEM messages can consist of several parts of different security level:

• Ordinary: unsecured data

• Integrity-protected unmodified data (MIC-CLEAR): the original message is included unmodified as part of the PEM message, but an integrity check is added

• Integrity-protected encoded data (MIC-ONLY): the message first is base64-encoded, then an integrity check is added

• Encoded encrypted integrity-protected data (ENCRYPTED): an integrity check on the message is computed, then message and integrity check are encrypted with a randomly selected per-message secret key. The encrypted message/integrity check and the key are each base64-encoded to pass through message transfer agents as ordinary text Parts are included in a „normal“ mail body (like for MIME) and seperated by markers

(11)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 11 Chapter 4.1: Secure Applications

PEM Message Example

---BEGIN PRIVACY-ENHANCED MESSAGE--- Proc-Type: 4,ENCRYPTED

Content-Domain: RFC822

DEK-Info: DES-CBC,C4E711C7F3F33772 Originator-Certificate:

MIIBrDCCAVYCAUwwDQYJKoZIhvcNAQECBQAwSjELMAkGA1UEBhMCREUxOzA5BgNV BAoTMkdlc2VsbHNjaGFmdCBmdWVyIE1hdGhlbWF0aWsgdW5kIERhdGVudmVyYXJi ZWl0dW5nMB4XDTk0MDEyMTA4MTM1MVoXDTk1MTIzMTIzMDAwMFowezELMAkGA1UE BhMCREUxOzA5BgNVBAoTMkdlc2VsbHNjaGFmdCBmdWVyIE1hdGhlbWF0aWsgdW5k IERhdGVudmVyYXJiZWl0dW5nMRIwEAYDVQQHEwlEYXJtc3RhZHQxGzAZBgNVBAMT EldvbGZnYW5nIFNjaG5laWRlcjBZMAoGBFUIAQECAgIAA0sAMEgCQQCOj39uwvnu trnDbdAyu12Bioomecmogic5m42nB1VWhrCTgaj3acA7rJRildhlyiuIwbJV0ac7 QILEb97YssWdAgMBAAEwDQYJKoZIhvcNAQECBQADQQAzmvCqJqw6PvvsiDFUcbNC c/4CgIg5xko1J6a+RvyDmgBUNgjTsNk90NqxHL62xMB8h2l0Mw5pN5+AIwWTBkDw MIC-Info: RSA-MD5,RSA,

WQRudJHT8QKNRvSpgQlrnFBpFNOP+Ek6JwFImEXnnEW87/dL/sQe+Z4+JCEXZbnJ wxaXlPb3HUEIxmheSQJakFxnA9UYCo+n

Recipient-ID-Asymmetric:

MEoxCzAJBgNVBAYTAkRFMTswOQYDVQQKEzJHZXNlbGxzY2hhZnQgZnVlciBNYXRo ZW1hdGlrIHVuZCBEYXRlbnZlcmFyYmVpdHVuZw==

,38

Key-Info: RSA,

YIt1/6EYVV2zheVNiTyh0DA3vwX/GhMk2IDYp7MSlFhQ4PIODaXrIYUwTAzEw/oE 7cpI1jFxf3hqjjaSkZrkDA==

Recipient-ID-Asymmetric:

MF8xCzAJBgNVBAYTAkdCMSIwIAYDVQQKExlVbml2ZXJzaXR5IENvbGxlZ2UgTG9u ZG9uMRkwFwYDVQQLExBDb21wdXRlciBTY2llbmNlMREwDwYDVQQLEwhQQVNTV09S RA==

,2D6A05AC Key-Info: RSA,

Hu9/pODM8eMVhXnkKb75YEz4ToWeFWecpOGzoysz4uEGRsgTc/5kBoTz3ovykqXN 74JmRaD7VkWJWWKwki/7rA==

qu8HYmqLIHBKfZo5cH3VrVQdp626fbNsSYQnHTcCPyI4ZfCM+WWBz5ZjYqHmaV5R GJKmNjiGbws=

---END PRIVACY-ENHANCED MESSAGE---

Hi,

this is a PEM example letter.

Regards

Message content:

Marker

Header information: security level and encryption mode

(here: DES in CBC mode plus IV) Certificate of sender (optional)

Encrypted MIC Message key, encrypted with the public key of one recipient (here: two recipients)

Blank line

(12)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 12 Chapter 4.1: Secure Applications

Alice-

<Text from Fred>

-- --Fred

---END PRIVACY-ENHANCED MESSAGE--- ---END PRIVACY-ENHANCED MESSAGE---

- ----BEGIN PRIVACY-ENHANCED MESSAGE---

PEM - Forwarding And Enclosures

header, statingMIC-CLEAR

MIC (message digest signed with Fred's private key) Bob-

Have a look at the stuff Fred is sending me!

- --Alice

MIC (message digest signed with Bob's private key) header, statingMIC-CLEAR

---BEGIN PRIVACY-ENHANCED MESSAGE---

When Alice wants to forward Bob a message she received from someone else (say, Fred), she encapsulates it in a new message to keep Fred‘s signatures:

In case of a message in ENCRYPTED mode, Alice first has to decrypt the message from Fred and re-encrypt it with Bob‘s key

(13)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 13 Chapter 4.1: Secure Applications

PEM Certification Authority Hierarchy

PEM specifies a single root CA called the IPRA (Internet Policy Registration Authority)

• IPRA certifies PCAs (Policy Certification Authorities), organized as a tree:

Each PCA has to enforced a policy from one of three possible security levels:

• High Assurance (HA): super-secure, i.e. implemented on special hardware, tamper resistant, etc.

• Discretionary Assurance (DA): well managed at top level, but does not impose any rules on the organisations to which CA certificates are granted

• No Assurance (NA): only constraint: not allowed to issue two certificates with same name

PCAs Various

organisations' CAs Individuals or CAs etc

individual HACA HACA

individual HACA HACA

CA

CA individual CA

DACA

CA

CA CA NACA IPRA

(14)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 14 Chapter 4.1: Secure Applications

S/MIME

S/MIME introduces security in MIME-encoded mails:

• Similar algorithms to PEM

• Two new MIME content parts are defined to specify algorithm and contents 1. Multipart/Signed

Consists of a MIME header with all information for checking the signature, and two informative blocks:

 The signed message

 Digital signature 2. Multipart/Encrypted

 Information for decryption (e.g. algorithms, keys)

 Encrypted contents

(15)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 15 Chapter 4.1: Secure Applications

S/MIME Example

Content-Type: multipart/signed;

protocol="application/pkcs7-signature";

micalg=sha1;

boundary=boundary42 --boundary42

Content-Type: text/plain

This is a clear-signed message.

--boundary42

Content-Type: application/pkcs7-signature; name=smime.p7s Content-Transfer-Encoding: base64

Content-Disposition: attachment; filename=smime.p7s

ghyHhHUujhJhjH77n8HHGTrfvbnj756tbB9HG4VQpfyF467GhIGfHfYT6 4VQpfyF467GhIGfHfYT6jH77n8HHGghyHhHUujhJh756tbB9HGTrfvbnj n8HHGTrfvhJhjH776tbB9HG4VQbnj7567GhIGfHfYT6ghyHhHUujpfyF4 7GhIGfHfYT64VQbnj756

--boundary42--

states that the content consists of two parts: message and signature

protocol for computing the signature protocol for computing the MIC

Block 1: signed message

Block 2: digital signature

(16)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 16 Chapter 4.1: Secure Applications

PGP – Pretty Good Privacy

PGP specifies encryption and integrity protection on files (not only for mail) Most relevant differences to PEM:

• Key distribution

 PEM assumes a rigid hierarchy of CAs

 PGP assumes anarchy – certificates/keys are distributed informally, as well as certificate revokations

• Certificates

 PEM infrastructure decides whom the user should trust to certify people

 PGP leaves it up to the user whom he trusts

• Encoding

 PEM expects plain text (by using encodings like base64, expanding the contents by about 33%)

 PGP allows to specify whether a file is text or binary, additionally zip-compression is possible

(17)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 17 Chapter 4.1: Secure Applications

PGP vs. PEM

IETF Small team

Developed by

Yes No

Can eavesdroppers read signatures?

No No

Can eavesdroppers read messages?

IPRA/PCA/CA-hierarchy Ad hoc

Key certification

Yes No

Certificates are X.509 conformant?

Variable Up to 4096

Key length for key management (bits)

RSA RSA, DSA/ElGamal

Algorithm for key management

56, 112 128, 112

Key length for data encryption (bits)

DES, 3DES IDEA, 3DES

Algorithm for data encryption

No Yes

Supports compression?

Yes Yes

Supports non-repudiation?

Yes Yes

Supports authentication?

Yes Yes

Supports encryption?

PEM PGP

(18)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 18 Chapter 4.1: Secure Applications

PGP Message Format

session key component

signature

message

key ID of Krcv session key k

timestamp key ID of Ksnd

leading two octets of hash hash

filename timestamp

data

Encrypted with public key of the receiver krcv

Encrypted with private key of the receiver ksnd

Compressed and encryted with k

(19)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 19 Chapter 4.1: Secure Applications

PGP and Trust

In PGP, each user decides which keys he trusts

• More secure if the user is careful

• Each user decides how much trust he places on different people (none, partial or

complete, resp. more levels in the commercial version) – possible risk for careless users?

• More difficult to find a path of certificates (especially in large environments), e.g. if Alice wants to find out if to trust Bob:

 If Alice has a disorganized mass of certificates, how can she find a chain that leads from a key she knows to a key of Bob?

 There might be multiple chains, and some might lead to different keys for Bob

 If Alice finds a chain, how much can she trust that chain?

→ With each key PGP stores a quantity, indicating how much the key should be

trusted as being legitimate, and how much the owner of the key should be trusted in certifying other keys

(20)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 20 Chapter 4.1: Secure Applications

Trust Management

Check the trust level of a key:

•Computed by the PGP system

•If at least one signature trust is ultimate, then the key legitimacy is 1 (complete)

•Otherwise, a weighted sum of the signature trust values is computed

Always trusted signatures has a weight of 1/X

Usually trusted signatures has a weight of 1/Y

X, Y are user-configurable parameters

•example: X=2, Y=4

•1 ultimately trusted, or

•2 always trusted, or

•1 always trusted and 2 usually trusted, or

•4 usually trusted signatures

are needed to obtain full legitimacy

(21)

Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme

Page 21 Chapter 4.1: Secure Applications

Example – Check of Trust

X = 1, Y = 2

 



 





user A

B

C

D

E F

G H

I

J

K

L M



untrusted / usually untrusted usually trusted

always trusted

ultimately trusted (you) signature

legitimate

References

Related documents

When the German historical interest rate on 10 year bond yields for the “blue bonds” and national historical interest rates for the “red debt” are used,

Through the City of Rochester and RochesterWorks, RCTV worked with 12 interns from the Summer of Opportunity Program. They incorporated the use of Garage Band, Motion, and

Similarly to presumed consent, implementing mandated choice will likely increase the supply of organs because if Ontarians are forced to make a choice and most prefer to be

Lasser, Amenability and weak amenability of l 1 -algebras of polynomial hypergroups, Studia Math.. Gourdeau, Amenability of Banach

PGCIL’ s Smart Grid Pilot Plan for PED-1 included detailed information on the (technical and) financial benefits and costs of rooftop solar to the consumer, but it is unclear how

In accordance with Article 719 of the Belgian Companies Code, the boards of directors of KBC Group NV, a naamloze vennootschap (company with limited liability), with its

Demonstrating the love of Christ, UGM offers help and hope through a comprehensive range of life-changing services, which include Meals, Outreach, Emergency Shelter, Alcohol

Mishra and Shibata (2012) have classified three aerosol types (dust, biomass burning and urban pollution) over Kanpur by analyzing the spectral variation of the absorbing