{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T04:02:23Z","timestamp":1747368143709,"version":"3.40.5"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031928857","type":"print"},{"value":"9783031928864","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-92886-4_16","type":"book-chapter","created":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T06:13:09Z","timestamp":1747289589000},"page":"234-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Quantum Algorithm for\u00a0Assessing Node Importance in\u00a0the\u00a0st-Connectivity Attack"],"prefix":"10.1007","author":[{"given":"Iain","family":"Burge","sequence":"first","affiliation":[]},{"given":"Michel","family":"Barbeau","sequence":"additional","affiliation":[]},{"given":"Joaquin","family":"Garcia-Alfaro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,16]]},"reference":[{"key":"16_CR1","unstructured":"Ahuja, A., Kapoor, S.: A quantum algorithm for finding the maximum (1999). https:\/\/arxiv.org\/abs\/quant-ph\/9911082"},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1038\/s41598-022-05690-1","volume":"12","author":"M Barbeau","year":"2022","unstructured":"Barbeau, M., Garcia-Alfaro, J.: Cyber-physical defense in the quantum era. Sci. Rep. 12(1), 1905 (2022)","journal-title":"Sci. Rep."},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3517341","volume":"3","author":"M Barbeau","year":"2022","unstructured":"Barbeau, M., Kranakis, E., Perez, N.: Authenticity, integrity, and replay protection in quantum data communications and networking. ACM Trans. Quant. Comput. 3(2), 1\u201322 (2022)","journal-title":"ACM Trans. Quant. Comput."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Belovs, A., Reichardt, B.W.: Span programs and quantum algorithms for st-connectivity and claw detection. In: European Symposium on Algorithms, pp. 193\u2013204. Springer (2012)","DOI":"10.1007\/978-3-642-33090-2_18"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Burge, I., Barbeau, M., Garcia-Alfaro, J.: Quantum algorithms for shapley value calculation. In: 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), vol.\u00a01, pp.\u00a01\u20139. IEEE (2023)","DOI":"10.1109\/QCE57702.2023.00024"},{"key":"16_CR6","unstructured":"Burge, I., Barbeau, M., Garcia-Alfaro, J.: A shapley value estimation speedup for efficient explainable quantum AI. arXiv preprint arXiv:2412.14639 (2024)"},{"key":"16_CR7","unstructured":"Cade, C., Montanaro, A., Belovs, A.: Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness. arXiv preprint arXiv:1610.00581 (2016)"},{"key":"16_CR8","doi-asserted-by":"publisher","unstructured":"Campbell, R., Diffie, W., Robinson, C.: Advancements in quantum computing and AI may impact PQC migration timelines (2024). https:\/\/doi.org\/10.20944\/preprints202402.1299.v1","DOI":"10.20944\/preprints202402.1299.v1"},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1109\/COMST.2022.3144219","volume":"24","author":"Y Cao","year":"2022","unstructured":"Cao, Y., Zhao, Y., Wang, Q., Zhang, J., Ng, S.X., Hanzo, L.: The evolution of quantum key distribution networks: on the road to the QInternet. IEEE Communicat. Surv. Tutor. 24(2), 839\u2013894 (2022)","journal-title":"IEEE Communicat. Surv. Tutor."},{"issue":"5","key":"16_CR10","doi-asserted-by":"publisher","first-page":"1726","DOI":"10.1016\/j.cor.2008.04.004","volume":"36","author":"J Castro","year":"2009","unstructured":"Castro, J., G\u00f3mez, D., Tejada, J.: Polynomial calculation of the Shapley value based on sampling. Comput. Oper. Res. 36(5), 1726\u20131730 (2009)","journal-title":"Comput. Oper. Res."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Chareton, C., Bardin, S., Bobot, F., Perrelle, V., Valiron, B.: An automated deductive verification framework for circuit-building quantum programs. In: Programming Languages and Systems: 30th European Symposium on Programming, ESOP 2021, pp. 148\u2013177. Springer (2021)","DOI":"10.1007\/978-3-030-72019-3_6"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1613\/jair.3806","volume":"46","author":"TP Michalak","year":"2013","unstructured":"Michalak, T.P., Aadithya, K.V., Szczepanski, P.L., Ravindran, B., Jennings, N.R.: Efficient computation of the shapley value for game-theoretic network centrality. J. Artif. Intell. Res. 46, 607\u2013650 (2013)","journal-title":"J. Artif. Intell. Res."},{"issue":"2181","key":"16_CR13","doi-asserted-by":"publisher","first-page":"20150301","DOI":"10.1098\/rspa.2015.0301","volume":"471","author":"A Montanaro","year":"2015","unstructured":"Montanaro, A.: Quantum speedup of Monte Carlo methods. Proc. Roy. Soc. A: Math. Phys. Eng. Sci. 471(2181), 20150301 (2015)","journal-title":"Proc. Roy. Soc. A: Math. Phys. Eng. Sci."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Noirie, L.: From existing quantum key distribution systems towards future quantum networks. In: 13th International Conference on Communications, Circuits, and Systems (ICCCAS 2024) (2024)","DOI":"10.1109\/ICCCAS62034.2024.10652815"},{"issue":"1","key":"16_CR15","first-page":"26","volume":"62","author":"H Robbins","year":"1955","unstructured":"Robbins, H.: A remark on Stirling\u2019s formula. Am. Math. Mon. 62(1), 26\u201329 (1955)","journal-title":"Am. Math. Mon."},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Shapley, L.S.: A Value for N-Person Games. RAND Corporation, Santa Monica (1952). https:\/\/doi.org\/10.7249\/P0295","DOI":"10.7249\/P0295"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Szegedy, M.: Quantum speed-up of Markov chain based algorithms. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 32\u201341. IEEE (2004)","DOI":"10.1109\/FOCS.2004.53"},{"key":"16_CR18","unstructured":"Tarkowski, M.K., Michalak, T.P., Rahwan, T., Wooldridge, M.: Game-theoretic network centrality: a review. arXiv preprint arXiv:1801.00218 (2017)"}],"container-title":["IFIP Advances in Information and Communication Technology","ICT Systems Security and Privacy Protection"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92886-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T06:13:16Z","timestamp":1747289596000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92886-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031928857","9783031928864"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92886-4_16","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"value":"1868-4238","type":"print"},{"value":"1868-422X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"16 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on ICT Systems Security and Privacy Protection","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Maribor","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sec2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sec2025.um.si\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}