
Revisiting Lattice-based Blind Signatures Again
This IACR ePrint paper by Yi-Fu Lai and Yu Yu breaks the blindness property of a lattice-based blind signature scheme presented at Crypto 2020, which uses a linear hash function framework instantiated over lattices. The authors first identify an overlooked bug in the scheme's original blindness security proof, then construct a concrete attack under an honest-key, honest-but-curious signer model by exploiting correlations between leaves of the scheme's tree structure, and discuss how the construction can be repaired.
TL;DR Cryptanalysis breaks the blindness proof of a Crypto 2020 lattice-based blind signature scheme and proposes a fix.
Organisations named here
- Crypto 2020
- Yi-Fu Lai
- Yu Yu
Technologies named here
- Lattice-based blind signature scheme
Techniques named here
- Blindness-breaking attack via leaf correlations
Related in other

Rerandomizable Garbling for Arithmetic Circuits

