Efficient Dealer-Less Threshold Sharing of Standard RSA
In an efficient two-party, two-prime RSA function sharing protocol was proposed. The protocol proves efficiency over previously proposed protocols. When the sharing of standard RSA is considered, the protocol is faster than ever. In this paper, under the assumption that the adversary has eavesdropping and halting capabilities, the authors propose an efficient extension to the protocol. Their protocol enjoys the following properties (some of which are inherit from) the protocol is fully distributed (i.e. does not require an honest dealer).