Scribd Logo
Upload

Welcome to Scribd!

  • Eesition: Security

    Uploaded by

    lokesh chikkula
    6 views4 pages
    1. The document discusses the security of a pseudorandom function F. 2. It states that if F is a pseudorandom function, then it is indistinguishable under chosen plaintext attack (IND CPA) secure with a key of length N. 3. It also states that an efficient adversary D cannot distinguish F from a truly random function with more than a negligible advantage, even after making a polynomial number of queries.

    Original Description:

    Original Title

    FOC Lecture 7

    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
    1. The document discusses the security of a pseudorandom function F. 2. It states that if F is a pseudorandom function, then it is indistinguishable under chosen plaintext attack (IND CPA) secure with a key of length N. 3. It also states that an efficient adversary D cannot distinguish F from a truly random function with more than a negligible advantage, even after making a polynomial number of queries.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views4 pages

    Eesition: Security

    Uploaded by

    lokesh chikkula
    1. The document discusses the security of a pseudorandom function F. 2. It states that if F is a pseudorandom function, then it is indistinguishable under chosen plaintext attack (IND CPA) secure with a key of length N. 3. It also states that an efficient adversary D cannot distinguish F from a truly random function with more than a negligible advantage, even after making a polynomial number of queries.

    Copyright:

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

    272021

    01
    Lecture
    ICA security

    a I
    k Gene
    m
    Imol lmil mo
    be 0,13

    em b b

    Fk 013 10.13

    EEsition r 0,13
    ME 01

    4
    Enc Kim
    C LI ELEM
    Decek 1 o to S
    M FK
    F is PRF IND CPA secure SKE
    If a then it is
    with length N
    message

    F is PRF IT is IND CPA secure

    f is PRF
    It is EPA secure

    F PPT A against IT F PPT D against F


    in the cpa game
    PRF 9am
    I China cpa S
    gp2
    É ri on

    i I ÉÉ
    a

    D
    on
    Cr myOY b

    T.peyyCb
    m simulate enc.ae
    t
    How to Simulate challenge query

    Runs in II
    tim
    D is efficient
    II
    vi
    giantng
    Fk t
    i4
    Id
    ftp Iyiimf
    g
    PrivkCIII
    Pr DEE P

    I
    I
    Dt in I Pr Priv kitten
    P I
    am
    I II e
    er firs
    Pr Priv KIF in
    É mi Omi
    gg
    ELA
    nit
    are dit
    fer an ye
    feri
    If ri o
    mi mt fe.at
    fort
    P Private ima

    P I avg.IQ 1 RepeatJ.PrIRebeatJt
    Pr Repeat
    P I n I Repeat

    t
    BIElrep
    Efferent

    Po Repeat P IT'Repesti IBERIA


    No of queries
    EEE
    91h

    TREE
    3 In challenge say

    there is collision with


    ith query a

    9 10
    P Pair
    att Cms I
    44 D FYI Pr Dt 7,29
    IT is IND CPA secure

    You might also like