Short Pairing-Free Blind Signatures with Exponential Security
Short Pairing-Free Blind Signatures with Exponential Security
复制标题
DOI：
10.1007/978-3-031-07085-3_27
复制
发表时间：
2022
期刊：
影响因子：
--
通讯作者：
Stefano Tessaro;Chenzhi Zhu
中科院分区：
文献类型：
--
作者：
Stefano Tessaro;Chenzhi Zhu
本文提出了第一个实用的无配对三步盲签名方案，该方案（1）是同时安全的，（2）产生短签名（即，（3）在一般群模型（GGM）或代数群模型（AGM）中，在离散对数假设（普通或一个以上）下（除了额外假设随机预言机）是可证明安全的。我们还提出了一个部分盲的版本，我们的方案不依赖于ROS问题（可以在多项式时间内被打破）或mROS问题（允许亚指数攻击）的硬度。唯一的先前工作与这些属性是安倍晋三的签名方案（EUROPENTPT '02），这是最近被证明是安全的，在AGM的Kastner等人。（PKC '22），但也产生签名的两倍，从我们的scheme.The我们的安全性证明的核心是一个新的问题，称为weightedfractionalROS（WFROS），我们证明（无条件）指数下界。
This paper proposes the first practical pairing-free three-move blind signature schemes that (1) are concurrently secure, (2) produce short signatures (i.e.,threeorfourgroup 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, calledweightedfractionalROS (WFROS), for which we prove (unconditional) exponential lower bounds.