{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:16:54Z","timestamp":1783009014960,"version":"3.54.5"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031547690","type":"print"},{"value":"9783031547706","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-54770-6_15","type":"book-chapter","created":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T09:03:42Z","timestamp":1709197422000},"page":"376-402","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Practical Lattice-Based Distributed Signatures for\u00a0a\u00a0Small Number of\u00a0Signers"],"prefix":"10.1007","author":[{"given":"Nabil Alkeilani","family":"Alkadri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nico","family":"D\u00f6ttling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sihang","family":"Pu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,3,1]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Stehl\u00e9, D., Yadav, A.: Round-optimal lattice-based threshold signatures, revisited. In: Bojanczyk, M., Merelli, E., Woodruff, D.P. (eds.) 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022. LIPIcs, vol. 229, pp. 8:1\u20138:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)","DOI":"10.1145\/3548606.3560650"},{"issue":"3","key":"15_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)","journal-title":"J. Math. Cryptol."},{"key":"15_CR3","doi-asserted-by":"publisher","unstructured":"Alkeilani Alkadri, N., El Bansarkhani, R., Buchmann, J.: On lattice-based interactive protocols: An approach with less or no aborts, pp. 41\u201361 (2020). https:\/\/doi.org\/10.1007\/978-3-030-55304-3_3","DOI":"10.1007\/978-3-030-55304-3_3"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"Alkeilani Alkadri, N., Harasser, P., Janson, C.: BlindOR: an efficient lattice-based blind signature scheme from OR-proofs, pp. 95\u2013115 (2021). https:\/\/doi.org\/10.1007\/978-3-030-92548-2_6","DOI":"10.1007\/978-3-030-92548-2_6"},{"key":"15_CR5","doi-asserted-by":"publisher","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving, pp. 10\u201324 (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.ch2","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"15_CR6","doi-asserted-by":"publisher","unstructured":"Bellare, M., Davis, H., G\u00fcnther, F.: Separate your domains: NIST PQC KEMs, oracle cloning and read-only indifferentiability, pp. 3\u201332 (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_1","DOI":"10.1007\/978-3-030-45724-2_1"},{"key":"15_CR7","doi-asserted-by":"publisher","unstructured":"Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma, pp. 390\u2013399 (2006). https:\/\/doi.org\/10.1145\/1180405.1180453","DOI":"10.1145\/1180405.1180453"},{"key":"15_CR8","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols, pp. 62\u201373 (1993). https:\/\/doi.org\/10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Bendlin, R., Krehbiel, S., Peikert, C.: How to share a lattice trapdoor: threshold protocols for signatures and (H)IBE, pp. 218\u2013236 (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_14","DOI":"10.1007\/978-3-642-38980-1_14"},{"key":"15_CR10","doi-asserted-by":"publisher","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random oracles in a quantum world, pp. 41\u201369 (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3","DOI":"10.1007\/978-3-642-25385-0_3"},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Boneh, D., et al.: Threshold cryptosystems from threshold fully homomorphic encryption, pp. 565\u2013596 (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_19","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"Boschini, C., Takahashi, A., Tibouchi, M.: MuSig-L: Lattice-based multi-signature with single-round online phase, pp. 276\u2013305 (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_10","DOI":"10.1007\/978-3-031-15979-4_10"},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"Chen, Y.: DualMS: Efficient lattice-based two-round multi-signature with trapdoor-free simulation. In: Advances in Cryptology - CRYPTO 2023, pp. 716\u2013747 (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_23","DOI":"10.1007\/978-3-031-38554-4_23"},{"key":"15_CR14","unstructured":"Chen, Y.: R\u00e9duction de r\u00e9seau et s\u00e9curit\u00e9 concrete du chiffrement completement homomorphe. Ph.D. thesis, ENS-Lyon, France (2013)"},{"key":"15_CR15","doi-asserted-by":"publisher","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: Better lattice security estimates, pp. 1\u201320 (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"15_CR16","doi-asserted-by":"publisher","unstructured":"Cozzo, D., Smart, N.P.: Sharing the LUOV: threshold post-quantum signatures, pp. 128\u2013153 (2019). https:\/\/doi.org\/10.1007\/978-3-030-35199-1_7","DOI":"10.1007\/978-3-030-35199-1_7"},{"issue":"2","key":"15_CR17","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.: Two-round n-out-of-n and multi-signatures and trapdoor commitment from lattices 35(2), 14 (2022). https:\/\/doi.org\/10.1007\/s00145-022-09425-3","journal-title":"Two-round n-out-of-n and multi-signatures and trapdoor commitment from lattices"},{"key":"15_CR18","doi-asserted-by":"publisher","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystem, pp. 307\u2013315 (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_28","DOI":"10.1007\/0-387-34805-0_28"},{"key":"15_CR19","doi-asserted-by":"publisher","unstructured":"Don, J., Fehr, S., Majenz, C., Schaffner, C.: Security of the Fiat-Shamir transformation in the quantum random-oracle model, pp. 356\u2013383 (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_13","DOI":"10.1007\/978-3-030-26951-7_13"},{"key":"15_CR20","doi-asserted-by":"publisher","unstructured":"Ducas, L., et al.: CRYSTALS-Dilithium: a lattice-based digital signature scheme 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":"15_CR21","unstructured":"Ducas, L., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., Stehle, D.: Crystals - dilithium: Digital signatures from module lattices. Cryptology ePrint Archive, Paper 2017\/633 (2017), https:\/\/eprint.iacr.org\/archive\/2017\/633\/20170627:201152"},{"key":"15_CR22","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions, pp. 197\u2013206 (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"15_CR23","first-page":"1","volume":"71","author":"K Itakura","year":"1983","unstructured":"Itakura, K., Nakamura, K.: A public-key cryptosystem suitable for digital multisignatures. NEC Res. Develop. 71, 1\u20138 (1983)","journal-title":"NEC Res. Develop."},{"key":"15_CR24","doi-asserted-by":"publisher","unstructured":"Liu, Q., Zhandry, M.: Revisiting post-quantum Fiat-Shamir, pp. 326\u2013355 (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_12","DOI":"10.1007\/978-3-030-26951-7_12"},{"key":"15_CR25","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V.: Fiat-shamir with aborts: applications to lattice and factoring-based signatures, pp. 598\u2013616 (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_35","DOI":"10.1007\/978-3-642-10366-7_35"},{"key":"15_CR26","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors, pp. 738\u2013755 (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"15_CR27","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: A toolkit for ring-LWE cryptography, pp. 35\u201354 (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_3","DOI":"10.1007\/978-3-642-38348-9_3"},{"key":"15_CR28","doi-asserted-by":"publisher","unstructured":"Micali, S., Ohta, K., Reyzin, L.: Accountable-subgroup multisignatures: extended abstract, pp. 245\u2013254 (2001). https:\/\/doi.org\/10.1145\/501983.502017","DOI":"10.1145\/501983.502017"},{"key":"15_CR29","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 Berlin Heidelberg, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88702-7_5"},{"key":"15_CR30","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C Schnorr","year":"1994","unstructured":"Schnorr, C., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66, 181\u2013199 (1994). https:\/\/doi.org\/10.1007\/BF01581144","journal-title":"Math. Program."},{"key":"15_CR31","doi-asserted-by":"publisher","unstructured":"Zhandry, M.: How to record quantum queries, and applications to quantum indifferentiability, pp. 239\u2013268 (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_9","DOI":"10.1007\/978-3-030-26951-7_9"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-54770-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T16:14:52Z","timestamp":1709655292000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54770-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031547690","9783031547706"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54770-6_15","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":"1 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Abu Dhabi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","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":"5 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wp.nyu.edu\/acns2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"230","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}