Updatable SNARKs allow anyone to update the structured reference string (SRS), providing security as long as at least one party in the update chain is honest. However, all current known constructions rely on pairing-based cryptography, which is vulnerable to quantum attacks.
My question is: Do post-quantum updatable SNARKs exist in the literature?
I am aware that lattice-based SNARKs exist. The authors here construct updatable SNARKs using LAMASSU transformation, which relies on key homomorphic signatures but as far as I know, there is no lattice based construction of such signatures.
Other related works include:
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS
- Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings
Despite these, I have not been able to find a lattice-based (and thus plausibly post-quantum secure) construction of updatable SNARKs.
Any references, pointers, or clarifications would be highly appreciated.
