@inproceedings{0c9bd88e698f49d79e57b54f828bff1b,
title = "An ideal and robust threshold RSA",
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.",
keywords = "Ideal secret sharing schemes, Robust systems, Threshold RSA",
author = "Hossein Ghodosi and Josef Pieprzyk",
year = "2006",
doi = "10.1007/11958239-21",
language = "English",
isbn = "3540687998",
volume = "4341 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Springer Nature",
pages = "312--321",
editor = "Nguyen, \{Phong Q.\}",
booktitle = "Progress in Cryptology, VIETCRYPT 2006 - 1st International Conference on Cryptology in Vietnam, Revised Selected Papers",
address = "United States",
note = "1st International Conference on Cryptology in Vietnam, VIETCRYPT 2006 ; Conference date: 25-09-2006 Through 28-09-2006",
}