{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T08:32:50Z","timestamp":1720168370576},"reference-count":54,"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.2022cip0024","type":"journal-article","created":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T22:10:06Z","timestamp":1673388606000},"page":"170-184","source":"Crossref","is-referenced-by-count":1,"title":["APVAS: Reducing the Memory Requirement of AS_PATH Validation by Introducing Aggregate Signatures into BGPsec"],"prefix":"10.1587","volume":"E106.A","author":[{"given":"Ouyang","family":"JUNJIE","sequence":"first","affiliation":[{"name":"Graduate School of Information Science and Technology, Osaka University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoto","family":"YANAI","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Technology, Osaka University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatsuya","family":"TAKEMURA","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Technology, Osaka University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masayuki","family":"OKADA","sequence":"additional","affiliation":[{"name":"University of Nagasaki"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shingo","family":"OKAMURA","sequence":"additional","affiliation":[{"name":"National Institute of Technology, Nara College"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason Paul","family":"CRUZ","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Technology, Osaka University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] O. Junjie, N. Yanai, T. Takemura, M. Okada, S. Okamura, and J.P. Cruz, \u201cAPVAS: Reducing memory size of AS_PATH validation by using aggregate signatures,\u201d CoRR, vol.abs\/2008.13346, 2020. 10.48550\/arXiv.2008.13346"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] Y. Rekhter, S. Hares, and T. Li, \u201cA border gateway Protocol 4 (BGP-4),\u201d RFC 4271, 2006. 10.17487\/rfc4271","DOI":"10.17487\/rfc4271"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] P. Vervier, O. Thonnard, and M. Dacier, \u201cMind your blocks: On the stealthiness of malicious BGP hijacks,\u201d Proc. NDSS 2015, pp.1-15, Internet Society, 2015. 10.14722\/ndss.2015.23035","DOI":"10.14722\/ndss.2015.23035"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] M. Lepinski and S. Kent, \u201cAn infrastructure to support secure Internet routing,\u201d Request for Comments, RFC 6480, 2012. 10.17487\/rfc6480","DOI":"10.17487\/rfc6480"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] G. Huston and G.G. Michaelson, \u201cValidation of route origination using the resource certificate public key infrastructure (PKI) and route origin authorizations (ROAs),\u201d RFC 6483, 2012. 10.17487\/rfc6483","DOI":"10.17487\/rfc6483"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] M. Lepinski and K. Sriram, \u201cBGPsec protocol specification,\u201d RFC 8205, 2017. 10.17487\/rfc8205","DOI":"10.17487\/RFC8205"},{"key":"7","unstructured":"[7] K. Sriram, \u201cRIB size estimation for BGPSEC,\u201d 2011. https:\/\/www.nist.gov\/document-7096"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] M. Apostolaki, A. Zohar, and L. Vanbever, \u201cHijacking bitcoin: Routing attacks on cryptocurrencies,\u201d Proc. IEEE S&P 2017, pp.375-392, 2017. 10.1109\/sp.2017.29","DOI":"10.1109\/SP.2017.29"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] P. Ekparinya, V. Gramoli, and G. Jourjon, \u201cThe attack of the clones against proof-of-authority,\u201d Proc. NDSS 2020, pp.1-14, Internet Society, 2020. 10.14722\/ndss.2020.24082","DOI":"10.14722\/ndss.2020.24082"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] H. Birge-Lee, L. Wang, J. Rexford, and P. Mittal, \u201cSico: Surgical interception attacks by manipulating bgp communities,\u201d Proc. CCS 2019, pp.431-448, ACM, 2019. 10.1145\/3319535.3363197","DOI":"10.1145\/3319535.3363197"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] D. Boneh, C. Gentry, B. Lynn, and H. Shacham, \u201cAggregate and verifiably encrypted signatures from bilinear maps,\u201d Proc. EUROCRYPT 2003, LNCS, vol.2656, pp.416-432, Springer, 2003. 10.1007\/3-540-39200-9_26","DOI":"10.1007\/3-540-39200-9_26"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] A. Lysyanskaya, S. Micali, L. Reyzin, and H. Shacham, \u201cSequential aggregate signatures from trapdoor permutations,\u201d Proc. EUROCRYPT 2004, LNCS, vol.3027, pp.74-90, Springer, 2004. 10.1007\/978-3-540-24676-3_5","DOI":"10.1007\/978-3-540-24676-3_5"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] M. Zhao, S.W. Smith, and D.M. Nicol, \u201cAggregated path authentication for efficient BGP security,\u201d Proc. CCS 2005, pp.128-138, ACM, 2005. 10.1145\/1102120.1102139","DOI":"10.1145\/1102120.1102139"},{"key":"14","unstructured":"[14] K. Tanaka, N. Yanai, M. Okada, T. Nishide, and E. Okamoto, \u201cAPAT: An application of aggregate signatures to BGPSEC,\u201d Fast Abstract in DSN 2016, 2016."},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] T. Takemura, N. Yanai, N. Umeda, M. Okada, S. Okamura, and J.P. Cruz, \u201cAPVAS+: A practical extension of BGPsec with low memory requirement,\u201d Proc. ICC 2021, pp.1-8, IEEE, 2021. 10.1109\/icc42927.2021.9500278","DOI":"10.1109\/ICC42927.2021.9500278"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] S. Kent, C. Lynn, and K. Seo, \u201cSecure border gateway protocol (S-BGP),\u201d IEEE J. Sel. Areas Commun., vol.18, no.4, pp.582-592, 2000. 10.1109\/49.839934","DOI":"10.1109\/49.839934"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] R.R. Sambasivan, D. Tran-Lam, A. Akella, and P. Steenkiste, \u201cBootstrapping evolvability for inter-domain routing with d-bgp,\u201d Proc. SIGCOMM 2017, pp.474-487, ACM, 2017. 10.1145\/3098822.3098857","DOI":"10.1145\/3098822.3098857"},{"key":"18","unstructured":"[18] S. Pouryousef, L. Gao, and A. Venkataramani, \u201cTowards logically centralized interdomain routing,\u201d Proc. NSDI 2020, pp.739-757, USENIX Association, 2020."},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] N. Umeda, N. Yanai, T. Takemura, M. Okada, J.P. Cruz, and S. Okamura, \u201cSQUAB: A virtualized infrastructure for experiments on BGP and its extensions,\u201d Proc. AINA 2021, LNNS, vol.225, pp.600-613, Springer, 2021. 10.1007\/978-3-030-75100-5_52","DOI":"10.1007\/978-3-030-75100-5_52"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] M. Brandt and H. Shulman, \u201cOptimized BGP simulator for evaluation of internet hijacks,\u201d Proc. IEEE INFOCOM WKSHPS 2021, pp.1-2, IEEE, 2021. 10.1109\/infocomwkshps51825.2021.9484563","DOI":"10.1109\/INFOCOMWKSHPS51825.2021.9484563"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] K. Sriram and D.C. Montgomery, \u201cResilient interdomain traffic exchange: BGP security and DDos mitigation,\u201d NIST Report, 2019. 10.6028\/nist.sp.800-189-draft2","DOI":"10.6028\/NIST.SP.800-189"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] J.M. Smith, K. Birkeland, T. McDaniel, and M. Schuchard, \u201cWithdrawing the BGP re-routing curtain: Understanding the security impact of bgp poisoning through real-world measurements,\u201d Proc. NDSS 2020, pp.1-18, Internet Society, 2020. 10.14722\/ndss.2020.24240","DOI":"10.14722\/ndss.2020.24240"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] R. Morillo, J. Furuness, C. Morris, J. Breslin, A. Herzberg, and B. Wang, \u201cROV++: Improved deployable defense against BGP hijacking,\u201d Proc. NDSS 2021, Internet Society, 2021. 10.14722\/ndss.2021.24438","DOI":"10.14722\/ndss.2021.24438"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] R. Lychev, S. Goldberg, and M. Schapira, \u201cBGP security in partial deployment: Is the juice worth the squeeze?,\u201d SIGCOMM Computer Communication Review, vol.43, no.4, p.171-182, 2013. 10.1145\/2534169.2486010","DOI":"10.1145\/2534169.2486010"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] Y. Yang, X. Shi, Q. Ma, Y. Li, X. Yin, and Z. Wang, \u201cPath stability in partially deployed secure bgp routing,\u201d Computer Networks, vol.206, p.108762, 2022. 10.1016\/j.comnet.2022.108762","DOI":"10.1016\/j.comnet.2022.108762"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] S. Goldberg, \u201cWhy is it taking so long to secure internet routing?,\u201d Queue, vol.12, no.8, p.20-33, 2014. 10.1145\/2668152.2668966","DOI":"10.1145\/2668152.2668966"},{"key":"27","doi-asserted-by":"publisher","unstructured":"[27] R. Lychev, M. Schapira, and S. Goldberg, \u201cRethinking security for internet routing,\u201d Commun. ACM, vol.59, no.10, pp.48-57, 2016. 10.1145\/2896817","DOI":"10.1145\/2896817"},{"key":"28","doi-asserted-by":"publisher","unstructured":"[28] P. Sermpezis, V. Kotronis, P. Gigis, X. Dimitropoulos, D. Cicalese, A. King, and A. Dainotti, \u201cARTEMIS: Neutralizing BGP hijacking within a minute,\u201d IEEE\/ACM Trans. Netw., vol.26, no.6, pp.2471-2486, 2018. 10.1109\/tnet.2018.2869798","DOI":"10.1109\/TNET.2018.2869798"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] C. Gentry and Z. Ramzan, \u201cIdentity-based aggregate signatures,\u201d Proc. PKC 2006, LNCS, vol.3958, pp.257-273, Springer, 2006. 10.1007\/11745853_17","DOI":"10.1007\/11745853_17"},{"key":"30","doi-asserted-by":"publisher","unstructured":"[30] S. Hohenberger, A. Sahai, and B. Waters, \u201cFull domain hash from (leveled) multilinear maps and identity-based aggregate signatures,\u201d Proc. CRYPTO 2013, LNCS, vol.8042, pp.494-512, Springer, 2013. 10.1007\/978-3-642-40041-4_27","DOI":"10.1007\/978-3-642-40041-4_27"},{"key":"31","doi-asserted-by":"crossref","unstructured":"[31] S. Hohenberger, V. Koppula, and B. Waters, \u201cUniversal signature aggregators,\u201d Proc. EUROCRYPT 2015, LNCS, vol.9057, pp.3-34, Springer, 2015. 10.1007\/978-3-662-46803-6_1","DOI":"10.1007\/978-3-662-46803-6_1"},{"key":"32","doi-asserted-by":"crossref","unstructured":"[32] B. Liang, H. Li, and J. Chang, \u201cThe generic transformation from standard signatures to identity-based aggregate signatures,\u201d Proc. ISC 2015, LNCS, vol.9290, pp.21-41, Springer, 2015. 10.1007\/978-3-319-23318-5_2","DOI":"10.1007\/978-3-319-23318-5_2"},{"key":"33","doi-asserted-by":"crossref","unstructured":"[33] J.H. Ahn, M. Green, and S. Hohenberger, \u201cSynchronized aggregate signatures: New definitions, constructions and applications,\u201d Proc. CCS 2010, pp.473-484, ACM, 2010. 10.1145\/1866307.1866360","DOI":"10.1145\/1866307.1866360"},{"key":"34","doi-asserted-by":"crossref","unstructured":"[34] S. Hohenberger and B. Waters, \u201cSynchronized aggregate signatures from the RSA assumption,\u201d Proc. EUROCRYPT 2018, LNCS, vol.10821, pp.197-229, Springer, 2018. 10.1007\/978-3-319-78375-8_7","DOI":"10.1007\/978-3-319-78375-8_7"},{"key":"35","doi-asserted-by":"publisher","unstructured":"[35] 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","DOI":"10.1587\/transfun.2020DMP0023"},{"key":"36","doi-asserted-by":"publisher","unstructured":"[36] Y. Yao, Z. Li, and H. Guo, \u201cA unified framework of identity-based sequential aggregate signatures from 2-level hibe schemes,\u201d Information Sciences, vol.516, pp.505-514, 2020. 10.1016\/j.ins.2019.12.076","DOI":"10.1016\/j.ins.2019.12.076"},{"key":"37","doi-asserted-by":"crossref","unstructured":"[37] C. Gentry, A. O'Neill, and L. Reyzin, \u201cA unified framework for trapdoor-permutation-based sequential aggregate signatures,\u201d Proc. PKC 2018, LNCS, vol.10770, pp.34-57, Springer, 2018. 10.1007\/978-3-319-76581-5_2","DOI":"10.1007\/978-3-319-76581-5_2"},{"key":"38","unstructured":"[38] A. Boldyreva, C. Gentry, A. O'Neill, and D. Yum, \u201cOrdered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing (extended abstract),\u201d 2010."},{"key":"39","doi-asserted-by":"crossref","unstructured":"[39] M. Fischlin, A. Lehmann, and D. Schr\u00f6der, \u201cHistory-free sequential aggregate signatures,\u201d Proc. SCN 2012, LNCS, vol.7485, pp.113-130, Springer, 2012. 10.1007\/978-3-642-32928-9_7","DOI":"10.1007\/978-3-642-32928-9_7"},{"key":"40","doi-asserted-by":"crossref","unstructured":"[40] K. Brogle, S. Goldberg, and L. Reyzin, \u201cSequential aggregate signatures with lazy verification from trapdoor permutations-(extended abstract),\u201d Proc. ASIACRYPT 2012, LNCS, vol.7658, pp.644-662, Springer, 2012. 10.1007\/978-3-642-34961-4_39","DOI":"10.1007\/978-3-642-34961-4_39"},{"key":"41","doi-asserted-by":"crossref","unstructured":"[41] N. Yanai, M. Mambo, K. Tanaka, T. Nishide, and E. Okamoto, \u201cAnother look at aggregate signatures: Their capability and security on network graphs,\u201d Proc. INTRUST 2015, LNCS, vol.9565, pp.32-48, Springer, 2015. 10.1007\/978-3-319-31550-8_3","DOI":"10.1007\/978-3-319-31550-8_3"},{"key":"42","doi-asserted-by":"crossref","unstructured":"[42] G. Hartung, B. Kaidel, A. Koch, J. Koch, and A. Rupp, \u201cFault-tolerant aggregate signatures,\u201d Proc. PKC 2016, LNCS, vol.9614, pp.331-356, Springer, 2016. 10.1007\/978-3-662-49384-7_13","DOI":"10.1007\/978-3-662-49384-7_13"},{"key":"43","doi-asserted-by":"crossref","unstructured":"[43] R. Ishii, K. Yamashita, Y. Sakai, T. Matsuda, T. Teruya, G. Hanaoka, K. Matsuura, and T. Matsumoto, \u201cAggregate signature with traceability of devices dynamically generating invalid signatures,\u201d Proc. of ACNSW, LNCS, vol.12809, pp.378-396, Springer, 2021.","DOI":"10.1007\/978-3-030-81645-2_22"},{"key":"44","doi-asserted-by":"crossref","unstructured":"[44] J.S. Coron and D. Naccache, \u201cBoneh et al.'s k-element aggregate extraction assumption is equivalent to the diffie-hellman assumption,\u201d Proc. ASIACRYPT 2003, LNCS, vol.2894, pp.392-397, Springer, 2003. 10.1007\/978-3-540-40061-5_25","DOI":"10.1007\/978-3-540-40061-5_25"},{"key":"45","doi-asserted-by":"crossref","unstructured":"[45] A. Boldyreva, \u201cThreshold signatures, multisignatures and blind signatures based on the Gap-Diffie-Hellman-group signature scheme,\u201d Proc. PKC 2003, LNCS, vol.2567, pp.31-46, Springer, 2003. 10.1007\/3-540-36288-6_3","DOI":"10.1007\/3-540-36288-6_3"},{"key":"46","doi-asserted-by":"crossref","unstructured":"[46] S. Lu, R. Ostrovsky, A. Sahai, H. Shacham, and B. Waters, \u201cSequential aggregate signatures and multisignatures without random oracle,\u201d Proc. EUROCRYPT 2006, LNCS, vol.4004, pp.465-485, Springer, 2006. 10.1007\/11761679_28","DOI":"10.1007\/11761679_28"},{"key":"47","doi-asserted-by":"crossref","unstructured":"[47] M. Bellare and P. Rogaway, \u201cRandom oracles are practical: A paradigm for designing efficient protocols,\u201d Proc. CCS 1993, pp.62-73, ACM, 1993. 10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"48","unstructured":"[48] \u201cBird bgpsec,\u201d http:\/\/www.securerouting.net\/tools\/bird\/"},{"key":"49","doi-asserted-by":"crossref","unstructured":"[49] T. Chung, E. Aben, T. Bruijnzeels, B. Chandrasekaran, D. Choffnes, D. Levin, B.M. Maggs, A. Mislove, R.V. Rijswijk-Deij, J. Rula, and N. Sullivan, \u201cRPKI is coming of age: A longitudinal study of RPKI deployment and invalid route origins,\u201d Proc. IMC 2019, pp.406-419, ACM, 2019. 10.1145\/3355369.3355596","DOI":"10.1145\/3355369.3355596"},{"key":"50","doi-asserted-by":"crossref","unstructured":"[50] T. Hlavacek, I. Cunha, Y. Gilad, A. Herzberg, E. Katz-Bassett, M. Schapira, and H. Shulman, \u201cDISCO: Sidestepping RPKI's deployment barriers,\u201d Proc. NDSS 2020, Internet Society, 2020. 10.14722\/ndss.2020.24355","DOI":"10.14722\/ndss.2020.24355"},{"key":"51","doi-asserted-by":"crossref","unstructured":"[51] C. Wang, Z. Li, X. Huang, and P. Zhang, \u201cInferring the average as path length of the internet,\u201d Proc. IC-NIDC, pp.391-395, IEEE, 2016. 10.1109\/icnidc.2016.7974603","DOI":"10.1109\/ICNIDC.2016.7974603"},{"key":"52","doi-asserted-by":"crossref","unstructured":"[52] M. Okada, Y. Katsuno, A. Kanaoka, and E. Okamoto, \u201c32-bit as number based IP traceback,\u201d Proc. IMIS 2011, pp.628-633, IEEE, 2011. 10.1109\/imis.2011.95","DOI":"10.1109\/IMIS.2011.95"},{"key":"53","doi-asserted-by":"crossref","unstructured":"[53] C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian, \u201cDelayed internet routing convergence,\u201d Proc. SIGCOMM 2000, pp.175-187, ACM, 2000.","DOI":"10.1145\/347057.347428"},{"key":"54","doi-asserted-by":"publisher","unstructured":"[54] R.B. da Silva and E. Souza Mota, \u201cA survey on approaches to reduce BGP interdomain routing convergence delay on the internet,\u201d IEEE Commun. Surveys Tuts., vol.19, no.4, pp.2949-2984, 2017. 10.1109\/comst.2017.2722380","DOI":"10.1109\/COMST.2017.2722380"}],"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_2022CIP0024\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T03:20:33Z","timestamp":1677900033000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/3\/E106.A_2022CIP0024\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,1]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2022cip0024","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":"2022CIP0024"}}