Article
Version 2
Preserved in Portico This version is not peer-reviewed
Post-Quantum Two-party Adaptor Signature Based on Coding Theory
Version 1
: Received: 29 December 2021 / Approved: 29 December 2021 / Online: 29 December 2021 (16:08:47 CET)
Version 2 : Received: 30 December 2021 / Approved: 31 December 2021 / Online: 31 December 2021 (11:46:58 CET)
Version 2 : Received: 30 December 2021 / Approved: 31 December 2021 / Online: 31 December 2021 (11:46:58 CET)
A peer-reviewed article of this Preprint also exists.
Klamti, J.B.; Hasan, M.A. Post-Quantum Two-Party Adaptor Signature Based on Coding Theory. Cryptography 2022, 6, 6. Klamti, J.B.; Hasan, M.A. Post-Quantum Two-Party Adaptor Signature Based on Coding Theory. Cryptography 2022, 6, 6.
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 create additional adaptor signatures without the original secret. Adaptor signatures help address scalability and interoperabity issues in blockchain. They can also bring some important advantages to cryptocurrencies, such as low on-chain cost, improved transaction fungibility, and less 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.
Keywords
Post-quantum cryptography; Blockchain; Code-based cryptography; Adaptor signature; Scriptless scripts.
Subject
Computer Science and Mathematics, Information Systems
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (1)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
Commenter: Jean Belo KLAMTI
Commenter's Conflict of Interests: Author
2- On page 10, Table 1 the value of \lambda should be 128 instead of 12 and that of t should be 12 instead of 128