Matthew Green on Nostr: The second reason this is hard is that to prove security of encryption, we ...
The second reason this is hard is that to prove security of encryption, we “reduce” (A) the existence of an adversary that can break encryption to (B) solving a hard problem. But this reduction only works when it *doesn’t* know the secret key, otherwise the adversary adds nothing.
Published at
2023-11-12 18:36:37Event JSON
{
"id": "0433b050295bab4c63b2166d0a7efbe4ba39792a721dd33ff75c9f58dd66b6db",
"pubkey": "5c06f588380197da5dfbe2e32928b9b6d82c62dac0c602535a09ee1cad5a8221",
"created_at": 1699814197,
"kind": 1,
"tags": [
[
"e",
"4ad0511d77eb9ba2cd30e040fa7c19f8c5241ca01ed1bcc639837864de98743a",
"wss://relay.mostr.pub",
"reply"
],
[
"proxy",
"https://ioc.exchange/users/matthew_d_green/statuses/111399023255198039",
"activitypub"
]
],
"content": "The second reason this is hard is that to prove security of encryption, we “reduce” (A) the existence of an adversary that can break encryption to (B) solving a hard problem. But this reduction only works when it *doesn’t* know the secret key, otherwise the adversary adds nothing.",
"sig": "f0a6ea994e6137136ace2fbc480158d189d27d4f8f4935e2417e2599bafe17da05456d6a3551f5143c8b2d40160f2ba3547b375023b2adf7dd96223fccee627b"
}
