Is CH6
Is CH6
5TH SEM
INFORMATION SECURITY (1030106503)
THEORY NOTES
Figure above is a generic model of the process of making and using digital signatures.
Bob can sign a message using a digital signature generation algorithm.
The inputs to the algorithm are the message and Bob’s private key.
Any other user, say Alice, can verify the signature using a verification algorithm, whose
inputs are the message, the signature, and Bob’s public key.
In simplified terms, the essence of the digital signature mechanism is shown in Figure
below.
1. Mary may forge a different message and claim that it came from John. Mary would simply
have to create a message and append an authentication code using the key that John and Mary
share.
2. John can deny sending the message. Because it is possible for Mary to forge a message, there
is no way to prove that John did in fact send the message.
Both scenarios are of legitimate concern.
The sender pretends that the message was never sent.
In situations where there is not complete trust between sender and receiver, something
more than
authentication is needed.
The most attractive solution to this problem is the digital signature.
to be signed is chosen after C knows A’s public key but before any signatures are seen.
5. Adaptive chosen message attack: C is allowed to use A as an “oracle.” This means the A
may
request signatures of messages that depend on previously obtained message–signature pairs.
If anyone success at breaking a signature scheme can do any of the following with a non-
negligible probability:
1) Total break: C determines A’s private key.
2) Universal forgery: C finds an efficient signing algorithm that provides an equivalent way
of constructing signatures on arbitrary messages.
3) Selective forgery: C forges a signature for a particular message chosen by C.
4) Existential forgery: C forges a signature for at least one message. C has no control over
the message. Consequently, this forgery may only be a minor nuisance to A.
A protocol must be complete - must include a specified action for every possible situation.
• Authentication Protocols are used mainly by Point-to-Point Protocol (PPP) servers to
validate the identity of remote clients before granting them access to server data.
• Most of them are using a password as the cornerstone of the authentication.
• The password has to be shared between the communicating entities in advance.
RSA approach
In the RSA approach, the message to be signed is input to a hash function that produces a
secure hash code of fixed length.
This hash code is then encrypted using the sender’s private key to form the signature.
Both the message and the signature are then transmitted.
The recipient takes the message and produces a hash code.
The recipient also decrypts the signature using the sender’s public key.
If the calculated hash code matches the decrypted signature, the signature is accepted as
valid.
DSS approach
The DSS approach also makes use of a hash function.
The hash code is provided as input to a signature function along with a random number k,
generated for this particular signature.
The signature function also depends on the sender’s private key (PRa), and a set of
parameters known to a group of communicating principals.
We can consider this set to constitute a global public key (PUG).
The result is a signature consisting of two components, labeled s and r.
At the receiving end, the hash code of the incoming message is generated.
This plus the signature is input to a verification function.
The verification function also depends on the global public key as well as the sender’s
public key (PUa), which is paired with the sender’s private key.
The output of the verification function is a value that is equal to the signature component
r, if the signature is valid.
The signature function is such that only the sender, with knowledge of the private key,
could have produced the valid signature.