An ideal and robust threshold RSA

Ghodosi, Hossein & Pieprzyk, Josef (2006) An ideal and robust threshold RSA. Lecture Notes in Computer Science : Progress in Cryptology - VIETCRYPT 2006, 4341, pp. 312-321.

View at publisher

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.

Impact and interest:

2 citations in Scopus
Search Google Scholar™

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 73484
Item Type: Journal Article
Refereed: Yes
Additional Information: Paper presented in the First International Conference on Cryptology in Vietnam, Hanoi, Vietnam, September 25-28, 2006. Print ISBN
978-3-540-68799-3
Keywords: Threshold RSA, Robust Systems, Ideal Secret Sharing Schemes
DOI: 10.1007/11958239_21
ISBN: 978-3-540-68800-6
ISSN: 1611-3349
Divisions: Current > QUT Faculties and Divisions > Science & Engineering Faculty
Deposited On: 08 Jul 2014 01:34
Last Modified: 15 Jul 2014 03:02

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page