区块链上的密钥-签名紧致多重签名:一个实现的加密器
Key-and-Signature Compact Multi-Signatures for Blockchain: A Compiler with Realizations
摘要:
多重签名是一种协议,其中一组签名共同签署消息,使得最终签名比将单个签名连接在一起要短得多。最近,它在区块链中找到了应用,其中多个用户希望通过多重签名共同授权支付。然而,在这种设置中,没有集中的权威机构,它可能会遭受流氓密钥攻击,攻击者可以任意生成自己的密钥。此外,为了最小化区块链上的存储,期望聚合公钥和聚合签名都尽可能短。在本文中,我们找到一个编译器,转换一种身份(ID)计划(我们称之为线性ID)的多重签名,使聚合公钥和聚合签名的大小独立于签名者的数量。我们的编译器是可证明安全的。我们的结果的优点是,我们减少了多方问题的弱安全的两方问题。我们用两种ID方案实现了我们的编译器。第一个是Schnorr ID,第二个是一个新的基于格的ID方案,该方案通过编译器给出了第一个基于格的多重签名方案,该方案在签名过程中不需要重启,并且密钥和签名是紧致的。
英文摘要:
Multi-signature is a protocol where a set of signatures jointly sign a message so that the final signature is significantly shorter than concatenating individual signatures together. Recently, it finds applications in blockchain, where several users want to jointly authorize a payment through a multi-signature. However, in this setting, there is no centralized authority and it could suffer from a rogue key attack where the attacker can generate his own keys arbitrarily. Further, to minimize the storage on blockchain, it is desired that the aggregated public-key and the aggregated signature are both as short as possible. In this paper, we find a compiler that converts a kind of identification (ID) scheme (which we call a linear ID) to a multi-signature so that both the aggregated public-key and the aggregated signature have a size independent of the number of signers. Our compiler is provably secure. The advantage of our results is that we reduce a multi-party problem to a weakly secure two-party problem. We realize our compiler with two ID schemes. The first is Schnorr ID. The second is a new lattice-based ID scheme, which via our compiler gives the first regular lattice-based multi-signature scheme with key-and-signature compact without a restart during signing process.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。