[Resource Topic] 2022/047: Short Pairing-Free Blind Signatures with Exponential Security

Welcome to the resource topic for 2022/047

Short Pairing-Free Blind Signatures with Exponential Security

Authors: Stefano Tessaro, Chenzhi Zhu


This paper proposes the first practical pairing-free three-move blind signature schemes that (1) are concurrently secure, (2) produce short signatures (i.e., three or four group elements/scalars), and (3) are provably secure either in the generic group model (GGM) or the algebraic group model (AGM) under the (plain or one-more) discrete logarithm assumption (beyond additionally assuming random oracles). We also propose a partially blind version of one of our schemes. Our schemes do not rely on the hardness of the ROS problem (which can be broken in polynomial time) or of the mROS problem (which admits sub-exponential attacks). The only prior work with these properties is Abe’s signature scheme (EUROCRYPT ’02), which was recently proved to be secure in the AGM by Kastner et al. (PKC ’22), but which also produces signatures twice as long as those from our scheme. The core of our proofs of security is a new problem, called weighted fractional ROS (WFROS), for which we prove (unconditional) exponential lower bounds.

ePrint: https://eprint.iacr.org/2022/047

Talk: https://www.youtube.com/watch?v=xBMp_gUZ_O0

Slides: https://iacr.org/submit/files/slides/2022/eurocrypt/eurocrypt2022/224/slides.pptx

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .