Thread: Perfect Secrecy

    #1
  1. No Profile Picture
    Registered User
    Devshed Newbie (0 - 499 posts)

    Join Date
    Oct 2012
    Posts
    1
    Rep Power
    0

    Perfect Secrecy


    I'm not sure where to start this problem:
    Consider the following definition of perfect secrecy for the en- cryption of two messages. An encryption scheme (Gen, Enc, Dec) over a message space M is perfectly-secret for two messages if for all distributions over M, all m,m′ ∈M, and all c,c′ ∈C with Pr[C=c∧C′ =c′]>0:
    Pr[M=m∧M′ =m′ |C=c∧C′ =c′]=Pr[M=m∧M′ =m′ |M̸=M′],
    where m and m′ are sampled independently from the same distribution over M. Show an encryption scheme that provably satisfies this definition. How long are the keys in terms of the length of a message?
    Hint. The encryption scheme you propose need not be “efficient”.
    ANY help would be great!
  2. #2
  3. No Profile Picture
    Lost in code
    Devshed Supreme Being (6500+ posts)

    Join Date
    Dec 2004
    Posts
    8,317
    Rep Power
    7170
    Google "perfect secrecy" and click on the first result (it should be a Wikipedia page).
    PHP FAQ

    Originally Posted by Spad
    Ah USB, the only rectangular connector where you have to make 3 attempts before you get it the right way around
  4. #3
  5. Contributing User
    Devshed Newbie (0 - 499 posts)

    Join Date
    Oct 2012
    Location
    Buenos Aires, Argentina
    Posts
    64
    Rep Power
    2

    Thumbs up


    Ever tried to read Paul Syverson's books?

    Or Roger Dingledine's.

IMN logo majestic logo threadwatch logo seochat tools logo