A new approach to robust threshold RSA signature schemes

Rei Safavi-Naini, Huaxiong Wang, Kwok Yan Lam

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

4 Citations (Scopus)


In a threshold RSA signature scheme, dishonest participants can disrupt signature generation by submitting junk instead of their partial signatures. A threshold signature system is robust if it allows generation of correct signatures for a group of t honest participants, and in the presence of malicious participants. The purpose of this paper is two-fold. First we show that a robust (t, n) threshold RSA signature scheme, proposed by Rabin in Crypto'98, lacks an essential property of (t, n) threshold schemes and allows an adversary to forge signatures. Then we propose a new approach to the construction of t-robust (t, n) threshold RSA signature scheme which can be seen as the dual to Rabin's approach. We discuss the efficiency of our system and show that when t is small (compared to n) our scheme is much more efficient than other existing schemes.

Original languageEnglish
Title of host publicationInformation Security and Cryptology - ICISC 1999 - 2nd International Conference, Proceedings
Place of PublicationBerlin; Heidelberg
PublisherSpringer, Springer Nature
Number of pages13
ISBN (Print)3540673806, 9783540673804
Publication statusPublished - 2000
Event2nd International Conference on Information Security and Cryptology, ICISC 1999 - Seoul, Korea, Republic of
Duration: 9 Dec 199910 Dec 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)03029743
ISSN (Electronic)16113349


Other2nd International Conference on Information Security and Cryptology, ICISC 1999
Country/TerritoryKorea, Republic of


Dive into the research topics of 'A new approach to robust threshold RSA signature schemes'. Together they form a unique fingerprint.

Cite this