Re:Verkle Trees
by dandanua on Saturday June 19, 2021 @01:44AM
(#27558105)
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.
[ Parent
| on HN ]
That'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.
Re:Verkle Trees
by Ar-Curunir on Saturday June 19, 2021 @12:02PM
(#27561652)
If 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
Re:Verkle Trees
by Ar-Curunir on Saturday June 19, 2021 @05:31AM
(#27559123)
It’s not necessarily; you can use a polynomial commitment based on postquantum assumptions, like lattices