Open Access
Open access
Lecture Notes in Computer Science, pages 312-321

An Ideal and Robust Threshold RSA

Publication type: Book Chapter
Publication date: 2006-01-01
Q2
SJR: 0.606
CiteScore: 2.6
Impact factor: —
ISSN: 03029743, 16113349, 18612075, 18612083
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.
Found 
Found 
  • We do not take into account publications without a DOI.
  • Statistics recalculated only for publications connected to researchers, organizations and labs registered on the platform.
  • Statistics recalculated weekly.

Are you a researcher?

Create a profile to get free access to personal recommendations for colleagues and new articles.
Metrics
Share
Cite this
GOST |
Cite this
GOST Copy
Ghodosi H., Pieprzyk J. An Ideal and Robust Threshold RSA // Lecture Notes in Computer Science. 2006. pp. 312-321.
GOST all authors (up to 50) Copy
Ghodosi H., Pieprzyk J. An Ideal and Robust Threshold RSA // Lecture Notes in Computer Science. 2006. pp. 312-321.
RIS |
Cite this
RIS Copy
TY - GENERIC
DO - 10.1007/11958239_21
UR - https://doi.org/10.1007/11958239_21
TI - An Ideal and Robust Threshold RSA
T2 - Lecture Notes in Computer Science
AU - Ghodosi, Hossein
AU - Pieprzyk, Josef
PY - 2006
DA - 2006/01/01
PB - Springer Nature
SP - 312-321
SN - 0302-9743
SN - 1611-3349
SN - 1861-2075
SN - 1861-2083
ER -
BibTex
Cite this
BibTex (up to 50 authors) Copy
@incollection{2006_Ghodosi,
author = {Hossein Ghodosi and Josef Pieprzyk},
title = {An Ideal and Robust Threshold RSA},
publisher = {Springer Nature},
year = {2006},
pages = {312--321},
month = {jan}
}
Found error?