Lattice-based Blind Signatures

Author Markus Rückert

Thumbnail PDF


  • Filesize: 316 kB
  • 17 pages

Document Identifiers

Author Details

Markus Rückert

Cite AsGet BibTex

Markus Rückert. Lattice-based Blind Signatures. In Algorithms and Number Theory. Dagstuhl Seminar Proceedings, Volume 9221, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


Motivated by the need to have secure blind signatures even in the presence of quantum computers, we present two efficient blind signature schemes based on hard worst-case lattice problems. Both schemes are provably secure in the random oracle model and unconditionally blind. The first 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 identification scheme of Lyubashevsky. It is stateless, has 4 moves, and its security is based on the hardness of worst-case problems in ideal lattices.
  • Blind signatures
  • post-quantum
  • lattices
  • privacy


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail