undefined | Better HN

0 pointspuzzledobserver6y ago0 comments

I wonder whether there is any work on plausibly deniable public key cryptography.

The sender uses the public key to encrypt the plaintext, and the receiver uses their private key to decipher the ciphertext, as usual. But, on being compelled, the receiver can also choose an arbitrary target plaintext, and efficiently compute a new private key that maps the ciphertext to the chosen target plaintext.

0 comments

dmitrygr6y ago

Take a look at this: https://en.wikipedia.org/wiki/Off-the-Record_Messaging

It is designed for that, and more. In fact, it does not leave the theoretical "anyone could fake the logs", they created a tool to do so, so that you do not need an expert witness to explain to court that someone could doctor the logs - a tool exists for it. On purpose. They call it Deniable authentication:

> Messages in a conversation do not have digital signatures, and after a conversation is complete, anyone is able to forge a message to appear to have come from one of the participants in the conversation, assuring that it is impossible to prove that a specific message came from a specific person. Within the conversation the recipient can be sure that a message is coming from the person they have identified.

j / k navigate · click thread line to collapse

0 pointspuzzledobserver6y ago0 comments

I wonder whether there is any work on plausibly deniable public key cryptography.

0 comments

dmitrygr6y ago

Take a look at this: https://en.wikipedia.org/wiki/Off-the-Record_Messaging

j / k navigate · click thread line to collapse