# 04 - Perfect Introduction Security Cryptography and...

This preview shows pages 1–5. Sign up to view the full content.

Introduction Perfect Security Cryptography and Protocols Andrei Bulatov

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Cryptography and Protocols – Perfect Security 5-2 Symmetric Encryption Scheme A symmetric encryption scheme is a triple of algorithms (K,E,D) - K keys generation - E encryption algorithm - D decryption algorithm For simplicity assume that k K uniformly at random, or plaintext In general, E (and possibly D) are randomized l k } 1 , 0 { l U k m P } 1 , 0 { C P E E k m l = × ) ( | } 1 , 0 { } 1 , 0 { } 1 , 0 { : * P C D D k m l = × ) ( | } 1 , 0 { } 1 , 0 { } 1 , 0 { : *
Cryptography and Protocols – Perfect Security 5-3 Perfect Security Let (K,E,D) be a symmetric encryption scheme. It is said to be perfectly secure if for any two plaintexts and a ciphertext C where the probability is over the random choice k K, and also over the coins flipped by E ], ) ( Pr[ ] ) ( Pr[ 2 1 C P E C P E k k = = = 2 1 , P P

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Cryptography and Protocols – Perfect Security 5-4 Security as a Game We assume that Eve is almighty Game - Alice chooses a key k - Eve chooses 2 plaintexts and gives them to Alice
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 03/05/2012 for the course CMPT 404 taught by Professor Andreia.bulatov during the Spring '12 term at Simon Fraser.

### Page1 / 8

04 - Perfect Introduction Security Cryptography and...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online