Three-Move Blind Signatures in Pairing-Free Groups

Yanbo Chen

Paper 2026/593

Three-Move Blind Signatures in Pairing-Free Groups

Yanbo Chen

, University of Ottawa

Abstract

We propose the first blind signature scheme that simultaneously achieves the following properties: - It uses a pairing-free group and random oracles in a black-box manner; - It provably achieves concurrent security based on standard assumptions (DDH) without the algebraic group model (AGM); - It requires only three moves. Moreover, the public key, signature, and communication of our scheme all consist of only a constant number of group/field elements. Prior to our work, black-box, three-move pairing-free schemes were only known in the AGM. A recent line of work proposed and optimized schemes without the AGM, but they all require at least four moves.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: A major revision of an IACR publication in CRYPTO 2026
Keywords: Blind signature Pairing-free
Contact author(s): ychen918 @ uottawa ca
History: 2026-06-07: revised; 2026-03-25: received; See all versions
Short URL: https://ia.cr/2026/593
License: CC BY-NC-ND

BibTeX

@misc{cryptoeprint:2026/593,
      author = {Yanbo Chen},
      title = {Three-Move Blind Signatures in Pairing-Free Groups},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/593},
      year = {2026},
      url = {https://eprint.iacr.org/2026/593}
}