Suppose Alice has a and Bob has b. Alice and Bob also share a secure communication channel. Chris wants to compute S = a ⊕ b. Alice does not want Chris or Bob to learn a and Bob does not want Chris or Alice to learn b. How can this be done?
This can be done by sharing some number b/w Alice and Bob.
Let a number c is shared b/w Alice and Bob.
c should not be shared with Chris.
Now, Alice can share (a xor c) with Chris but not to Bob.
Similarly, Bob can share (b xor c) with Chris but not to Alice.
So, Now Chris know (a xor c) and (b xor c).
Chris can calculate (a xor b) = (a xor c) xor ( b xor c).....
So Chris can calculate (a xor b) with satisfying all constraints.
xor =
Suppose Alice has a and Bob has b. Alice and Bob also share a secure communication...
Suppose, Bob (the sender) wants to send a message to Alice. Before sending the message, Bob generates a digital signature. Assume that Bob and Alice use both of the public-key cryptography system and hash function when computing digital signatures. Say, the hash function used to compute and verify signatures is insecure, but the public-key cryptography system is secure. Show that Trudy can forge signatures.
Suppose, Bob (the sender) wants to send a message to Alice. Before sending the message, Bob generates a digital signature. Assume that Bob and Alice use both of the public-key cryptography system and hash function when computing digital signatures. Say, the hash function used to compute and verify signatures is insecure, but the public-key cryptography system is secure. Show that Trudy can forge signatures.
Alice wants to send a secure email message m to Bob, such that confidentiality, sender authen tication, and message integrity are provided. Using block diagrams, explain how this can be achieved
Now, suppose Alice and Bob use random numbers to enhance security. Alice signs the combination of message MI-This is Alice" and a random number R1, then send M1, R1, and digital signature to Bob; and Bob does the similar thing. Is this secure? 9. M1- "This is Alice", R1, Alice_Sign(M1, R1) Alice Bob M2 "This is Bob", R2, Bob_Sign(M2, R2)
Suppose that Alice wants to initiate a message exchange (also called session) to instruct her bank, NetBank, to pay Bob N40. Alice shares a long-term secret, X, with NetBank (hereafter denoted as C). Alice starts the session by sending a service request, (A, C, n), to NetBank, 3. a. where A is Alice's identity, C is NetBank's identity, and n is a nonce. Assume that NetBank keeps a record of the nonces used by Alice for X. Answer the following...
Suppose the attacker has been logging the traffic between Alice and Bob. It is assumed that the attacker can reliably distinguish between messages and their signatures (i.e., tags). In the process he found two messages x and y signed by Alice, i.e., he has pairs <x, tag(x)> and <y, tag(y)>. Suppose the signing function is tag(m) = mk mod n where k is the shared key between Alice and Bob.Show how he can fool Bob into believing that the message...
Question 2 4 pts 2. Bob and Alice are typical users who share a computer. Which of the following are true of a file sharing policy? Assume no tailoring takes place. Select all that apply. Bob and Alice can read files that others can't read. Bob can modify Alice's files. Bob can read Alice's files. Bob can create, read, and modify his own files. Alice can read and write application files. Bob and Alice can share files (read and write)...
Suppose that Bob receives a PGP message from Alice. How does Bob know for sure that Alice created the message?
Alice, a high net worth customer, banks on-line at Super Secure Bank (SSB) and has agreed to use 3DES in communicating with SSB. One day, Alice received a statement that shows a debit of $1,000,000 from her account. On inquiring, she was told that the bank manager, Bob, transferred the money out of Alice's account and into an account of his own in an offshore bank. When reached via long distance in the Cayman Islands, Bob produced a message from...
Let the modulus be p = 23. Bob sends to Alice the value B = 9. Alice’s secret value is a = 10. Compute the secret key kAB to be shared between Alice and Bob. (Explain your computation.) Tip: Perform computation of kAB as it is to be done by Alice. (For completeness, we note that the generator g = 6, but you do not need it for this computation.)