An efficient threshold RSA digital signature scheme

摘要

This study focuses on the two main issues related to threshold RSA signature schemes: (1) resisting conspiracy attack and (2) efficiently solving the “interpolation over ring Zϕ(n)” problem. In particular, no efficient solution currently exists to the problem of conspiracy attacks.This study presents a new threshold RSA signature scheme. This scheme prevents conspiracy attacks by controlling the right to issuing the signature on behalf of the group; and the problem of “interpolation over Zϕ(n)” is efficiently solved by introducing a technique for converting the structure of Lagrange interpolation from the ring Zϕ(n) into a prime field Zr.