{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:18:52Z","timestamp":1766269132132,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/infcom.2004.1354494","type":"proceedings-article","created":{"date-parts":[[2004,12,23]],"date-time":"2004-12-23T09:34:02Z","timestamp":1103794442000},"page":"197-208","source":"Crossref","is-referenced-by-count":52,"title":["Highly secure and efficient routing"],"prefix":"10.1109","volume":"1","author":[{"given":"l.","family":"Avramopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Kobayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Krishnamurthy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"A compendium of NP optimization problems","year":"0","author":"crescenzi","key":"19"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/90.222907"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.803917"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/144179.144203"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1976.233819"},{"year":"0","key":"15"},{"journal-title":"Introduction to Algorithms","year":"1990","author":"cormen","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.751457"},{"key":"14","article-title":"Efficient and secure source authentication for multicast","author":"perrig","year":"2001","journal-title":"Proceedings of the Symposium on Network and Distributed System Security NDSS-95"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/NDSS.1997.579225"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.1996.586129"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90056-L"},{"journal-title":"Network layer protocols with Byzantine robustness","year":"1988","author":"perlman","key":"3"},{"key":"20","first-page":"317","article-title":"Polynomially bounded minimization problems that are hard to approximate","volume":"1","author":"kann","year":"1994","journal-title":"Nordic J Comp"},{"key":"2","doi-asserted-by":"crossref","DOI":"10.1515\/9780691186702","author":"oye","year":"1986","journal-title":"Cooperation under Anarchy"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1039858"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/570645.570648"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(98)00022-X"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/570681.570684"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/65.730751"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796312745"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/NDSS.1996.492416"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/SAINTW.2003.1210190"}],"event":{"name":"IEEE INFOCOM 2004","acronym":"INFCOM-04","location":"Hong Kong, PR China"},"container-title":["IEEE INFOCOM 2004"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9369\/29751\/01354494.pdf?arnumber=1354494","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T22:15:57Z","timestamp":1586038557000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1354494\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/infcom.2004.1354494","relation":{},"subject":[]}}