Sciweavers

Share
ICICS
2001
Springer

Threshold Undeniable RSA Signature Scheme

10 years 6 months ago
Threshold Undeniable RSA Signature Scheme
Undeniable signature has been extensively researched after Chaum and Antwerpen first proposed the concept of this special digital signature ten years ago. Up to now, however, almost all the existed schemes are based on discrete logarithm cryptosystems. In this paper, based on an improvement of the practical threshold RSA signature scheme proposed by Shoup at Eurocrypt’2000 and the first undeniable RSA signature scheme proposed by Gennaro, Krawczyk and Rabin at Crypto’97, we present the first, as we know, threshold undeniable RSA signature scheme. Our scheme is secure and robust since all the partial signatures are verifiable by adopting a discrete logarithm equality protocol proposed by Shoup.
Guilin Wang, Sihan Qing, Mingsheng Wang, Zhanfei Z
Added 29 Jul 2010
Updated 29 Jul 2010
Type Conference
Year 2001
Where ICICS
Authors Guilin Wang, Sihan Qing, Mingsheng Wang, Zhanfei Zhou
Comments (0)
books