{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T00:21:47Z","timestamp":1768350107557,"version":"3.49.0"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031627453","type":"print"},{"value":"9783031627460","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-62746-0_12","type":"book-chapter","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T09:02:26Z","timestamp":1718010146000},"page":"266-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Two-Round Threshold Lattice-Based Signatures from\u00a0Threshold Homomorphic Encryption"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4796-212X","authenticated-orcid":false,"given":"Kamil Doruk","family":"Gur","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6084-9303","authenticated-orcid":false,"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5455-0409","authenticated-orcid":false,"given":"Tjerand","family":"Silde","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Stehl\u00e9, D., Yadav, A.: Round-optimal lattice-based threshold signatures, revisited. In: Boja\u0144czyk, M., Merelli, E., Woodruff, D.P. (eds.) 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0229, pp. 8:1\u20138:20. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2022.8","DOI":"10.4230\/LIPIcs.ICALP.2022.8"},{"issue":"3","key":"12_CR2","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":"12_CR3","doi-asserted-by":"publisher","unstructured":"Aranha, D.F., Baum, C., Gj\u00f8steen, K., Silde, T.: Verifiable mix-nets and distributed decryption for voting from lattice-based assumptions. In: ACM CCS 2023, pp. 1467\u20131481. ACM (2023). https:\/\/doi.org\/10.1145\/3576915.3616683","DOI":"10.1145\/3576915.3616683"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-319-98113-0_20","volume-title":"Security and Cryptography for Networks","author":"C Baum","year":"2018","unstructured":"Baum, C., Damg\u00e5rd, I., Lyubashevsky, V., Oechsner, S., Peikert, C.: More efficient commitments from structured lattice assumptions. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 368\u2013385. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_20"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-11799-2_13","volume-title":"Theory of Cryptography","author":"R Bendlin","year":"2010","unstructured":"Bendlin, R., Damg\u00e5rd, I.: Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 201\u2013218. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_13"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-38980-1_14","volume-title":"Applied Cryptography and Network Security","author":"R Bendlin","year":"2013","unstructured":"Bendlin, R., Krehbiel, S., Peikert, C.: How to share a lattice trapdoor: threshold protocols for signatures and (H)IBE. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 218\u2013236. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_14"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-319-96884-1_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., et al.: Threshold cryptosystems from threshold fully homomorphic encryption. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 565\u2013596. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_19"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-030-88428-4_30","volume-title":"Computer Security \u2013 ESORICS 2021","author":"J Bootle","year":"2021","unstructured":"Bootle, J., Lyubashevsky, V., Nguyen, N.K., Seiler, G.: More efficient amortization of exact zero-knowledge proofs for LWE. In: Bertino, E., Shulman, H., Waidner, M. (eds.) ESORICS 2021. LNCS, vol. 12973, pp. 608\u2013627. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88428-4_30"},{"key":"12_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-031-15979-4_10","volume-title":"CRYPTO 2022, Part II","author":"C Boschini","year":"2022","unstructured":"Boschini, C., Takahashi, A., Tibouchi, M.: MuSig-L: lattice-based multi-signature with single-round online phase. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part II. LNCS, vol. 13508, pp. 276\u2013305. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_10"},{"key":"12_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-981-99-8721-4_12","volume-title":"ASIACRYPT 2023, Part I","author":"K Boudgoust","year":"2023","unstructured":"Boudgoust, K., Scholl, P.: Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, Part I. LNCS, vol. 14438, pp. 371\u2013404. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-981-99-8721-4_12"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Goldwasser, S. (ed.) ITCS 2012, pp. 309\u2013325. ACM (2012). https:\/\/doi.org\/10.1145\/2090236.2090262","DOI":"10.1145\/2090236.2090262"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Brand\u00e3o, L.T.A.N., Peralta, R.: NIST first call for multi-party threshold schemes (2023). https:\/\/doi.org\/10.6028\/NIST.IR.8214C.ipd","DOI":"10.6028\/NIST.IR.8214C.ipd"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Canetti, R., Gennaro, R., Goldfeder, S., Makriyannis, N., Peled, U.: UC non-interactive, proactive, threshold ECDSA with identifiable aborts. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 1769\u20131787. ACM Press (2020). https:\/\/doi.org\/10.1145\/3372297.3423367","DOI":"10.1145\/3372297.3423367"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-030-45388-6_10","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"G Castagnos","year":"2020","unstructured":"Castagnos, G., Catalano, D., Laguillaumie, F., Savasta, F., Tucker, I.: Bandwidth-efficient threshold EC-DSA. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12111, pp. 266\u2013296. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_10"},{"key":"12_CR15","unstructured":"Chairattana-Apirom, R., Tessaro, S., Zhu, C.: Partially non-interactive two-round lattice-based threshold signatures (2024). https:\/\/eprint.iacr.org\/2024\/467"},{"key":"12_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1007\/978-3-031-38554-4_23","volume-title":"CRYPTO 2023, Part V","author":"Y Chen","year":"2023","unstructured":"Chen, Y.: DualMS: efficient lattice-based two-round multi-signature with trapdoor-free simulation. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part V. LNCS, vol. 14085, pp. 716\u2013747. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_23"},{"key":"12_CR17","unstructured":"Chowdhury, S., et al.: Efficient threshold FHE with application to real-time systems (2022). https:\/\/eprint.iacr.org\/2022\/1625"},{"key":"12_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/978-3-031-38557-5_24","volume-title":"CRYPTO 2023, Part I","author":"H Chu","year":"2023","unstructured":"Chu, H., Gerhart, P., Ruffing, T., Schr\u00f6der, D.: Practical Schnorr threshold signatures without the algebraic group model. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part I. LNCS, vol. 14081, pp. 743\u2013773. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_24"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-030-35199-1_7","volume-title":"Cryptography and Coding","author":"D Cozzo","year":"2019","unstructured":"Cozzo, D., Smart, N.P.: Sharing the LUOV: threshold post-quantum signatures. In: Albrecht, M. (ed.) IMACC 2019. LNCS, vol. 11929, pp. 128\u2013153. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35199-1_7"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Dahl, M., et al.: Noah\u2019s ark: Efficient threshold-FHE using noise flooding. In: Proceedings of the 11th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, pp. 35\u201346. WAHC 2023, Association for Computing Machinery, New York, NY, USA (2023). https:\/\/doi.org\/10.1145\/3605759.3625259","DOI":"10.1145\/3605759.3625259"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-030-57990-6_19","volume-title":"Security and Cryptography for Networks","author":"I Damg\u00e5rd","year":"2020","unstructured":"Damg\u00e5rd, I., Jakobsen, T.P., Nielsen, J.B., Pagter, J.I., \u00d8stergaard, M.B.: Fast threshold ECDSA with honest majority. In: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 382\u2013400. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_19"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-030-75245-3_5","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"I Damg\u00e5rd","year":"2021","unstructured":"Damg\u00e5rd, I., Orlandi, C., Takahashi, A., Tibouchi, M.: Two-round n-out-of-n and multi-signatures and trapdoor commitment from lattices. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12710, pp. 99\u2013130. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_5"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-44647-8_33","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"A De Santis","year":"2001","unstructured":"De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust non-interactive zero knowledge. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 566\u2013598. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_33"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/978-3-030-75245-3_24","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"J Devevey","year":"2021","unstructured":"Devevey, J., Libert, B., Nguyen, K., Peters, T., Yung, M.: Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12710, pp. 659\u2013690. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_24"},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Doerner, J., Kondi, Y., Lee, E., shelat, A.: Threshold ECDSA from ECDSA assumptions: the multiparty case. In: 2019 IEEE Symposium on Security and Privacy, pp. 1051\u20131066. IEEE Computer Society Press (2019). https:\/\/doi.org\/10.1109\/SP.2019.00024","DOI":"10.1109\/SP.2019.00024"},{"key":"12_CR26","doi-asserted-by":"publisher","unstructured":"Ducas, L., et al.: CRYSTALS-Dilithium: a lattice-based digital signature scheme. IACR TCHES 2018(1), 238\u2013268 (2018). https:\/\/doi.org\/10.13154\/tches.v2018.i1.238-268, https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/839","DOI":"10.13154\/tches.v2018.i1.238-268"},{"key":"12_CR27","unstructured":"Espitau, T., Katsumata, S., Takemure, K.: Two-round threshold signature from algebraic one-more learning with errors (2024). https:\/\/eprint.iacr.org\/2024\/496"},{"key":"12_CR28","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-981-99-8739-9_1","volume-title":"ASIACRYPT 2023, Part VII","author":"T Espitau","year":"2023","unstructured":"Espitau, T., Nguyen, T.T.Q., Sun, C., Tibouchi, M., Wallet, A.: Antrag: annular NTRU trapdoor generation - making mitaka as secure as falcon. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, Part VII. LNCS, vol. 14444, pp. 3\u201336. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_1"},{"key":"12_CR29","doi-asserted-by":"publisher","unstructured":"Fleischhacker, N., Simkin, M., Zhang, Z.: Squirrel: efficient synchronized multi-signatures from lattices. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 1109\u20131123. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560655","DOI":"10.1145\/3548606.3560655"},{"key":"12_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-62576-4_3","volume-title":"Provable and Practical Security","author":"M Fukumitsu","year":"2020","unstructured":"Fukumitsu, M., Hasegawa, S.: a lattice-based provably secure multisignature scheme in quantum random oracle model. In: Nguyen, K., Wu, W., Lam, K.Y., Wang, H. (eds.) ProvSec 2020. LNCS, vol. 12505, pp. 45\u201364. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62576-4_3"},{"key":"12_CR31","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Goldfeder, S.: Fast multiparty threshold ECDSA with fast trustless setup. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 1179\u20131194. ACM Press (2018). https:\/\/doi.org\/10.1145\/3243734.3243859","DOI":"10.1145\/3243734.3243859"},{"key":"12_CR32","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 197\u2013206. ACM Press (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"12_CR33","unstructured":"Goldwasser, S., Kalai, Y.T., Peikert, C., Vaikuntanathan, V.: Robustness of the learning with errors assumption. In: Yao, A.C.C. (ed.) ICS 2010, pp. 230\u2013240. Tsinghua University Press (2010)"},{"key":"12_CR34","unstructured":"Hough, P., Sandsbr\u00e5ten, C., Silde, T.: Concrete NTRU security and advances in practical lattice-based electronic voting (2023). https:\/\/eprint.iacr.org\/2023\/933"},{"key":"12_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/978-3-030-84245-1_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"S Katsumata","year":"2021","unstructured":"Katsumata, S.: A new simple technique to bootstrap various lattice zero-knowledge proofs to\u00a0QROM Secure NIZKs. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 580\u2013610. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_20"},{"key":"12_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-030-81652-0_2","volume-title":"Selected Areas in Cryptography","author":"C Komlo","year":"2021","unstructured":"Komlo, C., Goldberg, I.: FROST: flexible round-optimized Schnorr threshold signatures. In: Dunkelman, O., Jacobson, Jr., M.J., O\u2019Flynn, C. (eds.) SAC 2020. LNCS, vol. 12804, pp. 34\u201365. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_2"},{"key":"12_CR37","unstructured":"K\u00f6lbl, S.: A note on SPHINCS$$^+$$ parameter sets (2022). https:\/\/eprint.iacr.org\/2022\/1725"},{"key":"12_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-319-63715-0_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"Y Lindell","year":"2017","unstructured":"Lindell, Y.: Fast secure two-party ECDSA signing. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017 Part II. LNCS, vol. 10402, pp. 613\u2013644. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_21"},{"key":"12_CR39","doi-asserted-by":"publisher","unstructured":"Lindell, Y.: Simple three-round multiparty schnorr signing with full simulatability. IACR Commun. Cryptol. 1(1) (2024). https:\/\/doi.org\/10.62056\/a36c0l5vt","DOI":"10.62056\/a36c0l5vt"},{"key":"12_CR40","doi-asserted-by":"publisher","unstructured":"Lindell, Y., Nof, A.: Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 1837\u20131854. ACM Press (2018). https:\/\/doi.org\/10.1145\/3243734.3243788","DOI":"10.1145\/3243734.3243788"},{"key":"12_CR41","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"},{"key":"12_CR42","unstructured":"Lyubashevsky, V., et al.: CRYSTALS-DILITHIUM. Technical report, National Institute of Standards and Technology (2020). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-3-submissions"},{"key":"12_CR43","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-031-15979-4_3","volume-title":"CRYPTO 2022, Part II","author":"V Lyubashevsky","year":"2022","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M.: Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part II. LNCS, vol. 13508, pp. 71\u2013101. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3"},{"key":"12_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"key":"12_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-38348-9_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: A toolkit for ring-LWE cryptography. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 35\u201354. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_3"},{"key":"12_CR46","doi-asserted-by":"publisher","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions. In: 43rd FOCS, pp. 356\u2013365. IEEE Computer Society Press (2002). https:\/\/doi.org\/10.1109\/SFCS.2002.1181960","DOI":"10.1109\/SFCS.2002.1181960"},{"key":"12_CR47","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-88702-7_5","volume-title":"Post-Quantum Cryptography","author":"D Micciancio","year":"2009","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 147\u2013191. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88702-7_5"},{"key":"12_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-14623-7_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C Peikert","year":"2010","unstructured":"Peikert, C.: An efficient and parallel gaussian sampler for lattices. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 80\u201397. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_5"},{"key":"12_CR49","unstructured":"del Pino, R., et al.: Raccoon: a side-channel secure signature scheme (2023). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/raccoon-spec-web.pdf"},{"key":"12_CR50","doi-asserted-by":"crossref","unstructured":"del Pino, R., Katsumata, S., Maller, M., Mouhartem, F., Prest, T., Saarinen, M.J.: Threshold raccoon: practical threshold signatures from standard lattice assumptions (2024). https:\/\/eprint.iacr.org\/2024\/184. Eurocrypt\u00a02024, to appear","DOI":"10.1007\/978-3-031-58723-8_8"},{"issue":"1","key":"12_CR51","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00145-021-09416-w","volume":"35","author":"D Rotaru","year":"2022","unstructured":"Rotaru, D., Smart, N.P., Tanguy, T., Vercauteren, F., Wood, T.: Actively secure setup for SPDZ. J. Cryptol. 35(1), 5 (2022). https:\/\/doi.org\/10.1007\/s00145-021-09416-w","journal-title":"J. Cryptol."},{"key":"12_CR52","unstructured":"Schwabe, P., et al.: CRYSTALS-KYBER. Technical report, National Institute of Standards and Technology (2020). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-3-submissions"},{"issue":"11","key":"12_CR53","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. Assoc. Comput. Mach. 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"12_CR54","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."}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-62746-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T09:04:09Z","timestamp":1718010249000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62746-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031627453","9783031627460"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62746-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"11 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.maths.ox.ac.uk\/events\/conferences\/pqcrypto-2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}