The paper presents a new RSA threshold signature scheme that is unforgeable and robust in the random oracle model, assuming the RSA problem is hard. The scheme features non-interactive signature share generation and verification, and the size of an individual signature share is bounded by a constant times the size of the RSA modulus. The authors also introduce a more refined notion of a threshold signature scheme with two parameters, $t$ and $k$, where $t$ is the maximum number of corrupt players and $k$ is the minimum quorum size. The scheme is designed to be simple and efficient, and it is proven secure in the random oracle model under the RSA assumption. The paper includes a detailed security analysis of the scheme, demonstrating its robustness and non-forgability properties.The paper presents a new RSA threshold signature scheme that is unforgeable and robust in the random oracle model, assuming the RSA problem is hard. The scheme features non-interactive signature share generation and verification, and the size of an individual signature share is bounded by a constant times the size of the RSA modulus. The authors also introduce a more refined notion of a threshold signature scheme with two parameters, $t$ and $k$, where $t$ is the maximum number of corrupt players and $k$ is the minimum quorum size. The scheme is designed to be simple and efficient, and it is proven secure in the random oracle model under the RSA assumption. The paper includes a detailed security analysis of the scheme, demonstrating its robustness and non-forgability properties.