联系方式

  • QQ:99515681
  • 邮箱:99515681@qq.com
  • 工作时间:8:00-23:00
  • 微信:codinghelp

您当前位置:首页 >> Java编程Java编程

日期:2020-11-19 11:40

INFO SECURITY : COMP3020J


Exercise Sheet 6

Assignment 6: Protocols

(!This is a graded assignment and is worth 25% of final grade)

1. Design a secure mutual authentication protocol based on a shared symmetric key. The

protocol must establish a session key, and to ensure perfect forward secrecy.

a. Design such a protocol that uses three messages. [3marks]

b. Design such a protocol that uses two messages. [2 marks]

[5 marks]

2. Consider the following mutual authentication and key establishment protocol, where

the session key is given by K = gab mod p

Suppose that Alice attempts to initiate a connection with Bob using

this protocol.

a. Show that Trudy can attack the protocol so that both of the following

will occur.

i. Alice and Bob authenticate each other.

ii. Trudy knows Alice's session key.

Hint: Consider a man-in-the-middle attack. [8 marks]

b. Is this attack of any use to Trudy? [2 marks]

[10 marks]

Bob

B

“I am Alice”, Na

Nb, {Na}KbPriv,{gb Alice mod p}KaPub

A

{Nb}KaPriv, {ga mod p}KbPub

INFO SECURITY : COMP3020J


Exercise Sheet 6

Dr. Anca Jurcut Page 2

3. Suppose that in the Fiat-Shamir protocol, as illustrated below, we have N = 27,331 and

v = 7339.

a. In the first iteration, Alice sends x = 21,684 in message one, Bob sends e = 0 in

message two, and Alice sends y = 657 in the third message. Show that Bob verifies

Alice's response in this case. [1 marks]

b. At the next iteration, Alice again sends x = 21,684 in message one, but Bob sends

e = 1 in message two, and Alice responds with y = 26,938 in message three. Show

that Bob again verifies Alice's response. [1 marks]

c. Determine Alice's secret S. Hint: 657- 1 = 208 mod 27,331. [3 marks]

[5 marks]

4. Give a secure two-message protocol that prevents cell phone cloning, prevents a fake

base station attack, and establishes a shared session key. Mimic the GSM protocol.

[5 marks]


Bob

x = r2 mod N

Alice e ∈ {0, 1}

Secret

S

Rd

y = r *Se mod N


版权所有:留学生编程辅导网 2020 All Rights Reserved 联系方式:QQ:99515681 微信:codinghelp 电子信箱:99515681@qq.com
免责声明:本站部分内容从网络整理而来,只供参考!如有版权问题可联系本站删除。 站长地图

python代写
微信客服:codinghelp