Robust protocol for generating shared RSA parameters

Ari Moesriami Barmawi, Shingo Takada, Norihisa Doi

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

This paper describes how n parties can jointly generate the parameters for the RSA encryption system while being robust to prevent attacks from cheaters and malicious parties. The proposed protocol generates a public modulus number, without the parties knowing the factorization of that number. Our proposed protocol is similar to that of Boneh-Franklin's protocol. However, when there are two communicating parties our proposed protocol does not need the help of a third party. By using our proposed protocol, we can detect the presence of malicious parties and cheaters among the authorized user. An analysis shows that our proposed protocol has less computational complexity than the protocol of Frankel-MacKenzie-Yung.

本文言語English
ホスト出版物のタイトルCryptography and Coding - 7th IMA International Conference, Proceedings
編集者Michael Walker
出版社Springer Verlag
ページ280-289
ページ数10
ISBN(印刷版)354066887X, 9783540668879
出版ステータスPublished - 1999 1 1
イベント7th IMA International Conference on Cryptography and Coding, 1999 - Cirencester, United Kingdom
継続期間: 1999 12 201999 12 22

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1746
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other7th IMA International Conference on Cryptography and Coding, 1999
国/地域United Kingdom
CityCirencester
Period99/12/2099/12/22

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Robust protocol for generating shared RSA parameters」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル