{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T01:56:20Z","timestamp":1761184580868,"version":"build-2065373602"},"publisher-location":"Singapore","reference-count":36,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819535392"},{"type":"electronic","value":"9789819535408"}],"license":[{"start":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T00:00:00Z","timestamp":1761177600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T00:00:00Z","timestamp":1761177600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-3540-8_13","type":"book-chapter","created":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T13:33:32Z","timestamp":1761140012000},"page":"237-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MDKG: Module-Lattice-Based Distributed Key Generation"],"prefix":"10.1007","author":[{"given":"Ye","family":"Bai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debiao","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhichao","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cong","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,23]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Adida, B.: Helios: web-based open-audit voting. In: Proceedings of the 17th Conference on Security Symposium, SS 2008, pp. 335\u2013348. USENIX Association, USA (2008). https:\/\/doi.org\/10.5555\/1496711.1496734","DOI":"10.5555\/1496711.1496734"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 99\u2013108 (1996). https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015). https:\/\/doi.org\/10.1515\/jmc-2015-0016","journal-title":"J. Math. Cryptol."},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Atapoor, S., Baghery, K., Cozzo, D., Pedersen, R.: Practical robust DKG protocols for CSIDH. In: Tibouchi, M., Wang, X. (eds.) Applied Cryptography and Network Security, pp. 219\u2013247. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-33491-7_9","DOI":"10.1007\/978-3-031-33491-7_9"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/3-540-48071-4_28","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"M Bellare","year":"1993","unstructured":"Bellare, M., Goldreich, O.: On defining proofs of knowledge. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 390\u2013420. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_28"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, CCS 1993, pp. 62\u201373. Association for Computing Machinery, New York (1993). https:\/\/doi.org\/10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-662-45611-8_29","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"F Benhamouda","year":"2014","unstructured":"Benhamouda, F., Camenisch, J., Krenn, S., Lyubashevsky, V., Neven, G.: Better zero-knowledge proofs for lattice encryption and their application to group signatures. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 551\u2013572. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_29"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-319-24174-6_16","volume-title":"Computer Security \u2013 ESORICS 2015","author":"F Benhamouda","year":"2015","unstructured":"Benhamouda, F., Krenn, S., Lyubashevsky, V., Pietrzak, K.: Efficient zero-knowledge proofs for commitments from learning with errors over rings. In: Pernul, G., Ryan, P.Y.A., Weippl, E. (eds.) ESORICS 2015. LNCS, vol. 9326, pp. 305\u2013325. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24174-6_16"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-030-81293-5_14","volume-title":"Post-Quantum Cryptography","author":"W Beullens","year":"2021","unstructured":"Beullens, W., Disson, L., Pedersen, R., Vercauteren, F.: CSI-RAShi: distributed key generation for CSIDH. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 257\u2013276. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_14"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-36288-6_3","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"A Boldyreva","year":"2003","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 31\u201346. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_3"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory (TOCT) 6(3), 1\u201336 (2014). https:\/\/doi.org\/10.1145\/2633600","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, STOC 2013, pp. 575\u2013584. Association for Computing Machinery, New York (2013). https:\/\/doi.org\/10.1145\/2488608.2488680","DOI":"10.1145\/2488608.2488680"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Cascudo, I., David, B.: Publicly verifiable secret sharing over class groups and applications to DKG and YOSO. In: Joye, M., Leander, G. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2024, pp. 216\u2013248. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58740-5_8","DOI":"10.1007\/978-3-031-58740-5_8"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"De\u00a0Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, STOC 1994, pp. 522\u2013533. Association for Computing Machinery, New York (1994). https:\/\/doi.org\/10.1145\/195058.195405","DOI":"10.1145\/195058.195405"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-57220-1_47","volume-title":"Advances in Cryptology \u2014 AUSCRYPT \u201992","author":"Y Desmedt","year":"1993","unstructured":"Desmedt, Y.: Threshold cryptosystems. In: Seberry, J., Zheng, Y. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 1\u201314. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57220-1_47"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Ducas, L., et al.: Crystals-dilithium: a lattice-based digital signature scheme. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2018(1), 238\u2013268 (2018). https:\/\/doi.org\/10.13154\/tches.v2018.i1.238-268","DOI":"10.13154\/tches.v2018.i1.238-268"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-21568-2_4","volume-title":"Applied Cryptography and Network Security","author":"MF Esgin","year":"2019","unstructured":"Esgin, M.F., Steinfeld, R., Sakzad, A., Liu, J.K., Liu, D.: Short lattice-based one-out-of-many proofs and applications to ring signatures. In: Deng, R.H., Gauthier-Uma\u00f1a, V., Ochoa, M., Yung, M. (eds.) ACNS 2019. LNCS, vol. 11464, pp. 67\u201388. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21568-2_4"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Espitau, T., Niot, G., Prest, T.: Flood and submerse: distributed key generation and robust threshold signature from lattices. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO 2024, pp. 425\u2013458. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_14","DOI":"10.1007\/978-3-031-68394-7_14"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th Annual Symposium on Foundations of Computer Science (SFCS 1987), pp. 427\u2013438 (1987). https:\/\/doi.org\/10.1109\/SFCS.1987.4","DOI":"10.1109\/SFCS.1987.4"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-44586-2_22","volume-title":"Public Key Cryptography","author":"P-A Fouque","year":"2001","unstructured":"Fouque, P.-A., Stern, J.: One round threshold discrete-log key generation without private channels. In: Kim, K. (ed.) PKC 2001. LNCS, vol. 1992, pp. 300\u2013316. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44586-2_22"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-48910-X_21","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"R Gennaro","year":"1999","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 295\u2013310. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_21"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game, or a completeness theorem for protocols with honest majority, pp. 307\u2013328. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3335741.3335755","DOI":"10.1145\/3335741.3335755"},{"key":"13_CR24","unstructured":"Groth, J.: Non-interactive distributed key generation and key resharing. IACR Cryptol. ePrint Arch. 339 (2021). https:\/\/eprint.iacr.org\/2021\/339"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-030-77870-5_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"K Gurkan","year":"2021","unstructured":"Gurkan, K., Jovanovic, P., Maller, M., Meiklejohn, S., Stern, G., Tomescu, A.: Aggregatable distributed key generation. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 147\u2013176. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_6"},{"key":"13_CR26","unstructured":"Katz, J.: Round optimal robust distributed key generation. IACR Cryptol. ePrint Arch. 1094 (2023). https:\/\/eprint.iacr.org\/2023\/1094"},{"key":"13_CR27","doi-asserted-by":"publisher","unstructured":"Kokoris\u00a0Kogias, E., Alp, E.C., Gasser, L., Jovanovic, P.S., Syta, E., Ford, B.A.: Calypso: private data management for decentralized ledgers. Proc. VLDB Endow. 14(4), 586\u2013599 (2021). https:\/\/doi.org\/10.14778\/3436905.3436917","DOI":"10.14778\/3436905.3436917"},{"issue":"3","key":"13_CR28","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2014","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2014). https:\/\/doi.org\/10.1007\/s10623-014-9938-4","journal-title":"Des. Codes Crypt."},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"V Lyubashevsky","year":"2012","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 738\u2013755. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43"},{"issue":"1","key":"13_CR30","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007). https:\/\/doi.org\/10.1137\/S0097539705447360","journal-title":"SIAM J. Comput."},{"key":"13_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"TP Pedersen","year":"1991","unstructured":"Pedersen, T.P.: A threshold cryptosystem without a trusted party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522\u2013526. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_47"},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"issue":"6","key":"13_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM (JACM) 56(6), 1\u201340 (2009). https:\/\/doi.org\/10.1145\/1568318.1568324","journal-title":"J. ACM (JACM)"},{"issue":"11","key":"13_CR34","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"13_CR35","doi-asserted-by":"publisher","first-page":"4173","DOI":"10.1109\/TIFS.2023.3293408","volume":"18","author":"G Tang","year":"2023","unstructured":"Tang, G., Pang, B., Chen, L., Zhang, Z.: Efficient lattice-based threshold signatures with functional interchangeability. IEEE Trans. Inf. Forensics Secur. 18, 4173\u20134187 (2023). https:\/\/doi.org\/10.1109\/TIFS.2023.3293408","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"4","key":"13_CR36","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1504\/IJWGS.2018.10016848","volume":"14","author":"Z Zheng","year":"2018","unstructured":"Zheng, Z., Xie, S., Dai, H., Chen, X., Wang, H.: Blockchain challenges and opportunities: a survey. Int. J. Web Grid Serv. 14(4), 352\u2013375 (2018). https:\/\/doi.org\/10.1504\/IJWGS.2018.10016848","journal-title":"Int. J. Web Grid Serv."}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-3540-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T22:03:44Z","timestamp":1761170624000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-3540-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,23]]},"ISBN":["9789819535392","9789819535408"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-3540-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,23]]},"assertion":[{"value":"23 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ICICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information and Communications Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icics2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.icics2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}