Timeline for How do signatures or MACs achieve authenticity, integrity or non-repudiation？
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2020 at 1:39 | comment | added | DannyNiu | @TeamBright "How can we prove or guarantee" - through simple reasoning of course. If you firmly question such reasoning, I'll be glad if you can demonstrate its flaw, empirically, logically, or by citing a reference. | |
| Apr 10, 2020 at 12:50 | comment | added | Blanco | But the security game only captures the unforgeability, which means that a unforgeabe signature/MAC may not achieve other properties. How can we prove or guarantee that a unforgeabe signature/MAC also achieves other 3/2 properties. | |
| Apr 10, 2020 at 10:48 | comment | added | DannyNiu | I mean forgery is often the cheapest aspect of a signature/MAC to attack. A signature/MAC has to achieve all of the 3/2 properties to be unforgeable. | |
| Apr 10, 2020 at 5:35 | comment | added | Blanco | Do you mean that the unforgeability is the weakest one? As you say, if a signature/MAC is not unforgeability (someone has the ability to forge it), then it cannot achieve any one of other 3 properties. In other words, if it achieves any one of these 3 properiies, the it also achieves unforgeability. | |
| Apr 9, 2020 at 2:56 | history | answered | DannyNiu | CC BY-SA 4.0 |