{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T04:23:10Z","timestamp":1772252590606,"version":"3.50.1"},"reference-count":26,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T00:00:00Z","timestamp":1643241600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ripple Impact Fund\/SVCF","award":["2018-188473"],"award-info":[{"award-number":["2018-188473"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>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\u2019s 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.<\/jats:p>","DOI":"10.3390\/cryptography6010006","type":"journal-article","created":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T21:59:55Z","timestamp":1643320795000},"page":"6","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Post-Quantum Two-Party Adaptor Signature Based on Coding Theory"],"prefix":"10.3390","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9231-1129","authenticated-orcid":false,"given":"Jean Belo","family":"Klamti","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON N2L 3G1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4103-7945","authenticated-orcid":false,"given":"M. Anwar","family":"Hasan","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON N2L 3G1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,1,27]]},"reference":[{"key":"ref_1","unstructured":"Network-Fast, R. (2022, January 21). Cheap, Scalable Token Transfers for Ethereum. Available online: https:\/\/raiden.network\/."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Green, M., and Miers, I. (November, January 30). Bolt: Anonymous payment channels for decentralized currencies. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA.","DOI":"10.1145\/3133956.3134093"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Malavolta, G., Moreno-Sanchez, P., Schneidewind, C., Kate, A., and Maffei, M. (2022, January 24). Anonymous Multi-Hop Locks for Blockchain Scalability and Interoperability. Available online: https:\/\/eprint.iacr.org\/2018\/472.","DOI":"10.14722\/ndss.2019.23330"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Roos, S., Moreno-Sanchez, P., Kate, A., and Goldberg, I. (2017). Settling payments fast and private: Efficient decentralized routing for path-based transactions. arXiv.","DOI":"10.14722\/ndss.2018.23252"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"107098","DOI":"10.1016\/j.comnet.2020.107098","article-title":"A Bitcoin payment network with reduced transaction fees and confirmation times","volume":"172","author":"Erdin","year":"2020","journal-title":"Comput. Netw."},{"key":"ref_6","unstructured":"Moreno-Sanchez, P., Kate, A., Maffei, M., and Pecina, K. (2015, January 8\u201311). Privacy preserving payments in credit networks. Proceedings of the Network and Distributed Security Symposium, San Diego, CA, USA."},{"key":"ref_7","unstructured":"Miller, A., Bentov, I., Kumaresan, R., and McCorry, P. (2022, January 24). Sprites: Payment Channels That Go Faster Than Lightning. Available online: https:\/\/allquantor.at\/blockchainbib\/pdf\/miller2017sprites.pdf."},{"key":"ref_8","unstructured":"Poelstra, A., and Scriptless Scripts (2021, December 14). Presentation Slides. Available online: https:\/\/download.wpsoftware.net\/bitcoin\/wizardry\/mw-slides\/2017-05-milan-meetup\/slides.pdf."},{"key":"ref_9","unstructured":"Fournier, L. (2021, December 28). One-Time Verifiably Encrypted Signatures AKA Adaptor Signatures. Available online: https:\/\/raw.githubusercontent.com\/LLFourn\/one-time-VES\/master\/main.pdf."},{"key":"ref_10","first-page":"476","article-title":"Generalized Bitcoin-Compatible Channels","volume":"2020","author":"Aumayr","year":"2020","journal-title":"Tech. Rep. Cryptol. Eprint Arch. Rep."},{"key":"ref_11","unstructured":"Dryja, T. (2021, December 28). Discreet Log Contracts. Available online: https:\/\/dci.mit.edu\/research\/smart-contracts-discrete-log-contracts."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Esgin, M.F., Ersoy, O., and Erkin, Z. (2020). Post-quantum adaptor signatures and payment channel networks. European Symposium on Research in Computer Security, Springer.","DOI":"10.1007\/978-3-030-59013-0_19"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Erwig, A., Faust, S., Host\u00e1kov\u00e1, K., Maitra, M., and Riahi, S. (2021). Two-Party Adaptor Signatures From Identification Schemes. Public Key Cryptography (1), Springer.","DOI":"10.1007\/978-3-030-75245-3_17"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Malavolta, G., Moreno-Sanchez, P., Schneidewind, C., Kate, A., and Maffei, M. (2019, January 24\u201327). Anonymous multi-hop locks for blockchain scalability and interoperability. Proceedings of the 26th Annual Network and Distributed System Security Symposium, NDSS, San Diego, CA, USA.","DOI":"10.14722\/ndss.2019.23330"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Moreno-Sanchez, P., Blue, A., Le, D.V., Noether, S., Goodell, B., and Kate, A. (2020). DLSAG: Non-interactive refund transactions for interoperable payment channels in monero. International Conference on Financial Cryptography and Data Security, Springer.","DOI":"10.1007\/978-3-030-51280-4_18"},{"key":"ref_16","first-page":"589","article-title":"A2L: Anonymous Atomic Locks for Scalability in Payment Channel Hubs","volume":"2019","author":"Tairi","year":"2019","journal-title":"Tech. Rep. Cryptol. Eprint Arch. Rep."},{"key":"ref_17","first-page":"1345","article-title":"Post-Quantum Adaptor Signature for Privacy-Preserving Off-Chain Payments","volume":"2020","author":"Tairi","year":"2020","journal-title":"Tech. Rep. Cryptol. Eprint Arch. Rep."},{"key":"ref_18","first-page":"996","article-title":"Wave: A new code-based signature scheme","volume":"2018","author":"Sendrier","year":"2018","journal-title":"Tech. Rep. Cryptol. Eprint Arch. Rep."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","article-title":"On the inherent intractability of certain coding problems (corresp.)","volume":"24","author":"Berlekamp","year":"1978","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_20","unstructured":"Debris-Alazard, T., Sendrier, N., and Tillich, J.P. (2017). The problem with the SURF scheme. arXiv."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"2669","DOI":"10.1109\/TIT.2002.802608","article-title":"On the complexity of some cryptographic problems based on the general decoding problem","volume":"48","author":"Johansson","year":"2002","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Sendrier, N. (2011). Decoding one out of many. International Workshop on Post-Quantum Cryptography, Springer.","DOI":"10.1007\/978-3-642-12929-2"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Courtois, N.T., Finiasz, M., and Sendrier, N. (2001). How to achieve a McEliece-based digital signature scheme. International Conference on the Theory and Application of Cryptology and Information Security, Springer.","DOI":"10.1007\/3-540-45682-1_10"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Dallot, L. (2007). Towards a concrete security proof of Courtois, Finiasz and Sendrier signature scheme. Western European Workshop on Research in Cryptology, Springer.","DOI":"10.1007\/978-3-540-88353-1_6"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"6830","DOI":"10.1109\/TIT.2013.2272036","article-title":"A distinguisher for high-rate McEliece cryptosystems","volume":"59","author":"Faugere","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_26","unstructured":"Banegas, G., Debris-Alazard, T., Nedeljkovi\u0107, M., and Smith, B. (2021). Wavelet: Code-based postquantum signatures with fast verification on microcontrollers. arXiv."}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/6\/1\/6\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:09:17Z","timestamp":1760134157000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/6\/1\/6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,27]]},"references-count":26,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,3]]}},"alternative-id":["cryptography6010006"],"URL":"https:\/\/doi.org\/10.3390\/cryptography6010006","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints202112.0472.v2","asserted-by":"object"},{"id-type":"doi","id":"10.20944\/preprints202112.0472.v1","asserted-by":"object"}]},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,27]]}}}