{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T05:10:58Z","timestamp":1781673058455,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","funder":[{"name":"Porvir-5G Research Project","award":["Grant 20\/05182-3"],"award-info":[{"award-number":["Grant 20\/05182-3"]}]},{"name":"Ericsson Telecomunica\u00e7\u00f5es Ltda and by the Sao Paulo Research Foundation","award":["Grant 2021\/00199-8"],"award-info":[{"award-number":["Grant 2021\/00199-8"]}]},{"name":"Fapes","award":["941\/2022, 732\/2024"],"award-info":[{"award-number":["941\/2022, 732\/2024"]}]},{"name":"Capes","award":["Grant 312058\/2023-3"],"award-info":[{"award-number":["Grant 312058\/2023-3"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,9,8]]},"DOI":"10.1145\/3744969.3748446","type":"proceedings-article","created":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T19:14:48Z","timestamp":1757531688000},"page":"178-180","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["CRC4EVER: Cyclic Redundancy Check for Enhanced Verification and Efficient Routing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8521-829X","authenticated-orcid":false,"given":"Everson","family":"Borges","sequence":"first","affiliation":[{"name":"UFES"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1165-2808","authenticated-orcid":false,"given":"Fabricio","family":"Rodriguez","sequence":"additional","affiliation":[{"name":"Telefonica Research"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6856-9576","authenticated-orcid":false,"given":"Rafael Silva","family":"Guimar\u00e3es","sequence":"additional","affiliation":[{"name":"IFES"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8111-1719","authenticated-orcid":false,"given":"Magnos","family":"Martinello","sequence":"additional","affiliation":[{"name":"UFES"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7803-1830","authenticated-orcid":false,"given":"Cristina K.","family":"Dominicini","sequence":"additional","affiliation":[{"name":"IFES"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9149-2391","authenticated-orcid":false,"given":"Moises R. N.","family":"Ribeiro","sequence":"additional","affiliation":[{"name":"UFES"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5002-0187","authenticated-orcid":false,"given":"Eduard","family":"Marin","sequence":"additional","affiliation":[{"name":"Telefonica Research"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3109-4305","authenticated-orcid":false,"given":"Christian","family":"Rothenberg","sequence":"additional","affiliation":[{"name":"Unicamp"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,9,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/NFV-SDN61811.2024.10978976"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","unstructured":"Cristina Dominicini et al. 2020. PolKA: Polynomial Key-based Architecture for Source Routing in Network Fabrics. In NetSoft. 326--334. https:\/\/doi.org\/10.1109\/NetSoft48620.2020.9165501","DOI":"10.1109\/NetSoft48620.2020.9165501"},{"key":"e_1_3_2_1_3_1","volume-title":"Lindell","author":"Katz Jonathan","year":"2008","unstructured":"Jonathan Katz and Andrew Y. Lindell. 2008. Aggregate Message Authentication Codes. In Topics in Cryptology - CT-RSA 2008, Tal Malkin (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 155--169."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3472727.3472808"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 29th USENIX Conference on Security Symposium (SEC'20)","author":"Markus","unstructured":"Markus Legner et al. 2020. EPIC: every packet is checked in the data plane of a path-aware internet. In Proceedings of the 29th USENIX Conference on Security Symposium (SEC'20). USENIX, USA, Article 31, 18 pages."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the Seventh CoNEXT. 1--12","author":"Jad","unstructured":"Jad Naous et al. 2011. Verifying and enforcing network paths with ICING. In Proceedings of the Seventh CoNEXT. 1--12."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3546037.3546046"}],"event":{"name":"SIGCOMM '25: ACM SIGCOMM 2025 Conference","location":"Coimbra Portugal","acronym":"SIGCOMM '25","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the ACM SIGCOMM 2025 Posters and Demos"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3744969.3748446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T18:28:34Z","timestamp":1760466514000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3744969.3748446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,8]]},"references-count":7,"alternative-id":["10.1145\/3744969.3748446","10.1145\/3744969"],"URL":"https:\/\/doi.org\/10.1145\/3744969.3748446","relation":{},"subject":[],"published":{"date-parts":[[2025,9,8]]},"assertion":[{"value":"2025-09-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}