A blind signature scheme based on ElGamal signature
A blind signature scheme based on ElGamal signature
复制标题
DOI：
10.1109/nrsc.2000.838954
复制
发表时间：
2000-02
期刊：
影响因子：
--
通讯作者：
E. Mohammed;E. Emarah;K. El-Shennawy
中科院分区：
文献类型：
--
作者：
E. Mohammed;E. Emarah;K. El-Shennawy
公钥密码系统的使用受到了相当大的关注。它们在加密和签名方面是有益的，这在电子银行和金融交易中起着至关重要的作用。本文在ElGamal（1985）签名的基础上提出了一种新的广义盲签名方案。这个新方案有一个很有价值的特性，它保证了如果一个消息被多次签名，对应的签名将是不同的。这增加了盲签名的匿名性。新方案使用数论运算和模运算技术来实现预期的目标。目前的研究介绍了一个广义的签名方案，可以用来生成盲签名以及普通的ElGamal签名。发现新方案与RSA盲法相当。此外，新方案具有计算复杂度低，盲过程比RSA更快的优点。
The use of public key cryptosystems has received considerable attention. They are beneficial in encryption as well as signing which plays an essential role in electronic banking and financial transactions. This paper presents a new generalized blind signature scheme based on ElGamal (1985) signatures. This new scheme has a valuable property that assures that if a message is signed multiple times, the corresponding signatures will be different. This adds to the anonymity of the blind signatures. The new scheme uses number theory operations and modular arithmetic techniques to achieve the desired goal. The current research introduces a generalized signature scheme that could be used to generate blind signatures as well as ordinary ElGamal signatures. The new scheme is found to be comparable to the RSA blinding. Moreover, the new scheme has the advantage of having less computational complexity and is faster than RSA in the blinding procedure.