Improved Online/Offline Signature Schemes
Improved Online/Offline Signature Schemes
复制标题
DOI：
10.1007/3-540-44647-8_21
复制
发表时间：
2001-08
期刊：
影响因子：
--
通讯作者：
A. Shamir;Y. Kalai
中科院分区：
文献类型：
--
作者：
A. Shamir;Y. Kalai
在线/离线签名方案的概念是由Even，Goldreich和Micali在1990年提出的。他们提出了一种将任何签名方案转换为在线/离线签名方案的通用方法，但他们的方法不是很实用，因为它将每个签名的长度增加了二次因子。在本文中，我们使用最近引入的陷门散列函数的概念，开发一个新的范例，称为散列符号开关，它可以转换成一个高效的在线/离线签名方案的任何签名方案：在其推荐的实现，在线的复杂性相当于约0.1模乘法，每个签名的大小仅增加了一个因素的两倍。另外，新的签名方案只对签名者离线选择的随机字符串进行签名，从而提高了原签名方案的安全性。这使得转换后的方案安全的自适应选择的消息攻击，即使原来的计划是安全的，只有对一般的选择的消息攻击或对随机消息攻击。
The notion of on-line/off-line signature schemes was introduced in 1990 by Even, Goldreich and Micali. They presented a general method for converting any signature scheme into an on-line/off-line signature scheme, but their method is not very practical as it increases the length of each signature by a quadratic factor. In this paper we use the recently introduced notion of a trapdoor hash function to develop a new paradigm calledhash-sign-switch, which can convert any signature scheme into a highly efficient on-line/off-line signature scheme: In its recommended implementation, the on-line complexity is equivalent to about 0.1 modular multiplications, and the size of each signature increases only by a factor of two. In addition, the new paradigm enhances the security of the original signature scheme since it is only used to sign random strings chosen off-line by the signer. This makes the converted scheme secure against adaptive chosen message attacks even if the original scheme is secure only against generic chosen message attacks or against random message attacks.