Netw1002: Computer security

TUTORIAL 4: PERFECT SECRECY

•

•
•
𝑃 𝐵 𝐴 ∗𝑃 𝐴
P AB
𝑃 𝐵

•
•

≠
•
•
•

•
• 
• 
• 
•

•
P 𝑘𝑒𝑦 k
| |
  𝐶 𝑒 𝑥
 𝐶 𝑒 𝑥
 𝐶 𝑒 𝑥

p C L M A ∗p M A p K ∗p M A
P M A C L
p C L p C L

𝟏 𝟏
p C L M A 𝐩 𝐤𝟏 , 𝒑 𝐌 𝐀
𝟑 𝟑
𝟏
𝒑 𝐂 𝑳 p k ∗p M A p k ∗p M 𝐵 p k ∗p M 𝐶 ∗ ∗ ∗
𝟑

∗
∴P M A C L

• p 𝐌 A C L p 𝐌 A
•
≤
cm ∗

| ∗

≠
 𝑐 𝑒 𝑚
𝑐 𝑒 𝑚
𝑝 𝑘𝑒𝑦 𝑘 𝑝𝑟𝑜𝑏𝑎𝑏𝑖𝑙𝑖𝑡𝑦 𝑡𝑜 𝑐ℎ𝑜𝑜𝑠𝑒 𝑘𝑒𝑦
𝑝 𝑘𝑒𝑦 𝑘 𝑝𝑟𝑜𝑏𝑎𝑏𝑖𝑙𝑖𝑡𝑦 𝑡𝑜 𝑐ℎ𝑜𝑜𝑠𝑒 𝑘𝑒𝑦
𝑝 𝑀 𝑚 𝑝𝑟𝑜𝑏𝑎𝑏𝑖𝑙𝑖𝑡𝑦 𝑜𝑓 𝑐ℎ𝑜𝑜𝑠𝑖𝑛𝑔 𝑜𝑛𝑒 𝑚𝑒𝑠𝑠𝑎𝑔𝑒
 p k p k
𝑐
p M m 𝑐

|
p M 00 C 00
1 1 1
p C 00 𝑀 00 p k p k 1 , p M 00
2 2 4
1 1 1 1 1
p C 00 p k ∗p M 00 p k2 ∗ p M 00 ∗ ∗
2 4 2 4 4
∗ .
p M 00 C 00
.
𝟏
• 𝐩 𝐌 𝟎𝟎 𝐂 𝟎𝟎 𝐩 𝐦 𝟎𝟎
𝟒

•
• α β α β
• α β
• 𝑐 𝑒 𝑚
𝑐 𝑒 𝑚
 α

𝑝 𝑐 0|𝑀 α ∗ 𝑝 𝑀 α p k ∗p M α
α
p c 0 p c 0
1 1 p
p k ∗p M α ∗ p ∗ p
2 2 2 p
p k ∗p M α p k ∗p M β 1 1 p 1 p 1
∗ p 1 p
2 2 2 2 2 2
α p M α) = p
Then: Case 1 is verified
 β
| β ∗ β ∗ β ∗ β
β
∗ β ∗ α
∗ ∗ ∗
1 p
∗ ∗

• β β 1 p
•
 α
| α α ∗ α ∗ α
α
∗ β ∗ α
∗ ∗ ∗
p
∗ ∗

• α α p
•
 β
| β β ∗ β ∗ β
β
∗ α ∗ β
∗ ∗ ∗
1 p
∗ ∗

• β β 1 p
•
 α β
• α β
• α β 𝑐 𝑒 𝑚
• 𝑐 𝑒 𝑚
 α
| α α ∗ α ∗ α
α
∗ α ∗ α
∗ ∗
∗ ∗

α α