Paper 2025/1771
Batched & Non-interactive Blind Signatures from Lattices
Abstract
Non-interactive blind signatures (NIBS; Eurocrypt '23) allow a signer to asynchronously generate presignatures for a recipient, ensuring that only the intended recipient can extract a "blinded" signature for a random message. We introduce a new generalization called non-interactive batched blind signatures (NIBBS). Our goal is to reduce the computation and communication costs for signers and receivers, by batching multiple blind signature queries. More precisely, we define the property of 'succinct communication' which requires that the communication cost from signer to receiver be independent of the batch size. NIBBS is very suitable for large-scale deployments requiring only minimal signer-side effort. We design a NIBBS scheme and prove its security based on the hardness of lattice assumptions (in the random oracle model). When instantiated with the low-depth PRF candidate "Crypto Dark Matter" (TCC '18) and the succinct lattice-based proof system for rank-1 constraint systems (Crypto '23), our final signature size is 308 KB with <1 KB communication.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- A major revision of an IACR publication in PKC 2026
- Keywords
- blind signaturesnon-interactive protocolsbatched protocolslattice-based cryptography
- Contact author(s)
-
foteini @ gmu edu
rishab @ cs wisc edu
ayadav5 @ gmu edu - History
- 2026-02-27: last of 2 revisions
- 2025-09-28: received
- See all versions
- Short URL
- https://ia.cr/2025/1771
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/1771,
author = {Foteini Baldimtsi and Rishab Goyal and Aayush Yadav},
title = {Batched & Non-interactive Blind Signatures from Lattices},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/1771},
year = {2025},
url = {https://eprint.iacr.org/2025/1771}
}
