{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T09:11:51Z","timestamp":1790154711167,"version":"4.0.1"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819257362","type":"print"},{"value":"9789819257379","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T00:00:00Z","timestamp":1790208000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T00:00:00Z","timestamp":1790208000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-981-92-5737-9_14","type":"book-chapter","created":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T08:55:44Z","timestamp":1790153744000},"page":"278-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Privacy-Preserving Multi-signatures: Achieving Transcript-Aware Privacy"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0237-4519","authenticated-orcid":false,"given":"Yanzibo","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6939-7710","authenticated-orcid":false,"given":"Fuchun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1562-5105","authenticated-orcid":false,"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9351-2800","authenticated-orcid":false,"given":"Nan","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,9,24]]},"reference":[{"issue":"9","key":"14_CR1","doi-asserted-by":"publisher","first-page":"2139","DOI":"10.1007\/s10623-019-00608-x","volume":"87","author":"G Maxwell","year":"2019","unstructured":"Maxwell, G., Poelstra, A., Seurin, Y., Wuille, P.: Simple Schnorr multi-signatures with applications to bitcoin. Des. Codes Crypt. 87(9), 2139\u20132164 (2019)","journal-title":"Des. Codes Crypt."},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-030-84242-0_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"J Nick","year":"2021","unstructured":"Nick, J., Ruffing, T., Seurin, Y.: MuSig2: simple two-round Schnorr multi-signatures. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 189\u2013221. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_8"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/978-3-030-92068-5_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"M Bellare","year":"2021","unstructured":"Bellare, M., Dai, W.: Chain reductions for\u00a0multi-signatures and\u00a0the\u00a0HBMS scheme. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13093, pp. 650\u2013678. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_22"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-031-30589-4_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2023","author":"S Tessaro","year":"2023","unstructured":"Tessaro, S., Zhu, C.: Threshold and multi-signature schemes from linear hash functions. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14008, pp. 628\u2013658. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_22"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-031-57718-5_7","volume-title":"Public-Key Cryptography \u2013 PKC 2024","author":"A Lehmann","year":"2024","unstructured":"Lehmann, A., \u00d6zbay, C.: Multi-signatures for ad-hoc and privacy-preserving group signing. In: Tang, Q., Teague, V. (eds.) PKC 2024. LNCS, vol. 14601, pp. 196\u2013228. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57718-5_7"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-031-91823-0_3","volume-title":"Public-Key Cryptography \u2013 PKC 2025","author":"C Abou Haidar","year":"2025","unstructured":"Abou Haidar, C., Das, D., Lehmann, A., \u00d6zbay, C., Kempner, O.P.: Privacy-preserving multi-signatures: generic techniques and constructions without pairings. In: Jager, T., Pan, J. (eds.) PKC 2025. LNCS, vol. 15675, pp. 66\u201398. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91823-0_3"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-032-07891-9_20","volume-title":"Computer Security \u2013 ESORICS 2025","author":"X Wei","year":"2025","unstructured":"Wei, X., Han, S., Liu, S.: Optimized privacy-preserving multi-signatures from discrete logarithm assumption. In: Nicomette, V., Benzekri, A., Boulahia-Cuppens, N., Vaidya, J. (eds.) ESORICS 2025. LNCS, vol. 16054, pp. 379\u2013399. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-07891-9_20"},{"key":"14_CR8","unstructured":"Nick, J., Ruffing, T., Jin, E.: BIP-327: Musig2 for BIP340-compatible Multi-Signatures (2023). https:\/\/github.com\/bitcoin\/bips\/blob\/master\/bip-0327.mediawiki. Bitcoin Improvement Proposal"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 390\u2013399 (2006)","DOI":"10.1145\/1180405.1180453"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Bagherzandi, A., Cheon, J.-H., Jarecki, S.: Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma. In: Proceedings of the 15th ACM Conference on Computer and Communications Security, pp. 449\u2013458 (2008)","DOI":"10.1145\/1455770.1455827"},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10623-009-9313-z","volume":"54","author":"C Ma","year":"2010","unstructured":"Ma, C., Weng, J., Li, Y., Deng, R.: Efficient discrete logarithm based multi-signature scheme in the plain public key model. Des. Codes Crypt. 54(2), 121\u2013133 (2010)","journal-title":"Des. Codes Crypt."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Syta, E., et al. Keeping authorities \u201chonest or bust\u201d with decentralized witness cosigning. In: 2016 IEEE Symposium on Security and Privacy (SP), pp. 526\u2013545. IEEE (2016)","DOI":"10.1109\/SP.2016.38"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Drijvers, M., et al.: On the security of two-round multi-signatures. In: 2019 IEEE Symposium on Security and Privacy (SP), pp. 1084\u20131101. IEEE (2019)","DOI":"10.1109\/SP.2019.00050"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45708-9_19","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"D Wagner","year":"2002","unstructured":"Wagner, D.: A generalized birthday problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288\u2013304. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_19"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-96881-0_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 33\u201362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2"}],"container-title":["Lecture Notes in Computer Science","Provable and Practical Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-5737-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T08:55:49Z","timestamp":1790153749000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-5737-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9,24]]},"ISBN":["9789819257362","9789819257379"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-5737-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,9,24]]},"assertion":[{"value":"24 September 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ProvSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Provable Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Queenstown","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"provsec2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/provsec-2026.github.io\/Provsec2026-base\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}