Post-Quantum Two-Party Adaptor Signature Based on Coding Theory

Abstract

An adaptor signature can be viewed as a signature concealed with a secret value and, by design, any two of the trio yield the other. In a multiparty setting, an initial adaptor signature allows each party to create additional adaptor signatures without the original secret. Adaptor signatures help address scalability and interoperability issues in blockchain. They can also bring some important advantages to cryptocurrencies, such as low on-chain cost, improved transaction fungibility, and fewer limitations of a blockchain’s scripting language. In this paper, we propose a new two-party adaptor signature scheme that relies on quantum-safe hard problems in coding theory. The proposed scheme uses a hash-and-sign code-based signature scheme introduced by Debris-Alazard et al. and a code-based hard relation defined from the well-known syndrome decoding problem. To achieve all the basic properties of adaptor signatures formalized by Aumayr et al., we introduce further modifications to the aforementioned signature scheme. We also give a security analysis of our scheme and its application to the atomic swap. After providing a set of parameters for our scheme, we show that it has the smallest pre-signature size compared to existing post-quantum adaptor signatures.

Two-Party Adaptor Signature Scheme Based on IEEE P1363 Identity-Based Signature

“…Then Erwig et al [11] gave the definition of two-party adaptor signatures, and showed a generic way to construct adaptor signature schemes with identification schemes. Klamti et al [18] constructed a two-party adaptor signature scheme, which is built with code theory, thus has a huge costs of computation and big pre-signature size.…”