An ideal and robust threshold RSA

Authors:
Hossein Ghodosi;Josef Pieprzyk
Affiliations:
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
Venue:
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Year:
2006

Citing 14
Cited 1

How to share a function securely

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
How to share a secret

Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Society and Group Oriented Cryptography: A New Concept

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Threshold Cryptosystems

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Shared Generation of Authenticators and Signatures (Extended Abstract)

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Robust and Efficient Sharing of RSA Functions

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Proactive RSA

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Efficient Generation of Shared RSA Keys (Extended Abstract)

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A Simplified Approach to Threshold and Proactive RSA

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Treshold Cryptosystems (invited talk)

ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Optimal-resilience proactive public-key cryptosystems

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Practical threshold signatures

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Efficient threshold RSA signatures with general moduli and no extra assumptions

PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography

Secure and practical threshold RSA

Proceedings of the 6th International Conference on Security of Information and Networks

Quantified Score

Hi-index	0.00

Visualization

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.