Sciweavers

Share
ASIACRYPT
2001
Springer

Fully Distributed Threshold RSA under Standard Assumptions

10 years 1 months ago
Fully Distributed Threshold RSA under Standard Assumptions
The aim of this article is to propose a fully distributed environment for the RSA scheme. What we have in mind is highly sensitive applications and even if we are ready to pay a price in terms of efficiency, we do not want any compromise of the security assumptions that we make. Recently Shoup proposed a practical RSA threshold signature scheme that allows to share the ability to sign between a set of players. This scheme can be used for decryption as well. However, Shoup’s protocol assumes a trusted dealer to generate and distribute the keys. This comes from the fact that the scheme needs a special assumption on the RSA modulus and this kind of RSA moduli cannot be easily generated in an efficient way with many players. Of course, it is still possible to call theoretical results on multiparty computation, but we cannot hope to design efficient protocols. The only practical result to generate RSA moduli in a distributive manner is Boneh and Franklin’s protocol but it seems difficul...
Pierre-Alain Fouque, Jacques Stern
Added 28 Jul 2010
Updated 28 Jul 2010
Type Conference
Year 2001
Where ASIACRYPT
Authors Pierre-Alain Fouque, Jacques Stern
Comments (0)
books