Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Part 1 Suppose that Alice signs the message M love you and then encrypts it with Bob's public key before sending it to Bob. Bob

image text in transcribed

Part 1 Suppose that Alice signs the message M love you" and then encrypts it with Bob's public key before sending it to Bob. Bob can decrypt this to obtain the signed message and then encrypt the signed message with, say, Charlie's public key and forward the resulting ciphertext to Charlie. When Charlie receives the message he decrypts it and is amazed to see such a message which appears to come from Alice. What really went wrong here? Could Alice prevent this attack" by using symmetric key cryptography? [Hints: Refer to the lecture-9 and tutorial-9] Part Suppose Bob (the sender) wants to send a message m-5432 to Alice (the receiver). However, before sending the message he would like sign the message. When Alice receives the signed message, she would like to verify that the message is indeed from Bob. To facilitate signing and verification Bob generates public and private keys using ElGamal encryption algorithm and sends the public key to Alice. Bob chooses p-9721, g-1909, x-47. How would Bob sign message m-5432? How would Alice verify the signed message from Bob? Note You do not need to generate hash of the message m.]

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database And Expert Systems Applications 33rd International Conference Dexa 2022 Vienna Austria August 22 24 2022 Proceedings Part 1 Lncs 13426

Authors: Christine Strauss ,Alfredo Cuzzocrea ,Gabriele Kotsis ,A Min Tjoa ,Ismail Khalil

1st Edition

3031124227, 978-3031124228

Students also viewed these Databases questions