{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:02:49Z","timestamp":1757617369333,"version":"3.44.0"},"reference-count":25,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2025,9,1]]},"DOI":"10.1587\/transfun.2024dmp0005","type":"journal-article","created":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T17:13:01Z","timestamp":1741281181000},"page":"1164-1174","source":"Crossref","is-referenced-by-count":0,"title":["Tightly Secure Aggregate Signature with Pre-Communication"],"prefix":"10.1587","volume":"E108.A","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7471-4477","authenticated-orcid":false,"given":"Masayuki","family":"FUKUMITSU","sequence":"first","affiliation":[{"name":"Department of Information Security, University of Nagasaki"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shingo","family":"HASEGAWA","sequence":"additional","affiliation":[{"name":"Faculty of Symbiotic Systems Science, Fukushima University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"doi-asserted-by":"publisher","unstructured":"[1] D. Boneh, C. Gentry, B. Lynn, and H. Shacham, \u201cAggregate and verifiably encrypted signatures from bilinear maps,\u201d Advances in Cryptology\u2006\u2014\u2006EUROCRYPT 2003, E. Biham, ed., Berlin, Heidelberg, pp.416-432, Springer Berlin Heidelberg, 2003. 10.1007\/3-540-39200-9_26","key":"1","DOI":"10.1007\/3-540-39200-9_26"},{"doi-asserted-by":"crossref","unstructured":"[2] C. Gentry and Z. Ramzan, \u201cIdentity-based aggregate signatures,\u201d Public Key Cryptography - PKC 2006, M. Yung, Y. Dodis, A. Kiayias, and T. Malkin, eds., Berlin, Heidelberg, pp.257-273, Springer Berlin Heidelberg, 2006. 10.1007\/11745853_17","key":"2","DOI":"10.1007\/11745853_17"},{"doi-asserted-by":"publisher","unstructured":"[4] A. Lysyanskaya, S. Micali, L. Reyzin, and H. Shacham, \u201cSequential aggregate signatures from trapdoor permutations,\u201d Advances in Cryptology - EUROCRYPT 2004, C. Cachin and J.L. Camenisch, eds., Berlin, Heidelberg, pp.74-90, Springer Berlin Heidelberg, 2004. 10.1007\/978-3-540-24676-3_5","key":"3","DOI":"10.1007\/978-3-540-24676-3_5"},{"doi-asserted-by":"publisher","unstructured":"[5] G. Neven, \u201cEfficient sequential aggregate signed data,\u201d Advances in Cryptology - EUROCRYPT 2008, N. Smart, ed., Berlin, Heidelberg, pp.52-69, Springer Berlin Heidelberg, 2008. 10.1007\/978-3-540-78967-3_4","key":"4","DOI":"10.1007\/978-3-540-78967-3_4"},{"doi-asserted-by":"crossref","unstructured":"[6] M. Bellare and G. Neven, \u201cMulti-signatures in the plain public-key model and a general forking lemma,\u201d Proc. 13th ACM Conference on Computer and Communications Security, CCS\u201906, New York, NY, USA, pp.390-399, ACM, 2006. 10.1145\/1180405.1180453","key":"5","DOI":"10.1145\/1180405.1180453"},{"doi-asserted-by":"crossref","unstructured":"[7] J.H. Ahn, M. Green, and S. Hohenberger, \u201cSynchronized aggregate signatures: New definitions, constructions and applications,\u201d Proc. 17th ACM Conference on Computer and Communications Security, CCS\u201910, New York, NY, USA, pp.473-484, Association for Computing Machinery, 2010. 10.1145\/1866307.1866360","key":"6","DOI":"10.1145\/1866307.1866360"},{"doi-asserted-by":"crossref","unstructured":"[8] S. Hohenberger and B. Waters, \u201cSynchronized aggregate signatures from the RSA assumption,\u201d Advances in Cryptology - EUROCRYPT 2018, J.B. Nielsen and V. Rijmen, eds., Cham, pp.197-229, Springer International Publishing, 2018. 10.1007\/978-3-319-78375-8_7","key":"7","DOI":"10.1007\/978-3-319-78375-8_7"},{"doi-asserted-by":"crossref","unstructured":"[9] Y. Zhao, \u201cPractical aggregate signature from general elliptic curves, and applications to blockchain,\u201d Proc. 2019 ACM Asia Conference on Computer and Communications Security, Asia CCS\u201919, New York, NY, USA, pp.529-538, Association for Computing Machinery, 2019. 10.1145\/3321705.3329826","key":"8","DOI":"10.1145\/3321705.3329826"},{"doi-asserted-by":"publisher","unstructured":"[10] A.C.C. Yao and Y. Zhao, \u201cOnline\/offline signatures for low-power devices,\u201d IEEE Trans. Inf. Forensics Security, vol.8, no.2, pp.283-294, Feb. 2013. 10.1109\/tifs.2012.2232653","key":"9","DOI":"10.1109\/TIFS.2012.2232653"},{"doi-asserted-by":"publisher","unstructured":"[11] A. Fiat and A. Shamir, \u201cHow to prove yourself: Practical solutions to identification and signature problems,\u201d Advances in Cryptology \u2014 CRYPTO\u201986, A.M. Odlyzko, ed., Berlin, Heidelberg, pp.186-194, Springer Berlin Heidelberg, 1987. 10.1007\/3-540-47721-7_12","key":"10","DOI":"10.1007\/3-540-47721-7_12"},{"doi-asserted-by":"crossref","unstructured":"[12] M. Bellare and P. Rogaway, \u201cRandom oracles are practical: A paradigm for designing efficient protocols,\u201d Proc. 1st ACM Conference on Computer and Communications Security, CCS\u201993, New York, NY, USA, pp.62-73, Association for Computing Machinery, 1993. 10.1145\/168588.168596","key":"11","DOI":"10.1145\/168588.168596"},{"doi-asserted-by":"crossref","unstructured":"[13] U. Maurer, \u201cAbstract models of computation in cryptography,\u201d Proc. 10th International Conference on Cryptography and Coding, IMA\u201905, Berlin, Heidelberg, pp.1-12, Springer-Verlag, 2005. 10.1007\/11586821_1","key":"12","DOI":"10.1007\/11586821_1"},{"unstructured":"[14] G. Hanaoka, K. Ohta, Y. Sakai, B. Santoso, K. Takemure, and Y. Zhao, \u201cCryptanalysis of aggregate \u0393-signature and practical countermeasures in application to bitcoin.\u201d Cryptology ePrint Archive, Paper 2020\/1484, 2020. https:\/\/eprint.iacr.org\/2020\/1484","key":"13"},{"doi-asserted-by":"crossref","unstructured":"[15] K. Takemure, Y. Sakai, B. Santoso, G. Hanaoka, and K. Ohta, \u201cAchieving pairing-free aggregate signatures using pre-communication between signers,\u201d ProvSec 2020, K. Nguyen, W. Wu, K. Lam, and H. Wang, eds., Lecture Notes in Computer Science, vol.12505, pp.65-84, Springer, 2020. 10.1007\/978-3-030-62576-4_4","key":"14","DOI":"10.1007\/978-3-030-62576-4_4"},{"doi-asserted-by":"crossref","unstructured":"[16] A. Boldyreva, \u201cThreshold signatures, multisignatures and blind signatures based on the Gap-Diffie-Hellman-group signature scheme,\u201d Public Key Cryptography\u2006\u2014\u2006PKC 2003, Y.G. Desmedt, ed., Berlin, Heidelberg, pp.31-46, Springer Berlin Heidelberg, 2002. 10.1007\/3-540-36288-6_3","key":"15","DOI":"10.1007\/3-540-36288-6_3"},{"doi-asserted-by":"crossref","unstructured":"[17] S. Lu, R. Ostrovsky, A. Sahai, H. Shacham, and B. Waters, \u201cSequential aggregate signatures and multisignatures without random oracles,\u201d Advances in Cryptology - EUROCRYPT 2006, S. Vaudenay, ed., Berlin, Heidelberg, pp.465-485, Springer Berlin Heidelberg, 2006. 10.1007\/11761679_28","key":"16","DOI":"10.1007\/11761679_28"},{"doi-asserted-by":"crossref","unstructured":"[18] J. Katz and N. Wang, \u201cEfficiency improvements for signature schemes with tight security reductions,\u201d Proc. 10th ACM Conference on Computer and Communications Security, CCS\u201903, New York, NY, USA, pp.155-164, ACM, 2003. 10.1145\/948109.948132","key":"17","DOI":"10.1145\/948109.948132"},{"doi-asserted-by":"crossref","unstructured":"[19] M. Fukumitsu and S. Hasegawa, \u201cAn aggregate signature with pre-communication in the plain public key model,\u201d Security and Trust Management, R. Roman and J. Zhou, eds., Cham, pp.3-19, Springer International Publishing, 2021. 10.1007\/978-3-030-91859-0_1","key":"18","DOI":"10.1007\/978-3-030-91859-0_1"},{"doi-asserted-by":"crossref","unstructured":"[20] K. Chalkias, F. Garillot, Y. Kondi, and V. Nikolaenko, \u201cNon-interactive half-aggregation of eddsa and variants of schnorr signatures,\u201d Topics in Cryptology - CT-RSA 2021, K.G. Paterson, ed., Cham, pp.577-608, Springer International Publishing, 2021. 10.1007\/978-3-030-75539-3_24","key":"19","DOI":"10.1007\/978-3-030-75539-3_24"},{"doi-asserted-by":"crossref","unstructured":"[21] Y. Chen and Y. Zhao, \u201cHalf-aggregation of schnorr signatures with tight reductions,\u201d Computer Security - ESORICS 2022, V. Atluri, R. Di Pietro, C.D. Jensen, and W. Meng, eds., Cham, pp.385-404, Springer Nature Switzerland, 2022. 10.1007\/978-3-031-17146-8_19","key":"20","DOI":"10.1007\/978-3-031-17146-8_19"},{"doi-asserted-by":"crossref","unstructured":"[22] K. Boudgoust and A. Takahashi, \u201cSequential half-aggregation of lattice-based signatures,\u201d Computer Security - ESORICS 2023, G. Tsudik, M. Conti, K. Liang, and G. Smaragdakis, eds., Cham, pp.270-289, Springer Nature Switzerland, 2024. 10.1007\/978-3-031-50594-2_14","key":"21","DOI":"10.1007\/978-3-031-50594-2_14"},{"doi-asserted-by":"publisher","unstructured":"[23] K. Takemure, Y. Sakai, B. Santoso, G. Hanaoka, and K. Ohta, \u201cAchieving pairing-free aggregate signatures using pre-communication between signers,\u201d IEICE Trans. Fundamentals, vol.E104-A, no.9, pp.1188-1205, Sept. 2021. 10.1587\/transfun.2020dmp0023","key":"22","DOI":"10.1587\/transfun.2020DMP0023"},{"doi-asserted-by":"publisher","unstructured":"[24] D. Pointcheval and J. Stern, \u201cSecurity arguments for digital signatures and blind signatures,\u201d J. Cryptol., vol.13, pp.361-396, 2000. 10.1007\/s001450010003","key":"23","DOI":"10.1007\/s001450010003"},{"doi-asserted-by":"crossref","unstructured":"[25] C.P. Schnorr, \u201cEfficient signature generation by smart cards,\u201d J. Cryptol., vol.4, no.3, p.161-174, Jan. 1991. 10.1007\/bf00196725","key":"24","DOI":"10.1007\/BF00196725"},{"doi-asserted-by":"crossref","unstructured":"[26] G. Fuchsbauer, E. Kiltz, and J. Loss, \u201cThe algebraic group model and its applications,\u201d Advances in Cryptology - CRYPTO 2018, H. Shacham and A. Boldyreva, eds., Cham, pp.33-62, Springer International Publishing, 2018. 10.1007\/978-3-319-96881-0_2","key":"25","DOI":"10.1007\/978-3-319-96881-0_2"}],"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\/E108.A\/9\/E108.A_2024DMP0005\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T03:33:17Z","timestamp":1757129597000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/9\/E108.A_2024DMP0005\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,1]]},"references-count":25,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2024dmp0005","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"type":"print","value":"0916-8508"},{"type":"electronic","value":"1745-1337"}],"subject":[],"published":{"date-parts":[[2025,9,1]]},"article-number":"2024DMP0005"}}