Timeline for Simplified universal composability (SUC): can I model the use of encryption? Can I prove fairness?
Current License: CC BY-SA 3.0
4 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Nov 10, 2016 at 3:50 | history | edited | Mikero | CC BY-SA 3.0 |
added 5 characters in body
|
Nov 10, 2016 at 2:34 | comment | added | Mikero | No, encryption and signatures are really no problem. Literally <0.1% of papers I've seen use the UC functionality to define security of encryption. They all use the standard game-based definitions. So using encryption in a protocol will be exactly the same in SUC as in full UC. | |
Nov 10, 2016 at 0:54 | comment | added | jeff | I understand what you mean -- and so basically SUC/UC would not be the best option for a protocol where lots of encryption (sometimes homomorphic) and signatures are used. Right? | |
Nov 9, 2016 at 23:20 | history | answered | Mikero | CC BY-SA 3.0 |