5. As shown in the figure below, we see how Alice can send Bob a singed message. If Trudy replaces P, Bob can detect it. But what happens if Trudy replaces both P and the signature? P, DA (MD (P)) Alice signs Message sent in the clear message digest what happens? Provide explanation. Solution: Alice Bob

5. As shown in the figure below, we see how Alice can send Bob a singed message. If Trudy replaces P, Bob can detect it. But what happens if Trudy replaces both P and the signature? P, DA (MD (P)) Alice signs Message sent in the clear message digest what happens? Provide explanation. Solution: Alice Bob

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Given the following table describing the procedure for Alice to send a signed message with DSA signature to Bob, calculate the unknown entities and verify that Bob has received the correct message sent by Alice. Here, for simplicity we assume that the hash of a message m, h(m) is already computed and given to you. Alice Bob Choose p=19, q=7, α=2, d=6 Compute β= αd mod p = Public key: kpub = (p,q,α,β) = Private key: kpriv = (d) Send public key to Bob: (p,q,α,β)= Hash of message m , h(m) = 7 (given) Receive Alice’ public key (p,q,α,β)= Ephemeral key, kE = 5 Compute kE-1 mod q = Compute r= (αkE mod p) mod q Compute s= (h(m) + d*r)* kE-1 mod q = DSA Signature (r,s) = Send message (m, (r,s)) to Bob Receive message (m, (r,s)) from Alice; here we assume h(m)=7 as known Compute w = s-1 mod q = Compute u1 = w*h(m) mod q = Compute u2 = w*r mod q = Compute…
In the Diffie-Hellman Protocol, each participant selects a secret number x and sends the other participant αx mod q for some public number α. What would happen if the participants sent each other αx for some public number αinstead? Give at least one method Alice and Bob could use for agreeing on a key. Can Eve break your system without finding the secret numbers? Can Eve find the secret numbers? In TLS, why is there a separate Change Cipher Spec Protocol, rather than including a change_cipher_spec message in the Handshake Protocol?
How does Alice verify that a message M that was signed by Bob using RSA is really from Bob? Assume that eA and dA are the encryption and decryption exponents for Alice while eB and dB are those for Bob. The agreed upon hash function is h. All congruences are mod N and Alice has Bob's certificate. Question 10 options: She compares h(M) to DSdA mod N She compares h(M) to DSdB mod N She compares h(M) to DSeB mod N She compares h(M) to DSeA mod N
Assume that Bob and Alice have a secret K that they keep to themselves. Can you explain how Alice can use a message digest to authenticate herself to Bob?
Assume that Bob & Alice share a secret K. Describe how Alice can authenticate herself to Bob using a message digest?
Consider the failed attempt of Alice to get Bob’s public key inFig. 8-25 . Suppose that Bob and Alice already share asecret key, but Alice still wants Bob’s public key. Is there now away to get it securely? If so, how?
Alice wants Bob (the Bank) to sign a cheque, c. She has Bob's public key e and modulus N, and chooses a random number r such that gcd(r,N) = 1. She computes re (mod N) and then multiplies the cheque, c, by this number (mod N) and sends the resulting message off to Bob to be signed. When she receives his reply, m, what should she do with it to produce the signed cheque? Select one: a. Divide the reply, m, by rd. b. Divide the reply, m, by r. c. Divide the reply, m, by re. d. Nothing - the reply is the signed cheque
Alice wants Bob (the Bank) to sign a cheque, c. She has Bob's public key e and modulus N, and chooses a random number r such that gcd(r,N) = 1. She computes re (mod N) and then multiplies the cheque, c, by this number (mod N) and sends the resulting message off to Bob to be signed. When she receives his reply, m, what should she do with it to produce the signed cheque? Select one: a. Divide the reply, m, by rd. b. Divide the reply, m, by r. c. Divide the reply, m, by re. No - that won't do it. d. Nothing - the reply is the signed cheque
The following system is proposed for securely communicating a 256-bit message m:A→B:i,m⊕h(i)That is, Alice sends Bob an integer i and the message m xor'ed with a SHA-256 hash of i. (SHA-256 produces a 256-bit digest, so the lengths of h(i) and m are equal.) Bob can decode the message m⊕h(i) by hashing i (which is communicated as plaintext), and can thus derive m, since (m⊕h(i))⊕h(i)=m.Show that this scheme is very broken and that a passive eavesdropper can trivially learn m.
Alice computes the hash of a password and sends it to Bob, who hashes it and compares it against a database of doubly-hashed passwords what is the threat and solution?
Alice wants to securely send Bob an arbitrary numberM from the set {0, 1, . . . , N − 1} for some positive integer N. She wants to have ascheme with perfect secrecy. She heard of the One Time Pad (OTP), but OTP isfor bitstrings, not numbers. She decides to use the following scheme. The key spaceis {0, 1, . . . , N − 1}. A ciphertext C for M is computed as (M + K) mod N anddecryption performs (C − K) mod N.Prove that this scheme is perfectly secure
Suppose that Alice and Bob agree to hash an integer by taking the sum of the digits modulo 1212. Also suppose Alice has a public key with modulus 304891304891 and exponent 7373 and Bob has a private key given by the primes 619619 and 799799 with exponent 2323. Give the ciphertext Bob would send to sign the message 6005460054.