An Ideal and Robust Threshold RSA

Hossein Ghodosi ¹

Josef Pieprzyk ²

School of Mathematics, Physics and Information Technology, James Cook University, Townsville, Australia |

Department of Computing, Center for Advanced Computing – Algorithms and Cryptography, Macquarie University, Sydney, Australia |

Publication type: Book Chapter

Publication date: 2006-01-01

Springer Nature

Journal: Lecture Notes in Computer Science

scimago Q2

SJR: 0.606

CiteScore: 2.6

Impact factor: —

ISSN: 03029743, 16113349, 18612075, 18612083

DOI: 10.1007/11958239_21

Copy DOI

Abstract

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 logn, where n is the RSA modulus. That is, the system is ideal.

By date By citations

Are you a researcher?

Create a profile to get free access to personal recommendations for colleagues and new articles.

Metrics

Cite this

GOST | RIS | BibTex

Found error?

Publisher

Springer Nature

Journal

Lecture Notes in Computer Science

scimago Q2

SJR

0.606

CiteScore

2.6

Impact factor

—

ISSN

03029743 (Print)

16113349 (Electronic)

18612075 (Print)

18612083 (Electronic)