|
|
This is only a preview of the paper
Click here to register and get the full text.
Existing members click here to login
|
|
|
, conventional encryption is used. It’s assumed that the sender X and the arbiter A share a secret key Kxa and that A and Y share secret key Kay. X consists of message M and computes its hash value H(M). Then X transmits the message plus a signature to A. the signature consists of an identifier of X plus the hash value, all encrypted using kxa. A decrypts the signature and checks the hash value to validate the message. Then A transmits a message to Y, encrypted with Kay. The message includes Idx, the original message from X, the signature and a timestamp. Y can decrypt this to recover the message and this signature. This timestamp informs Y that this message is timely and not a replay. Y can store M and the signature. In 10.1b, shows a scenario that provides the arbitration as before also assures confidentiality.
Approximate Word count = 546
Approximate Pages = 2.2
(250 words per page double spaced)
|
|
|
|
|
|