Slide 1

Slide 1 text

Special Topics in Cryptography Mohammad Mahmoody

Slide 2

Slide 2 text

Cryptography’s main goals

Slide 3

Slide 3 text

Secure communication

Slide 4

Slide 4 text

Historic Ciphers

Slide 5

Slide 5 text

Privacy / confidentiality

Slide 6

Slide 6 text

Integrity / Authentication

Slide 7

Slide 7 text

Integrity / Authentication

Slide 8

Slide 8 text

Not loosing in chess to the grand master

Slide 9

Slide 9 text

Tool: Pseudorandom (number) generators

Slide 10

Slide 10 text

Public Key Encryption Revolution (70’s)

Slide 11

Slide 11 text

Four main problems in cryptographic

Slide 12

Slide 12 text

Main tool for public-key cryptography: Number theory and structured mathematics

Slide 13

Slide 13 text

Beyond Encryption and Authentication

Slide 14

Slide 14 text

Multi-party Computation

Slide 15

Slide 15 text

Yao’s Billionaires Problem

Slide 16

Slide 16 text

Poker over the phone

Slide 17

Slide 17 text

Generalization: multi-party computation

Slide 18

Slide 18 text

Multiparty consensus mechanisms (and block-chain protocols …)

Slide 19

Slide 19 text

Weird useful tool: Zero Knowledge Proofs

Slide 20

Slide 20 text

More powerful forms of Encryption

Slide 21

Slide 21 text

Homomorphic Encryption

Slide 22

Slide 22 text

Searchable Encryption

Slide 23

Slide 23 text

And many more…

Slide 24

Slide 24 text

No content

Slide 25

Slide 25 text

Encryption : Perfect secrecy and its limitations

Slide 26

Slide 26 text

No content

Slide 27

Slide 27 text

Chapters 1-2 of Katz-Lindell book • Steganography and why it is not a good idea • Defining Perfect Secrecy • Problems with perfect secrecy

Slide 28

Slide 28 text

Setting for private-key encryption schemes • Alice and Bob share some “secret information” in advance • They want to communicate a new message secretly. • The communication happens in public.

Slide 29

Slide 29 text

Steganography • Art of concealing the message in “innocent-looking” messages.

Slide 30

Slide 30 text

Steganography • Even the algorithm used by Alice and Bob is hidden… • When is it useful? • What is wrong with it?

Slide 31

Slide 31 text

Kerckhoffs's principle

Slide 32

Slide 32 text

Caesar cipher (weak variant) • the th letter is substituted with ( + ) th letter. • Is it secure?

Slide 33

Slide 33 text

Caesar Cipher (strong variant) • Secret key: a random permutation over all letters. • Key size: log 26! > 88 bits • Is it now secure?