Robust protocol for generating shared RSA parameters

Ari Moesriami Barmawi; Shingo Takada; Norihisa Doi

Robust protocol for generating shared RSA parameters

Ari Moesriami Barmawi, Shingo Takada, Norihisa Doi

Department of Information and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Cryptography and Coding - 7th IMA International Conference, Proceedings
Editors	Michael Walker
Publisher	Springer Verlag
Pages	280-289
Number of pages	10
ISBN (Print)	354066887X, 9783540668879
Publication status	Published - 1999
Event	7th IMA International Conference on Cryptography and Coding, 1999 - Cirencester, United Kingdom Duration: 1999 Dec 20 → 1999 Dec 22

Publication series

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

Other

Other	7th IMA International Conference on Cryptography and Coding, 1999
Country/Territory	United Kingdom
City	Cirencester
Period	99/12/20 → 99/12/22

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Cite this

Barmawi, A. M., Takada, S., & Doi, N. (1999). Robust protocol for generating shared RSA parameters. In M. Walker (Ed.), Cryptography and Coding - 7th IMA International Conference, Proceedings (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.
Cryptography and Coding - 7th IMA International Conference, Proceedings. ed. / Michael Walker. 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 proceeding › Conference contribution

Barmawi, AM, Takada, S & Doi, N 1999, Robust protocol for generating shared RSA parameters. in M Walker (ed.), Cryptography and Coding - 7th IMA International Conference, Proceedings. 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, Ari Moesriami ; Takada, Shingo ; Doi, Norihisa. / Robust protocol for generating shared RSA parameters. Cryptography and Coding - 7th IMA International Conference, Proceedings. editor / Michael Walker. 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",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 7th IMA International Conference on Cryptography and Coding, 1999 ; Conference date: 20-12-1999 Through 22-12-1999",

year = "1999",

language = "English",

isbn = "354066887X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "280--289",

editor = "Michael Walker",

booktitle = "Cryptography and Coding - 7th IMA International Conference, Proceedings",

}

TY - GEN

T1 - Robust protocol for generating shared RSA parameters

AU - Barmawi, Ari Moesriami

AU - Takada, Shingo

AU - Doi, Norihisa

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1999.

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

AN - SCOPUS:84961315440

SN - 354066887X

SN - 9783540668879

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

SP - 280

EP - 289

BT - Cryptography and Coding - 7th IMA International Conference, Proceedings

A2 - Walker, Michael

PB - Springer Verlag

T2 - 7th IMA International Conference on Cryptography and Coding, 1999

Y2 - 20 December 1999 through 22 December 1999

ER -

Robust protocol for generating shared RSA parameters

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this