Paper 2022/006
Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures
Vadim Lyubashevsky, Ngoc Khanh Nguyen, and Maxime Plancon
Abstract
Lattice-based blind signature schemes have been receiving some recent attention lately. Earlier efficient 3-round schemes (Asiacrypt 2010, Financial Cryptography 2020) were recently shown to have mistakes in their proofs, and fixing them turned out to be extremely inefficient and limited the number of signatures that a signer could send to less than a dozen (Crypto 2020). In this work we propose a round-optimal, 2-round lattice-based blind signature scheme which produces signatures of length 150KB. The running time of the signing protocol is linear in the maximum number signatures that can be given out, and this limits the number of signatures that can be signed per public key. Nevertheless, the scheme is still quite efficient when the number of signatures is limited to a few dozen thousand, and appears to currently be the most efficient lattice-based candidate.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- A major revision of an IACR publication in PKC 2022
- Keywords
- blind signatureslattices
- Contact author(s)
-
vadim lyubash @ gmail com
nkn @ zurich ibm com
mpl @ zurich ibm com - History
- 2022-01-07: received
- Short URL
- https://ia.cr/2022/006
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/006,
author = {Vadim Lyubashevsky and Ngoc Khanh Nguyen and Maxime Plancon},
title = {Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/006},
year = {2022},
url = {https://eprint.iacr.org/2022/006}
}