Publication
Publication
Publication
Lecture Outlines:
2.1 Security Services.
2.2 Security Mechanism
2.3 Security Techniques
Objectives :
After studying this lecture, you will be able to discuss:
✓ Essential Security services to be provided by communication system.
✓ Methods/mechanisms that can ensure various services.
✓ Techniques to realize security goals.
1
Information Security Lecture 2
2
Information Security Lecture 2
3
Information Security Lecture 2
to the data, so that the recipient of the data unit is convinced of the source and
integrity of the data unit and this can also serve to protect the data against forgery
(e.g., by the recipient).
3. Access Control: A variety of mechanisms are available that enforce access rights to
resources.
4. Data Integrity: A variety of mechanisms may be used to assure the integrity of
4
Information Security Lecture 2
certain data transmission and allows routing changes, especially when a breach of
security is suspected.
8. Notarization: This is the use of a trusted third party to assure certain properties of a
data exchange.
may be a data unit) that names or designates the security attributes of that resource.
3. Event Detection: Detection of security-relevant events such as forgery, denial of
5
Information Security Lecture 2
Table 2.2, based on one in X.800, indicates the relationship between security
services and security mechanisms.
2.3.1 Cryptography
Some security mechanisms listed in the previous section can be implemented
using cryptography. Cryptography, a word with Greek origin, means “secret
writing”. However, we use the term to refer to the science and art of transforming
messages to make them secure and immune to attacks. Although in the past
cryptography referred only to the encryption and decryption of messages using secret
keys, today it is defined as involving three distinct mechanisms: symmetric-key
6
Information Security Lecture 2
• Symmetric-key Encipherment :
In symmetric encipherment, an entity, say Alice, can send a message to other
entity, say Bob, over an insecure channel with the assumption that an adversary, say
Eve, cannot understand the contents of the message by simply eavesdropping over
the channel. Alice encrypts the message using an encryption algorithm. Bob decrypts
the message using a decryption algorithm. Symmetric-key encipherment uses a single
secret key for both encryption and decryption. Encryption/decryption can be thought
of as electronic locking system. In symmetric-key enciphering, Alice puts the
message in a box and locks the box using the shared secret key; Bob unlocks the box
with the same key and takes out the messages.
• Asymmetric Encipherment
In asymmetric encipherment, we have the same situation aas the symmetric-
key encipherment, with a few exceptions. First, there are two keys instead of one;
one public key and one private key. To send a secure message to Bob, Alice firsts
encrypts the message using Bob‟s public key. To decrypts the message, Bob uses his
own private key.
• Hashing
In hashing, a fixed-length message digest is created out of a variable-length
message. The digest is normally much smaller than the message. To be useful, both
the message and the digest must be sent to Bob. Hashing is used to provide check
values, which were discussed earlier in relation to providing data integrity.
7
Information Security Lecture 2
2.3.2 Steganography
This is the art of hiding messages in another form. Message is not altered as in
encryption. A text can hide a message. For example, “red umbrella needed” may
mean the message “run”. The first letter of each word in the text becomes the
message. An image can also be used for hiding messages. Digital images are after all
binary information. Suppose the image is grey image. The least significant bit of
consecutive eight pixels may be altered to be a specific bit pattern of a character.
We will discuss this technique of steganography in detail in the unit to come.