On threshold RSA-signing with no dealer

Shingo Miyazaki, Kouichi Sakurai, Moti Yung

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)


We consider methods for threshold RSA decryption among distributed agencies without any dealer or trusted party. We present two methods: One is based on the previous two techniques by [FMY98] and [FGMY97]. It demonstrates the feasibility of combining the distributed key generation and the RSA secure function application. The other method [MS99] is newly developed technique based on [FMY98] and further inspired by Simmons’ protocol-failure of RSA (we believe that it is very interesting that a “protocol failure attack” be turned into a constructive method!). The latter requires less “distributed computation” as the key is being set up and it can be more smoothly incorporated into the existing distributed key generation techniques.

Original languageEnglish
Title of host publicationInformation Security and Cryptology - ICISC 1999 - 2nd International Conference, Proceedings
EditorsJooSeok Song
PublisherSpringer Verlag
Number of pages11
ISBN (Print)3540673806, 9783540673804
Publication statusPublished - 2000
Event2nd International Conference on Information Security and Cryptology, ICISC 1999 - Seoul, Korea, Republic of
Duration: Dec 9 1999Dec 10 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


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

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'On threshold RSA-signing with no dealer'. Together they form a unique fingerprint.

Cite this