Scribd Logo
Upload

Welcome to Scribd!

  • Pifor: PRG Given

    Uploaded by

    lokesh chikkula
    18 views9 pages
    The document discusses using a pseudorandom function (PRF) to construct an indistinguishable under chosen plaintext attack (IND-CPA) secure symmetric key encryption (SKE) scheme for fixed length messages. It states that if F is a PRF, then the construction where a random key K is generated, messages are encrypted as Enc(M)=F_K(M), and decrypted as Dec(C)=F_K^{-1}(C) is IND-CPA secure for fixed length messages. The security relies on the PRF being pseudorandom.

    Original Description:

    Original Title

    FOC Lecture 6

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses using a pseudorandom function (PRF) to construct an indistinguishable under chosen plaintext attack (IND-CPA) secure symmetric key encryption (SKE) scheme for fixed length messages. It states that if F is a PRF, then the construction where a random key K is generated, messages are encrypted as Enc(M)=F_K(M), and decrypted as Dec(C)=F_K^{-1}(C) is IND-CPA secure for fixed length messages. The security relies on the PRF being pseudorandom.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    18 views9 pages

    Pifor: PRG Given

    Uploaded by

    lokesh chikkula
    The document discusses using a pseudorandom function (PRF) to construct an indistinguishable under chosen plaintext attack (IND-CPA) secure symmetric key encryption (SKE) scheme for fixed length messages. It states that if F is a PRF, then the construction where a random key K is generated, messages are encrypted as Enc(M)=F_K(M), and decrypted as Dec(C)=F_K^{-1}(C) is IND-CPA secure for fixed length messages. The security relies on the PRF being pseudorandom.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 9

    25 01

    Lecture 2022
    IND EAV
    PRG IT using PRG

    gÉÉ
    it is
    FG is PRG then

    Enc Scheme
    fixed length
    exists
    PRG exists given Of

    Reduction
    is ppg IT is IND EAV
    g
    F PPT A against IT F PIFor G
    IND Eav games
    Gcs

    c PRG 11 YEE
    Game
    2Foy time
    ite
    Igerseantynotions
    Security for Multiple Encryption
    eivk I
    still
    be 0
    É GenCin
    ME to Di Mo t

    in Mit

    Hi Git Enck Mbi I


    T
    b b Priv k my n I
    If

    EAV
    Gen Enc Dec Is this malt IND
    iii
    T Q
    Gen K E 0113 secure
    Enc É G Ck m

    NI

    scheme
    one time encryption
    G Sto
    É Ey
    mo mo
    Emo in

    C GCk Mb
    trice
    a ez old
    e a Otp I

    It Enc is
    Iterating it's me ciphertext

    achieve
    then not possible to
    _ÉAvsec
    We need probabilistic Enc
    IT GGen Enc Dec

    I en

    reamed
    YÉÉ É
    É
    be 0,1 mo.m.to

    b b
    A wins if
    neg lens
    Pr Priv n I 3
    ka
    I Z
    This is not Necessary
    any of
    m
    on
    It can query
    its choice Even on MI
    LR CPA
    Priv K
    Mi mi

    Agt gift Inca


    IIIT att
    b b A wins
    CPA
    Po Priv KIR n I I neglen
    AA

    If b L Rk UP ENCK Moi

    Enck Mi i
    by
    LR CPA equivalent to CPA
    L

    ifixed lengthmsg
    IT which is cpa secure for
    n
    msgs
    MAEKE
    ConstructionofIND

    in
    in

    keyed faction
    IT length preserving
    91 o when
    Fk output
    wok l key Input
    Funen

    ya
    Fred D
    oight f 0,13 0.1

    I
    distinguish
    Not be able to
    Pseudorandom
    then F to be
    define Fk
    2
    IFmen 2
    2M
    PRI at F on x on Is on be
    an efficient length preserving faction F

    F is Pseudorandom Tf
    H PPT D F neg
    n 7

    I
    In 1 BIq
    ftp 22

    If a b Fisa Fk Y

    fans far

    example Fk G If IM
    E
    ÉLE
    1 EEE Adv
    owned
    L 3010 for
    1
    WT Ik ca a Feeny a an

    word for a fear He 022 n


    tix atty 2
    CII PRP
    PRIE a 0113
    Permutation
    one to one or
    f 0,135gal
    t

    te Perm

    Perman 2

    IP IDF In D

    p Dfe in if snegeal an

    Free is efficiently Computable


    StrongPRI n n
    Ficy
    CLA PRP

    t.is
    1

    Block cipher
    e

    Gen Cin K 0,13

    ERM
    me on
    ID on

    G LI FKA Q M

    DecCE C LI
    M
    FEI
    M
    Fk er QS

    Q2
    IFE

    PRF then T is a
    M F is a
    Jf length n
    CPA secure SKE for messages of

    You might also like