{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T22:23:54Z","timestamp":1782426234150,"version":"3.54.5"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T00:00:00Z","timestamp":1734652800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T00:00:00Z","timestamp":1734652800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172411, 62172404, 61972094 and 62202458"],"award-info":[{"award-number":["62172411, 62172404, 61972094 and 62202458"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The non-transferability of a designated confirmer signature scheme allows a signer to control the verification ability of a signature, hence protecting the signer\u2019s privacy. However, a designated confirmer signature is insufficient when the secret keys are damaged and incapable of collaborative signature generation. In this paper, we circumvent these limitations by introducing the notion of designated confirmer threshold signature. First, we present a formal security model, then give a generic construction, which utilizes threshold signature schemes, encryption schemes and <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\Sigma$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03a3<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-protocols. Instantiating this generic construction, we have two specific schemes, based on threshold Schnorr and threshold ECDSA, respectively. We further design two efficient <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\Sigma$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03a3<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-protocols for efficient proofs. We also implement these schemes, and the experiment results show that our schemes are practical with rich functionalities. Finally, we demonstrate interesting applications for blockchains, such as verifiable asset auctions in blockchain and traditional electronic bidding.<\/jats:p>","DOI":"10.1186\/s42400-024-00256-2","type":"journal-article","created":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T00:01:58Z","timestamp":1734652918000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Designated confirmer threshold signature and its applications in blockchains"],"prefix":"10.1186","volume":"7","author":[{"given":"Yunfeng","family":"Ji","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Tao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Birou","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,20]]},"reference":[{"key":"#cr-split#-256_CR1.1","doi-asserted-by":"crossref","unstructured":"Bendlin R, Krehbiel S, Peikert C (2013) How to share a lattice trapdoor: threshold protocols for signatures and","DOI":"10.1007\/978-3-642-38980-1_14"},{"key":"#cr-split#-256_CR1.2","unstructured":"(h) IBE. In: ACNS 2013. LNCS, vol 7954. Springer, pp 218-236"},{"key":"256_CR2","doi-asserted-by":"crossref","unstructured":"Camenisch J, Michels M (2000) Confirmer signature schemes secure against adaptive adversaries. In: EUROCRYPT 2000. LNCS, vol 1807. Springer, pp 243\u2013258","DOI":"10.1007\/3-540-45539-6_17"},{"key":"256_CR3","doi-asserted-by":"crossref","unstructured":"Canetti R, Gennaro R, Goldfeder S, Makriyannis N, Peled U (2020) UC non-interactive, proactive, threshold ECDSA with identifiable aborts. In: CCS 2020, pp 1769\u20131787","DOI":"10.1145\/3372297.3423367"},{"key":"256_CR7","doi-asserted-by":"crossref","unstructured":"Castagnos G, Laguillaumie F (2015) Linearly homomorphic encryption from. In: CT-RSA. LNCS, vol 9048. Springer, pp 487\u2013505","DOI":"10.1007\/978-3-319-16715-2_26"},{"key":"256_CR8","doi-asserted-by":"crossref","unstructured":"Castagnos G, Laguillaumie F, Tucker I (2018) Practical fully secure unrestricted inner product functional encryption modulo p. In: ASIACRYPT 2018. LNCS, vol 11273. Springer, pp 733\u2013764","DOI":"10.1007\/978-3-030-03329-3_25"},{"key":"256_CR5","doi-asserted-by":"crossref","unstructured":"Castagnos G, Catalano D, Laguillaumie F, Savasta F, Tucker I (2019) Two-party ECDSA from hash proof systems and efficient instantiations. In: CRYPTO 2019. LNCS, vol 11694. Springer, pp 191\u2013221","DOI":"10.1007\/978-3-030-26954-8_7"},{"key":"256_CR6","doi-asserted-by":"crossref","unstructured":"Castagnos G, Catalano D, Laguillaumie F, Savasta F, Tucker I (2020) Bandwidth-efficient threshold EC-DSA. In: PKC 2020. LNCS, vol 12111. Springer, pp 266\u2013296","DOI":"10.1007\/978-3-030-45388-6_10"},{"key":"256_CR4","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.tcs.2022.10.016","volume":"939","author":"G Castagnos","year":"2023","unstructured":"Castagnos G, Catalano D, Laguillaumie F, Savasta F, Tucker I (2023) Bandwidth-efficient threshold EC-DSA revisited: online\/offline extensions, identifiable aborts proactive and adaptive security. Theor Comput Sci 939:78\u2013104","journal-title":"Theor Comput Sci"},{"key":"256_CR9","doi-asserted-by":"crossref","unstructured":"Chaum D (1994) Designated confirmer signatures. In: EUROCRYPT 1994. LNCS, vol 950. Springer, pp 86\u201391","DOI":"10.1007\/BFb0053427"},{"key":"256_CR10","doi-asserted-by":"crossref","unstructured":"Chaum D, Van\u00a0Antwerpen H (1990) Undeniable signatures. In: CRYPTO 1989. LNCS, vol 435. Springer, pp 212\u2013216","DOI":"10.1007\/0-387-34805-0_20"},{"key":"256_CR11","doi-asserted-by":"crossref","unstructured":"Chu H, Gerhart P, Ruffing T, Schr\u00f6der D (2023) Practical Schnorr threshold signatures without the algebraic group model. In: CRYPTO 2023. Springer, pp 743\u2013773","DOI":"10.1007\/978-3-031-38557-5_24"},{"key":"256_CR12","doi-asserted-by":"crossref","unstructured":"Crites E, Komlo C, Maller M (2023) Fully adaptive schnorr threshold signatures. In: CRYPTO 2023. Springer, pp 678\u2013709","DOI":"10.1007\/978-3-031-38557-5_22"},{"issue":"2","key":"256_CR13","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s00145-022-09425-3","volume":"35","author":"I Damg\u00e5rd","year":"2022","unstructured":"Damg\u00e5rd I, Orlandi C, Takahashi A, Tibouchi M (2022) Two-round n-out-of-n and multi-signatures and trapdoor commitment from lattices. J Cryptol 35(2):14","journal-title":"J Cryptol"},{"key":"256_CR14","doi-asserted-by":"crossref","unstructured":"Desmedt Y, Frankel Y (1991) Shared generation of authenticators and signatures. In: CRYPTO 1991. LNCS, vol 576. Springer, pp 457\u2013469","DOI":"10.1007\/3-540-46766-1_37"},{"key":"256_CR15","doi-asserted-by":"crossref","unstructured":"Fiat A, Shamir A (1986) How to prove yourself: practical solutions to identification and signature problems. In: CRYPTO 1986. LNCS, vol 86. Springer, pp 186\u2013194","DOI":"10.1007\/3-540-47721-7_12"},{"key":"256_CR16","doi-asserted-by":"crossref","unstructured":"Garillot F, Kondi Y, Mohassel P, Nikolaenko V (2021) Threshold Schnorr with stateless deterministic signing from standard assumptions. In: CRYPTO 2021. Springer, pp 127\u2013156","DOI":"10.1007\/978-3-030-84242-0_6"},{"key":"256_CR17","doi-asserted-by":"crossref","unstructured":"Gennaro R, Goldfeder S (2018) Fast multiparty threshold ECDSA with fast trustless setup. In: CCS 2018, pp 1179\u20131194","DOI":"10.1145\/3243734.3243859"},{"key":"256_CR18","doi-asserted-by":"crossref","unstructured":"Goldwasser S, Waisbard E (2004) Transformation of digital signature schemes into designated confirmer signature schemes. In: TCC 2004. LNCS, vol 2951. Springer, pp 77\u2013100","DOI":"10.1007\/978-3-540-24638-1_5"},{"key":"256_CR19","doi-asserted-by":"crossref","unstructured":"Guo Y, Xu M, Yu D, Yu Y, Ranjan R, Cheng X (2023) Cross-channel: Scalable off-chain channels supporting fair and atomic cross-chain operations. IEEE Trans Comput","DOI":"10.1109\/TC.2023.3288765"},{"key":"256_CR20","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.ins.2012.11.022","volume":"228","author":"Q Huang","year":"2013","unstructured":"Huang Q, Wong DS, Susilo W (2013) The construction of ambiguous optimistic fair exchange from designated confirmer signature without random oracles. Inf Sci 228:222\u2013238","journal-title":"Inf Sci"},{"key":"256_CR21","doi-asserted-by":"crossref","unstructured":"Jakobsson M, Sako K, Impagliazzo R (1996) Designated verifier proofs and their applications. In: EUROCRYPT 1996. LNCS, vol 1070. Springer, pp 143\u2013154","DOI":"10.1007\/3-540-68339-9_13"},{"key":"256_CR22","doi-asserted-by":"crossref","unstructured":"Komlo C, Goldberg I (2021) Frost: flexible round-optimized Schnorr threshold signatures. In: SAC 2020. LNCS, vol 12804. Springer, pp 34\u201365","DOI":"10.1007\/978-3-030-81652-0_2"},{"key":"256_CR23","doi-asserted-by":"crossref","unstructured":"Madathil V, Thyagarajan SA, Vasilopoulos D, Fournier L, Malavolta G, Moreno-Sanchez P (2022) Cryptographic oracle-based conditional payments. NDSS 2022","DOI":"10.14722\/ndss.2023.24024"},{"key":"256_CR24","doi-asserted-by":"crossref","unstructured":"Okamoto T (1994) Designated confirmer signatures and public-key encryption are equivalent. In: CRYPTO 1994. LNCS, vol 839. Springer, pp 61\u201374","DOI":"10.1007\/3-540-48658-5_8"},{"key":"256_CR25","doi-asserted-by":"crossref","unstructured":"Ruffing T, Ronge V, Jin E, Schneider-Bensch J, Schr\u00f6der D (2022) Roast: robust asynchronous Schnorr threshold signatures. In: CCS 2022, pp 2551\u20132564","DOI":"10.1145\/3548606.3560583"},{"key":"256_CR26","doi-asserted-by":"crossref","unstructured":"Wikstr\u00f6m D (2007) Designated confirmer signatures revisited. In: TCC 2007. LNCS, vol 4392. Springer, pp 342\u2013361","DOI":"10.1007\/978-3-540-70936-7_19"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00256-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-024-00256-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00256-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T01:03:25Z","timestamp":1734656605000},"score":1,"resource":{"primary":{"URL":"https:\/\/cybersecurity.springeropen.com\/articles\/10.1186\/s42400-024-00256-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,20]]},"references-count":27,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["256"],"URL":"https:\/\/doi.org\/10.1186\/s42400-024-00256-2","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,20]]},"assertion":[{"value":"24 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"67"}}