Lattice-based Blind Signatures | Preliminary Version |
Markus Rückert · 2009
Motivated by the need to have secure blind signatures even in the presence of quantum computers, we present two ecient blind signa- ture schemes based on hard worst-case lattice problems. Both schemes are provably secure in the random oracle model and unconditionally blind. The rst scheme is based on preimage samplable functions that were introduced at STOC 2008 by Gentry, Peikert, and Vaikuntanathan. The scheme is stateful and runs in 3 moves. The second scheme builds upon the PKC 2008 identication scheme of Lyubashevsky. It is state- less, has 4 moves, and its security is based on the hardness of worst-case problems in ideal lattices.