Hilariously written and genuinely high quality information.<p>Too many cryptography tutorials start by rehearsing the precise definition of a group, and formulas for elliptic curve arithmetic etc. only to conclude with like two paragraphs on the actual crypto. It's pretty refreshing to see things like "How points addition + is defined is not our concern, what we care is that (E, +) forms a group" lmao because that's exactly right.
Skimming through, this it seems exactly like what I’m looking for.<p>I’d love to also see aggregate Schnorr signatures/public keys covered. <i>EDIT: Never mind. This seems to be covered by “ 8.1 Secure multi-party Schnorr signature computation”.</i><p>Also, I recently discovered “incremental hashing” which I think is super fascinating: <a href="https://twitter.com/runeksvendsen/status/1471217421457502213?s=21" rel="nofollow">https://twitter.com/runeksvendsen/status/1471217421457502213...</a>. This may be a good addition as well.
This is one of the most fun papers I've read in a while. I won't spoil anything; sit down with it when you have time and be prepared to laugh a bit.
I'd love to see some discussion about ring learning with errors (RLWE). It can have similar applications with oblivious transfer (which is covered) but in a recent work meeting my colleagues found RLWE to be more suitable for the particular problem we were solving.