Paper 2024/1289
Improved Lattice Blind Signatures from Recycled Entropy
Abstract
Blind signatures represent a class of cryptographic primitives enabling privacy-preserving authentication with several applications such as e-cash or e-voting. It is still a very active area of research, in particular in the post-quantum setting where the history of blind signatures has been hectic. Although it started to shift very recently with the introduction of a few lattice-based constructions, all of the latter give up an important characteristic of blind signatures (size, efficiency, or security under well-known assumptions) to achieve the others. In this paper, we propose another design which revisits the link between the two main procedures of blind signatures, namely issuance and showing, demonstrating that we can significantly alleviate the second one by adapting the former. Concretely, we show that we can harmlessly inject excess randomness in the issuance phase, and then recycle the entropy surplus during showing to decrease the complexity of the zero-knowledge proof which constitutes the main component of the signature. This leads to a blind signature scheme with small sizes, low complexity, and that still relies on well-known lattice assumptions.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Keywords
- Lattice-Based CryptographyBlind SignaturePrivacy
- Contact author(s)
-
corentin jeudy @ orange com
olivier sanders @ orange com - History
- 2024-08-20: revised
- 2024-08-16: received
- See all versions
- Short URL
- https://ia.cr/2024/1289
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1289, author = {Corentin Jeudy and Olivier Sanders}, title = {Improved Lattice Blind Signatures from Recycled Entropy}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1289}, year = {2024}, url = {https://eprint.iacr.org/2024/1289} }