protocols part 1 - symmetric key Flashcards

(16 cards)

1
Q

what does A -> b: ‘Im alice’ mean

A

alice is sending a message ‘im Alice’ to bob

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

what type of attack can happen to a simple protocol

A

impersonation attack
E(A) -> B : ‘im Alice’

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

what is an impersonation attack

A

adversary is impersonating one of the people that is is the messaging
to trick the other person

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

how to get pass an impersonation attack

A

use encryption
e.g symmteric key encryption

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

notation for symmetric key encyption in protocols

A

{}k_ab
k_ab -> shared symmetric key

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

what attack could happen to simple symmetric key encryption protocol

A

replay attack

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

what is a replay attack

A

a sends message to b
A -> B : {msg}kab
adversary hears message and then sends the same message to b
E(A) -> B : {msg}kab

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

replay attack notation

A

E(A) -> B : {msg}kab

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

how can we stop a replay attack

A

use a nonce

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

what is a nonce

A

randomly generated number that ia only used once

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

when is a nonce often used

A

for a challenge response protocol in a challenge response setting

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

protocol steps for nonce symmetric key protocol

A
  1. A →B : A
    a sends message/identity to b
  2. B →A : {Na}Kab
    b sends encrypted nonce -> challenge response protocol
  3. A →B : {Na +1}Kab , {Pay Elvis 5}Kab
    a decrypts nonce to prove it is them , modifies nonce by doing something arithmetic , sends modified nonce back encrypted and also encrypted message
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

what attack is nonce protocol susceptible to

A

man in the middle attack

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

describe man in the middle attack to nonce protocol

A

(also known as reflection attack?)
1. A →B : A
2. B →A : {Na1}Kab
3. A →B : {Na1 +1}Kab , {Pay Elvis
5}Kab
4. A →B : A
5. B →A : {Na2}Kab
6. E →B : {Na2 +1}Kab , {Pay Elvis 5}Kab
elvis listens , tajes new nonce, joins with previous message and sends it to bob

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

how to stop man in the middle attack in nonce protocol

A

merge nonce and message together into one encryption
1. A →B : A
2. B →A : {Na}K_ab
3. A →B : {Na, Pay Elvis 5}K_ab
therefore adversary cannot edit the message

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q
  1. A →B : A
  2. B →A : {Na}K_ab
  3. A →B : {Na, Pay Elvis 5}K_ab
    through this what can bob be sure of ?
A

he is talking to alice
A wants to send elvise £5
a messages are fresh