International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Practical Round-Optimal Blind Signatures in the ROM from Standard Assumptions

Authors:
Shuichi Katsumata , PQShield and AIST, Japan
Michael Reichle , ETH Zürich, Switzerland
Yusuke Sakai , AIST, Japan
Download:
Search ePrint
Search Google
Presentation: Slides
Conference: ASIACRYPT 2023
Abstract: Blind signatures serve as a foundational tool for privacy-preserving applications and have recently seen renewed interest due to new applications in blockchains and privacy-authentication tokens. With this, constructing practical round-optimal (i.e., signing consists of the minimum two rounds) blind signatures in the random oracle model (ROM) has been an active area of research, where several impossibility results indicate that either the ROM or a trusted setup is inherent. In this work, we present two round-optimal blind signatures under standard assumptions in the ROM with different approaches: one achieves the smallest sum of the signature and communication sizes, while the other achieves the smallest signature size. Both of our instantiations are based on standard assumptions over asymmetric pairing groups, i.e., CDH, DDH, and/or SXDH. Our first construction is a highly optimized variant of the generic blind signature construction by Fischlin (CRYPTO’06) and has signature and communication sizes 447 B and 303 B, respectively. We progressively weaken the building blocks required by Fischlin and we result in the first blind signature where the sum of the signature and communication sizes fit below 1 KB based on standard assumptions. Our second construction is a semi-generic construction from a specific class of randomizable signature schemes that admits an all-but-one reduction. The signature size is only 96 B while the communication size is 2.2 KB. This matches the previously known smallest signature size while improving the communication size by several orders of magnitude. Finally, both of our constructions rely on a (non-black box) fine-grained analysis of the forking lemma that may be of independent interest.
BibTeX
@inproceedings{asiacrypt-2023-33391,
  title={Practical Round-Optimal Blind Signatures in the ROM from Standard Assumptions},
  publisher={Springer-Verlag},
  author={Shuichi Katsumata and Michael Reichle and Yusuke Sakai},
  year=2023
}