17 01

Lecture 2021

tasty get secrecy Information

theoretically
IND EAV

OTP Senne Against 9

Unbounded Adversaries
Limitations

at mini

Eh I
Em 1 im
be on
KEK
Cb Mb k
I
f
m Mr Me
ki ka ke

11C
computationally
landscape ink
SKE

j
CSI

Encodes Deck
t
PRG IBE ABE
PRF
OWF FAE FE
For all practical purposes
amount of information to
leaks tiny
a Bounded Adversary
80 PT to
Scheme 2 leak some info
It which runs for 100 years

Security Gurantees Aganist Effent

A
Adversaries

very Small
probability
It succeeds with
Concrete Approach
t E secure if Any A runs for
Probability t
time t sued with

in Practice
Imp
Difficult
Sec Param
I
Asymptotic Approach
It runs in Poly 2

mega Ca
Efficient Adversary
An E on

A n terminates in Pliny
steps
121 7 Size of the input
Po poly
Negligible success probability

Teg f lit Rt A poly p

I NTI no

fast
if
Alternet f is negligible
T
E IN F no E IN
H e
e

t n no fan s n

n M ta
2 n
E 2
Reposition

is negligible inn
If fans gen
then hens fan t g en
hen is also negligible in N

FL fan s n
G
n
of
h
gen m n ng

9
thenyfn nsn hn

Max Cmf Ng

nege
I Home work
ten fan
pity is also
nee
template
A scheme is seeing if tPPT

Carrying out HII the probability of

Formally in that Attack
A succeeds

is
negligible

necessity of Relation
i

2 pm

given E M

M
A Private Key Ene

IT Gen Enc Dec

k Gen in 114 n

c Enc CK m

m Dec Ck C

t
Correctness pm e on Tk
m M
Deck Enck

fixed length Private key Enc

la
M E o i
 in the presence of an
t
Indistinguishability
Eavesdropper Ciphertext only attack

IND
EAI
a
ringing
Mo Mi 7
Gen in É imotim
be 0,1

Cb Enck mb

It wins if b b

PrivkEIT
EAV secure if
Tif IND

ameImT
HPPT FY.
Equivalent formulation
Dec IND EAV
T Chen Ene
7
if f PPT A I negeen 011

1
1
n
Pr Out Birk

P Jota Priv
kg n
11 1 Eneseen
 individual
Ciphertext leak no info about
bits of the plaintext

Mt IT Gen Enc Dee be a IND EAV secure

fixed length SKE with me 0,13

Then A PPT at and i e i l
there I negl n 7

Pr ACT Enck m mi I negle