An ideal and robust threshold RSA

Hossein Ghodosi, Josef Pieprzyk

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

2 Citations (Scopus)


We present a novel implementation of the threshold RSA. Our solution is conceptually simple, and leads to an easy design of the system. The signing key is shared in additive form, which is desirable for collaboratively performing cryptographic transformations, and its size, at all times, is log n, where n is the RSA modulus. That is, the system is ideal.

Original languageEnglish
Title of host publicationProgress in Cryptology, VIETCRYPT 2006 - 1st International Conference on Cryptology in Vietnam, Revised Selected Papers
EditorsPhong Q. Nguyen
Place of PublicationBerlin; New York
PublisherSpringer, Springer Nature
Number of pages10
Volume4341 LNCS
ISBN (Print)3540687998, 9783540687993
Publication statusPublished - 2006
Event1st International Conference on Cryptology in Vietnam, VIETCRYPT 2006 - Hanoi, Viet Nam
Duration: 25 Sept 200628 Sept 2006

Publication series

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


Other1st International Conference on Cryptology in Vietnam, VIETCRYPT 2006
Country/TerritoryViet Nam


  • Ideal secret sharing schemes
  • Robust systems
  • Threshold RSA


Dive into the research topics of 'An ideal and robust threshold RSA'. Together they form a unique fingerprint.

Cite this