Cryptology ePrint Archive: Report 2008/322

Efficient Post-quantum Blind Signatures

Markus Rückert

Abstract: We present the first efficient post-quantum blind signature scheme. Our scheme is provably secure in the random oracle model, unconditionally blind, and round-optimal. We propose it as a replacement for current blind signature schemes for the post-quantum era. Its basis of security is a problem related to finding short vectors in a lattice.

Category / Keywords: Post-quantum cryptography, blind signatures, lattices

Date: received 25 Jul 2008, last revised 9 Feb 2009

Contact author: rueckert at cdc informatik tu-darmstadt de

Available formats: PDF | BibTeX Citation

Note: The scheme needed a stronger assumption to be provably one-more unforgeable.

Version: 20090209:115641 (All versions of this report)

Discussion forum: Show discussion | Start new discussion