{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T12:15:57Z","timestamp":1648815357675},"reference-count":24,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2021,12,1]]},"DOI":"10.1587\/transfun.2020eap1131","type":"journal-article","created":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T22:06:40Z","timestamp":1621894000000},"page":"1685-1697","source":"Crossref","is-referenced-by-count":0,"title":["Tighter Reduction for Lattice-Based Multisignature"],"prefix":"10.1587","volume":"E104.A","author":[{"given":"Masayuki","family":"FUKUMITSU","sequence":"first","affiliation":[{"name":"Faculty of Information Media, Hokkaido Information University"}]},{"given":"Shingo","family":"HASEGAWA","sequence":"additional","affiliation":[{"name":"Graduate School of Information Sciences, Tohoku University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] M. Fukumitsu and S. Hasegawa, \u201cA tightly-secure lattice-based multisignature,\u201d Proc. APKC 2019, APKC&apos;19, Auckland, New Zealand, pp.3-11, ACM, July 2019. 10.1145\/3327958.3329542","DOI":"10.1145\/3327958.3329542"},{"key":"2","unstructured":"[2] K. Itakura and K. Nakamura, \u201cA public-key cryptosystem suitable for digital multisignature,\u201d NEC Research and Development, vol.71, pp.1-8, 1983."},{"key":"3","unstructured":"[3] S. Nakamoto, Bitcoin: A Peer-to-Peer Electronic Cash System, Bitcoin Inc., 2008."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] M. Bellare and G. Neven, \u201cMulti-signatures in the plain public-key model and a general forking lemma,\u201d Proc. ACM CCS 2006, Alexandria, USA, pp.390-399, ACM, Oct. 2006. 10.1145\/1180405.1180453","DOI":"10.1145\/1180405.1180453"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[6] Y. Komano, K. Ohta, A. Shimbo, and S. Kawamura, \u201cFormal security model of multisignatures,\u201d Proc. ISC 2006, S.K. Katsikas, J. L\u00f3pez, M. Backes, S. Gritzalis, and B. Preneel, eds., LNCS, vol.4176, Samos Island, Greece, pp.146-160, Springer Berlin Heidelberg, Aug. 2006. 10.1007\/11836810_11","DOI":"10.1007\/11836810_11"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[7] D.P. Le, A. Bonnecaze and A. Gabillon, \u201cMultisignatures as secure as the Diffie-Hellman problem in the plain public-key model,\u201d Proc. Pairing 2009, H. Shacham and B. Waters, ed., LNCS, vol.5671, Palo Alto, USA, pp.35-51, Springer Berlin Heidelberg, Aug. 2009. 10.1007\/978-3-642-03298-1_3","DOI":"10.1007\/978-3-642-03298-1_3"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[8] S. Lu, R. Ostrovsky, A. Sahai, H. Shacham, and B. Waters, \u201cSequential aggregate signatures and multisignatures without random oracles,\u201d Proc. EUROCRYPT 2006, S. Vaudenay, ed., LNCS, vol.4004, St. Petersburg, Russia, pp.465-485, Springer Berlin Heidelberg, May 2006. 10.1007\/11761679_28","DOI":"10.1007\/11761679_28"},{"key":"8","unstructured":"[9] K. Ohta and T. Okamoto, \u201cMulti-signature schemes secure against active insider attacks,\u201d IEICE Trans. Fundamentals, vol.E82-A, no.1, pp.21-31, Jan. 1999."},{"key":"9","doi-asserted-by":"publisher","unstructured":"[10] N. Yanai, \u201cMeeting tight security for multisignatures in the plain public key model,\u201d IEICE Trans. Fundamentals, vol.E101-A, no.9, pp.1484-1493, Sept. 2018. 10.1587\/transfun.e101.a.1484","DOI":"10.1587\/transfun.E101.A.1484"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[11] P.W. Shor, \u201cPolynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,\u201d SIAM Rev., vol.41, no.2, pp.303-332, 1999. 10.1137\/s0036144598347011","DOI":"10.1137\/S0036144598347011"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[12] R. El Bansarkhani and J. Sturm, \u201cAn efficient lattice-based multisignature scheme with applications to bitcoins,\u201d Proc. CANS 2016, S. Foresti and G. Persiano, eds., LNCS, vol.10052, Milan, Italy, pp.140-155, Springer International Publishing, Nov. 2016. 10.1007\/978-3-319-48965-0_9","DOI":"10.1007\/978-3-319-48965-0_9"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[13] C. Ma and M. Jiang, \u201cPractical lattice-based multisignature schemes for blockchains,\u201d IEEE Access, vol.7, pp.179765-179778, 2019. 10.1109\/access.2019.2958816","DOI":"10.1109\/ACCESS.2019.2958816"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[14] I. Damg\u00e5rd, C. Orlandi, A. Takahashi, and M. Tibouchi, \u201cTwo-round <i>n<\/i>-out-of-<i>n<\/i> and multi-signatures and trapdoor commitment from lattices,\u201d Proc. PKC 2021, Part I, J.A. Garay, ed., LNCS, vol.12710, Virtual Event, pp.99-130, Springer International Publishing, 2021. 10.1007\/978-3-030-75245-3_5","DOI":"10.1007\/978-3-030-75245-3_5"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[15] A. Fiat and A. Shamir, \u201cHow to prove yourself: Practical solutions to identification and signature problems,\u201d Proc. CRYPTO&apos;86, A.M. Odlyzko, ed., LNCS, vol.263, Santa Barbara, USA, pp.186-194, Springer Berlin Heidelberg, 1987. 10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[16] T. G\u00fcneysu, V. Lyubashevsky, and T. P\u00f6ppelmann, \u201cPractical lattice-based cryptography: A signature scheme for embedded systems,\u201d Proc. CHES 2012, E. Prouff and P. Schaumont, eds., LNCS, vol.7428, Berlin, Heidelberg, pp.530-547, Springer Berlin Heidelberg, 2012. 10.1007\/978-3-642-33027-8_31","DOI":"10.1007\/978-3-642-33027-8_31"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[17] M. Abdalla, P.A. Fouque, V. Lyubashevsky, and M. Tibouchi, \u201cTightly secure signatures from lossy identification schemes,\u201d J. Cryptol., vol.29, no.3, pp.597-631, 2016. 10.1007\/s00145-015-9203-7","DOI":"10.1007\/s00145-015-9203-7"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[18] J. Katz and N. Wang, \u201cEfficiency improvements for signature schemes with tight security reductions,\u201d Proc. ACM CCS 2003, Washington D.C., USA, pp.155-164, ACM, Oct. 2003. 10.1145\/948109.948132","DOI":"10.1145\/948109.948132"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[19] V. Lyubashevsky, \u201cFiat-Shamir with aborts: Applications to lattice and factoring-based signatures,\u201d Proc. ASIACRYPT 2009, M. Matsui, ed., LNCS, vol.5912, Tokyo, Japan, pp.598-616, Springer Berlin Heidelberg, Dec. 2009. 10.1007\/978-3-642-10366-7_35","DOI":"10.1007\/978-3-642-10366-7_35"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[20] G. Barthe, S. Bela\u00efd, T. Espitau, P.A. Fouque, B. Gr\u00e9goire, M. Rossi, and M. Tibouchi, \u201cMasking the GLP lattice-based signature scheme at any order,\u201d Proc. EUROCRYPT 2018, Part II, J.B. Nielsen and V. Rijmen, eds., LNCS, vol.10821, Tel Aviv, Israel, pp.354-384, Springer International Publishing, April 2018. 10.1007\/978-3-319-78375-8_12","DOI":"10.1007\/978-3-319-78375-8_12"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[21] M. Kansal and R. Dutta, \u201cRound optimal secure multisignature schemes from lattice with public key aggregation and signature compression,\u201d Proc. AFRICACRYPT 2020, A. Nitaj and A. Youssef, eds., LNCS, vol.12174, Cairo, Egypt, pp.281-300, Springer International Publishing, July 2020. 10.1007\/978-3-030-51938-4_14","DOI":"10.1007\/978-3-030-51938-4_14"},{"key":"21","unstructured":"[22] Z.Y. Liu, Y.F. Tseng, and R. Tso, \u201cCryptanalysis of a round optimal lattice-based multisignature scheme,\u201d Cryptology ePrint Archive, Report 2020\/1172, 2020. https:\/\/eprint.iacr.org\/2020\/1172"},{"key":"22","unstructured":"[23] R. Toluee and T. Eghlidos, \u201cAn efficient and secure ID-based multi-proxy multi-signature scheme based on lattice,\u201d Cryptology ePrint Archive, Report 2019\/1031, 2019. https:\/\/eprint.iacr.org\/2019\/1031"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[24] R. Tso, Z. Liu, and Y. Tseng, \u201cIdentity-based blind multisignature from lattices,\u201d IEEE Access, vol.7, pp.182916-182923, 2019. 10.1109\/access.2019.2959943","DOI":"10.1109\/ACCESS.2019.2959943"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[25] A. Langlois and D. Stehl\u00e9, \u201cWorst-case to average-case reductions for module lattices,\u201d Des. Codes Cryptogr., vol.75, no.3, pp.565-599, 2015. 10.1007\/s10623-014-9938-4","DOI":"10.1007\/s10623-014-9938-4"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/12\/E104.A_2020EAP1131\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,4]],"date-time":"2021-12-04T03:13:58Z","timestamp":1638587638000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/12\/E104.A_2020EAP1131\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,1]]},"references-count":24,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2020eap1131","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,1]]},"article-number":"2020EAP1131"}}