4 ms·
It's good that he noted that this scheme is insecure against quantum computers. Anyway, homomorphic cryptography is a fascinating field with many cool applicati
by dandanua 5y ago
It's good that he noted that this scheme is insecure against quantum computers. Anyway, homomorphic cryptography is a fascinating field with many cool applications. I'm sure the ideas will remain useful even in the quantum era.
- Ar-Curunir 5y agoIt’s not necessarily; you can use a polynomial commitment based on postquantum assumptions, like lattices
- mratsim 5y agoThat's because it's polynomial commitment based on pairing-based cryptography (elliptic curves) but there are schemes based on hash functions (FRI) that are quantum secure. The main advantage of pairings is that you can have constant-size commitments. 28:47 - https://www.youtube.com/watch?v=bz16BURH_u8 https://www.youtube.com/watch?v=bz16BURH_u8
- Ar-Curunir 5y agoIf you’re using FRI then you have Merkle trees again :P There’s no space or computation savings when using FRI for the PC scheme here