An ideal and robust threshold RSA
Ghodosi, Hossein, and Pieprzyk, Josef (2006) An ideal and robust threshold RSA. Proceedings of Progress in Cryptology - VIETCRYPT 2006. VIETCRYPT 2006 First International Conference on Cryptology in Vietnam , 25-28 September 2006, Hanoi, Vietnam , pp. 312-321.
![[img]](http://eprints.jcu.edu.au/style/images/fileicons/application_pdf.png) | PDF (Published Version) - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 400Kb |
DOI: 10.1007/11958239_21
View at Publisher Website: http://dx.doi.org/10.1007/11958239_21
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 log n, where n is the RSA modulus. That is, the system is ideal.
| ID Code: | 4350 |
|---|---|
| Item Type: | Conference Item (Refereed Research Paper - E1) |
| Keywords: | threshold RSA; robust systems; ideal secret sharing schemes |
| ISBN: | 978-3-540-68799-3 |
| FoR Codes: | UNSPECIFIED |
| SEO Codes: | 89 INFORMATION AND COMMUNICATION SERVICES > 8999 Other Information and Communication Services > 899999 Information and Communication Services not elsewhere classified @ 100% |
| Deposited On: | 18 Nov 2009 15:06 |
| Last Modified: | 19 May 2013 00:38 |
| Downloads: | Total: 3 Last 12 Months: 1 |
| Statistics: | More Statistics |
| Citation Counts with External Providers: | Web of Science: 0 |
Repository Staff Only: item control page