Don't like ads? PRO users don't see any ads ;-)
Public Pastes
Guest

Untitled

By: a guest on Aug 21st, 2012  |  syntax: None  |  size: 0.80 KB  |  hits: 22  |  expires: Never
download  |  raw  |  embed  |  report abuse  |  print
Text below is selected. Please press Ctrl+C to copy to your clipboard. (⌘+C on Mac)
  1. Let us suppose I have a secret m1 and a plausible innocent secret m2. Is there an encryption algorithm which takes m1 and m2 and combines them with 2 public keys e1 and e2 into a ciphertext c such that when a publicly known decryption algorithm is used on c with private key d1, m1 is returned, but if d2 is used instead, m2 is returned, but without knowing the encryption algorithm used it must be plausible that there is only 1 hidden message? ie:D(E(m1,m2,e1,e2),dk)=mkk∈{1,2}
  2. I am thinking it would require a pair of one-way trapdoor functions mingled together somehow so that it would be difficult to compute dk from ek. But I also have no idea how to make it plausible that there is only 1 possible d (assuming the ENcryption algorithm is unknown to the enemy).
  3. [3:27:16 AM] Devon Corey: algorithm in the middle
create a new version of this paste RAW Paste Data