Robust protocol for generating shared RSA parameters

Ari Moesriami Barmawi, Shingo Takada, Norihisa Doi

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

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages280-289
Number of pages10
Volume1746
ISBN (Print)354066887X, 9783540668879
Publication statusPublished - 1999
Event7th IMA International Conference on Cryptography and Coding, 1999 - Cirencester, United Kingdom
Duration: 1999 Dec 201999 Dec 22

Publication series

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

Other

Other7th IMA International Conference on Cryptography and Coding, 1999
CountryUnited Kingdom
CityCirencester
Period99/12/2099/12/22

Fingerprint

Network protocols
Factorization
Encryption
Cryptography
Computational complexity
Modulus
Computational Complexity
Attack

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Barmawi, A. M., Takada, S., & Doi, N. (1999). Robust protocol for generating shared RSA parameters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1746, pp. 280-289). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1746). Springer Verlag.

Robust protocol for generating shared RSA parameters. / Barmawi, Ari Moesriami; Takada, Shingo; Doi, Norihisa.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1746 Springer Verlag, 1999. p. 280-289 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1746).

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

Barmawi, AM, Takada, S & Doi, N 1999, Robust protocol for generating shared RSA parameters. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1746, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1746, Springer Verlag, pp. 280-289, 7th IMA International Conference on Cryptography and Coding, 1999, Cirencester, United Kingdom, 99/12/20.
Barmawi AM, Takada S, Doi N. Robust protocol for generating shared RSA parameters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1746. Springer Verlag. 1999. p. 280-289. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Barmawi, Ari Moesriami ; Takada, Shingo ; Doi, Norihisa. / Robust protocol for generating shared RSA parameters. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1746 Springer Verlag, 1999. pp. 280-289 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{b96ceaef3d774136878d7b0df2b89714,
title = "Robust protocol for generating shared RSA parameters",
abstract = "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.",
author = "Barmawi, {Ari Moesriami} and Shingo Takada and Norihisa Doi",
year = "1999",
language = "English",
isbn = "354066887X",
volume = "1746",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "280--289",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Robust protocol for generating shared RSA parameters

AU - Barmawi, Ari Moesriami

AU - Takada, Shingo

AU - Doi, Norihisa

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84961315440&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84961315440&partnerID=8YFLogxK

M3 - Conference contribution

SN - 354066887X

SN - 9783540668879

VL - 1746

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 280

EP - 289

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -