matt on Nostr: In a two party mutual-authentication protocol, should I have O(N^2) CPU + O(N^2) ...
In a two party mutual-authentication protocol, should I have
O(N^2) CPU + O(N^2) communication and if one side doesn’t trust the other neither learns anything or,
O(N^2) CPU + O(1) communication and if one side doesn’t trust the other they may still learn that the other side trusts them?
Published at
2024-01-12 22:07:39Event JSON
{
"id": "ed169ee4bb6e113a319efbcc2ad5eaf01c43904fc8da480f92fd4040bfbadaca",
"pubkey": "3d2e51508699f98f0f2bdbe7a45b673c687fe6420f466dc296d90b908d51d594",
"created_at": 1705097259,
"kind": 1,
"tags": [],
"content": "In a two party mutual-authentication protocol, should I have\n\nO(N^2) CPU + O(N^2) communication and if one side doesn’t trust the other neither learns anything or,\n\nO(N^2) CPU + O(1) communication and if one side doesn’t trust the other they may still learn that the other side trusts them?",
"sig": "9d6a93ca37f1f76715b796070dcd91fd23e2cb2d4b921da04bffca0f22163de3e6e2494b0190d83bc2a42d8ff0bcb3f70fca2e9e03bc1398d47c79d3b82cc3df"
}
