A $(t,n)-$ threshold signature scheme enables distributed signing among $n$ players such that any subgroup of size $t$ can sign, whereas any group with fewer players cannot. Our goal is to produce signatures that are compatible with an existing centralized signature scheme: the key generation and signature algorithm are replaced by a communication protocol between the parties, but the verification algorithm remains identical to that of a signature issued using the centralized algorithm. Starting from the threshold schemes for the ECDSA signature due to R. Gennaro and S. Goldfeder, we present the first protocol that supports multiparty signatures with an offline participant during the Key Generation Phase, without relying on a trusted third party. Following well-established approaches, we prove our scheme secure against adaptive malicious adversaries.

翻译：A(t,n)-美元门槛签名计划使得在一美元球员之间可以分配签名,这样任何规模的分组都可以签署美元美元,而任何球员较少的集团则不能签署。 我们的目标是产生与现有集中签名计划相容的签名:关键生成和签名算法被当事人之间的通信协议所取代,但核查算法与使用集中算法签发的签名相同。 从由R. Gennaro和S. Goldfeder提供的ECDSA签名门槛计划开始,我们将第一个协议提交支持多党签名的协议提交到关键一代阶段的离线参与者,而不必依赖信任的第三方。按照既定的方法,我们证明我们的计划对适应性恶意对手是安全的。