{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T03:41:11Z","timestamp":1677901271612},"reference-count":41,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2023,3,1]]},"DOI":"10.1587\/transfun.2022cip0017","type":"journal-article","created":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T22:09:08Z","timestamp":1662588548000},"page":"228-240","source":"Crossref","is-referenced-by-count":0,"title":["Short Lattice Signature Scheme with Tighter Reduction under Ring-SIS Assumption"],"prefix":"10.1587","volume":"E106.A","author":[{"given":"Kaisei","family":"KAJITA","sequence":"first","affiliation":[{"name":"Science and Technology Research Laboratories, Japan Broadcasting Corporation"}]},{"given":"Go","family":"OHTAKE","sequence":"additional","affiliation":[{"name":"Science and Technology Research Laboratories, Japan Broadcasting Corporation"}]},{"given":"Kazuto","family":"OGAWA","sequence":"additional","affiliation":[{"name":"Science and Technology Research Laboratories, Japan Broadcasting Corporation"}]},{"given":"Koji","family":"NUIDA","sequence":"additional","affiliation":[{"name":"Kyushu University"}]},{"given":"Tsuyoshi","family":"TAKAGI","sequence":"additional","affiliation":[{"name":"The University of Tokyo"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] M. Abe, N. Chase, B. David, M. Kohlweiss, R. Nishimaki, and M. Ohkubo, \u201cConstant-size structure-preserving signatures: Generic constructions and simple assumptions,\u201d J. Cryptol., vol.29, no.4, pp.833-878, Springer, 2016. 10.1007\/s00145-015-9211-7","DOI":"10.1007\/s00145-015-9211-7"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] M. Ajtai, \u201cGenerating hard instances of lattice problems,\u201d STOC, pp.99-108, ACM, 1996. 10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] M. Ajtai and C. Dwork, \u201cA public-key cryptosystem with worst-case\/average-case equivalence,\u201d STOC, pp.284-293, ACM, 1997. 10.1145\/258533.258604","DOI":"10.1145\/258533.258604"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] J. Alperin-Sheriff, \u201cShort signatures with short public keys from homomorphic trapdoor functions,\u201d PKC, pp.236-255, Springer, 2015. 10.1007\/978-3-662-46447-2_11","DOI":"10.1007\/978-3-662-46447-2_11"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] R.E. Bansarkhani and J. Buchmann, \u201cTowards lattice based aggregate signatures,\u201d International Conference on Cryptology in Africa, pp.336-355, Springer, Cham, 2014. 10.1007\/978-3-319-06734-6_21","DOI":"10.1007\/978-3-319-06734-6_21"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] C. Baum, I. Damg\u00e5rd, V. Lyubashevsky, S. Oechsner, and C. Peikert, \u201cMore efficient commitments from structured lattice assumptions,\u201d SCN, pp.368-385, Springer, 2018. 10.1007\/978-3-319-98113-0_20","DOI":"10.1007\/978-3-319-98113-0_20"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] D. Boneh and M. Franklin, \u201cIdentity-based encryption from the Weil pairing,\u201d CRYPTO, pp.213-229, Springer, 2001. 10.1007\/3-540-44647-8_13","DOI":"10.1007\/3-540-44647-8_13"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] O. Blazy, S.A. Kakvi, E. Kiltz, and J. Pan, \u201cTightly-secure signatures from Chameleon hash functions,\u201d PKC, pp.256-279, Springer, 2015. 10.1007\/978-3-662-46447-2_12","DOI":"10.1007\/978-3-662-46447-2_12"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] F. B\u00f6hl, D. Hofheinz, T. Jager, J. Koch, J.H. Seo, and C. Striecks, \u201cPractical signatures from standard assumptions,\u201d EUROCRYPT, pp.461-485, Springer, 2013. 10.1007\/978-3-642-38348-9_28","DOI":"10.1007\/978-3-642-38348-9_28"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] X. Boyen, \u201cLattice mixing and vanishing trapdoors: A framework for fully secure short signatures and more,\u201d PKC, pp.499-517, Springer, 2010. 10.1007\/978-3-642-13013-7_29","DOI":"10.1007\/978-3-642-13013-7_29"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] X. Boyen and Q. Li, \u201cTowards tightly secure lattice short signature and Id-based encryption,\u201d ASIACRYPT, pp.404-434, Part II, Springer, 2016. 10.1007\/978-3-662-53890-6_14","DOI":"10.1007\/978-3-662-53890-6_14"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert, \u201cBonsai trees, or how to delegate a lattice basis,\u201d EUROCRYPT, pp.523-552, Springer, 2010. 10.1007\/978-3-642-13190-5_27","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] B. Chevallier-Mames and M. Joye, \u201cA practical and tightly secure signature scheme without hash function,\u201d CT-RSA, pp.339-356, Springer, 2007. 10.1007\/11967668_22","DOI":"10.1007\/11967668_22"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] I. Damg\u00e5rd, \u201cEfficient concurrent zero-knowledge in the auxiliary string model,\u201d EUROCRYPT, pp.418-430, Springer, 2000. 10.1007\/3-540-45539-6_30","DOI":"10.1007\/3-540-45539-6_30"},{"key":"15","unstructured":"[15] I. Dam\u00e5grd, 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 Cryptology ePrint Archive, Report 2020\/1110, 2020."},{"key":"16","unstructured":"[16] J. Ding, M. Chen, A. Petzoldt, D. Schmidt, and B. Yang, \u201cRainbow-algorithm specification and documentation,\u201d Technical Report, NIST, 2019. https:\/\/csrc.nist.gov\/Projects\/post-quantumcryptography\/round-3-submissions, Accessed: March 10, 2021."},{"key":"17","unstructured":"[17] L. Ducas, T. Lepoint, V. Lyubashevsky, P. Schwabe, G. Seiler, and D. Stehl\u00e9, \u201cCRYSTALS-Dilithium: Digital signatures from module lattices,\u201d Technical Report, NIST, 2020, https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-3-submissions, Accessed: March 10, 2021."},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] L. Ducas and D. Micciancio, \u201cImproved short lattice signature in the standard model,\u201d CRYPTO, pp.335-352, Springer, 2014. 10.1007\/978-3-662-44371-2_19","DOI":"10.1007\/978-3-662-44371-2_19"},{"key":"19","unstructured":"[19] P.A. Fouque, J. Hoffstein, P. Kirchner, V. Lyubashevsky, T. Pornin, T. Prest, T. Ricosset, G. Seiler, W. Whyte, and Z. Zhang, \u201cFalcon: Fast-Fourier lattice-based compact signatures over NTRU,\u201d Technical Report, NIST, 2020. https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-3-submissions, Accessed: March 10, 2021."},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] S. Goldwasser, S. Micali, and R.L. Rivest, \u201cA digital signature scheme secure against adaptive chosen-message attacks,\u201d SIAM J. Comput., vol.17, no.2, pp.281-308, 1988. 10.1137\/0217017","DOI":"10.1137\/0217017"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] O. Goldreich, Foundations of Cryptography, Volume II-Basic Applications, Cambridge University Press, 2004.","DOI":"10.1017\/CBO9780511721656"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] C. Gentry, C. Peikert, and V. Vaikuntanathan, \u201cTrapdoors for hard lattices and new cryptographic constructions,\u201d STOC, pp.197-206, ACM, 2008. 10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] D. Hofheinz, T. Jager, and E. Knapp, \u201cWaters signatures with optimal security reduction,\u201d PKC, pp.66-83, Springer, 2012. 10.1007\/978-3-642-30057-8_5","DOI":"10.1007\/978-3-642-30057-8_5"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] S. Hohenberger and B. Waters, \u201cRealizing hash-and-sign signatures under standard assumptions,\u201d EUROCRYPT, pp.333-350, Springer, 2009. 10.1007\/978-3-642-01001-9_19","DOI":"10.1007\/978-3-642-01001-9_19"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] S. Hohenberger, and B. Waters, \u201cShort and stateless signatures from the RSA assumption,\u201d CRYPTO, pp.654-670, Springer, 2009. 10.1007\/978-3-642-03356-8_38","DOI":"10.1007\/978-3-642-03356-8_38"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] Z. Jing, \u201cAn efficient homomorphic aggregate signature scheme based on lattice,\u201d Math. Probl. Eng., vol.2014, 2014. 10.1155\/2014\/536527","DOI":"10.1155\/2014\/536527"},{"key":"27","doi-asserted-by":"publisher","unstructured":"[27] K. Kajita, K. Ogawa, and E. Fujisaki, \u201cA constant-size signature scheme with a tighter reduction from the CDH assumption,\u201d IEICE Trans. Fundamentals, vol.E103-A, no.1, pp.141-149, Jan. 2020. 10.1587\/transfun.2019cip0015","DOI":"10.1587\/transfun.2019CIP0015"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] K. Kajita, K. Ogawa, K. Nuida, and T. Takagi, \u201cShort lattice signatures in the standard model with efficient tag generation,\u201d ProvSec, pp.85-102, Springer, 2020. 10.1007\/978-3-030-62576-4_5","DOI":"10.1007\/978-3-030-62576-4_5"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] A. Kawachi, K. Tanaka, and K. Xagawa, \u201cConcurrently secure identification schemes based on the worst-case hardness of lattice problems,\u201d ASIACRYPT, pp.372-389, Springer, 2008. 10.1007\/978-3-540-89255-7_23","DOI":"10.1007\/978-3-540-89255-7_23"},{"key":"30","doi-asserted-by":"publisher","unstructured":"[30] X. Lu, W. Yin, Q. Wen, Z. Jin, and W. Li, \u201cA lattice-based unordered aggregate signature scheme based on the intersection method,\u201d IEEE Access, vol.6, pp.33986-33994, 2018. 10.1109\/access.2018.2847411","DOI":"10.1109\/ACCESS.2018.2847411"},{"key":"31","doi-asserted-by":"crossref","unstructured":"[31] V. Lyubashevsky and D. Micciancio, \u201cAsymptotically efficient lattice-based digital signatures,\u201d TCC, pp.37-54, Springer, 2008. 10.1007\/978-3-540-78524-8_3","DOI":"10.1007\/978-3-540-78524-8_3"},{"key":"32","doi-asserted-by":"publisher","unstructured":"[32] V. Lyubashevsky, D. Micciancio, C. Peikert, and A. Rosen, \u201cSWIFFT: A modest proposal for FFT hashing,\u201d FSE, pp.54-72, Springer, 2008. 10.1007\/978-3-540-71039-4_4","DOI":"10.1007\/978-3-540-71039-4_4"},{"key":"33","doi-asserted-by":"publisher","unstructured":"[33] D. Micciancio, \u201cGeneralized compact knapsacks, cyclic lattices, and efficient one-way functions,\u201d Comput. Complex., vol.16, no.4, pp.365-411, Schloss Dagstuhl, 2007. 10.1007\/s00037-007-0234-9","DOI":"10.1007\/s00037-007-0234-9"},{"key":"34","doi-asserted-by":"crossref","unstructured":"[34] D. Micciancio, and C. Peikert, \u201cTrapdoors for lattices: Simpler, tighter, faster, smaller,\u201d EUROCRYPT, pp.700-718, Springer, 2012. 10.1007\/978-3-642-29011-4_41","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"35","unstructured":"[35] National Institute of Standards and Technology, \u201cPost-quantum cryptography,\u201d 2019. https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography, Accessed: March 10, 2021."},{"key":"36","unstructured":"[36] National Institute of Standards and Technology, \u201cPost-quantum cryptography \u2014 Round 3 submissions,\u201d 2020. https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-3-submissions, Accessed: March 10, 2021."},{"key":"37","doi-asserted-by":"crossref","unstructured":"[37] C. Peikert, \u201cAn efficient and parallel Gaussian sampler for lattices,\u201d CRYPTO, pp.80-97, Springer, 2010. 10.1007\/978-3-642-14623-7_5","DOI":"10.1007\/978-3-642-14623-7_5"},{"key":"38","doi-asserted-by":"crossref","unstructured":"[38] S. Schage, \u201cTight proofs for signature schemes without random oracles,\u201d EUROCRYPT, pp.189-206, Springer, 2011. 10.1007\/978-3-642-20465-4_12","DOI":"10.1007\/978-3-642-20465-4_12"},{"key":"39","unstructured":"[39] P.W. Shor, \u201cAlgorithms for quantum computation: Discrete logarithms and factoring,\u201d FOCS, pp.124-134, IEEE, 1994. 10.1109\/sfcs.1994.365700"},{"key":"40","doi-asserted-by":"crossref","unstructured":"[40] Z. Wang and Q. Wu, \u201cA practical lattice-based sequential aggregate signature,\u201d International Conference on Provable Security, pp.94-109, Springer, Cham, 2019. 10.1007\/978-3-030-31919-9_6","DOI":"10.1007\/978-3-030-31919-9_6"},{"key":"41","unstructured":"[41] P. Zhang, J. Yu, and T. Wang, \u201cA homomorphic aggregate signature scheme based on lattice,\u201d Chinese Journal of Electronics, vol.21, no.4, pp.701-704, 2012."}],"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\/E106.A\/3\/E106.A_2022CIP0017\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T03:19:54Z","timestamp":1677899994000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/3\/E106.A_2022CIP0017\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,1]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2022cip0017","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,1]]},"article-number":"2022CIP0017"}}