{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T20:08:06Z","timestamp":1778789286207,"version":"3.51.4"},"reference-count":47,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2020,2,7]],"date-time":"2020-02-07T00:00:00Z","timestamp":1581033600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"The Natural Science Foundation of Zhejiang Province","award":["LY19F020050"],"award-info":[{"award-number":["LY19F020050"]}]},{"name":"Lee Kong Chian Fellowship while at Singapore Management University"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2020,2,29]]},"abstract":"<jats:p>\n            The end-users communicating over a network path currently have no control over the path. For a better quality of service, the source node often opts for a superior (or premium) network path to send packets to the destination node. However, the current Internet architecture provides no assurance that the packets indeed follow the designated path. Network path validation schemes address this issue and enable each node present on a network path to validate whether each packet has followed the specific path so far. In this work, we introduce two notions of privacy\u2014\n            <jats:italic>path privacy<\/jats:italic>\n            and\n            <jats:italic>index privacy<\/jats:italic>\n            \u2014in the context of network path validation. We show that, in case a network path validation scheme does not satisfy these two properties, the scheme is vulnerable to certain practical attacks (that affect the privacy, reliability, neutrality and quality of service offered by the underlying network). To the best of our knowledge, ours is the first work that addresses privacy issues related to network path validation. We design PrivNPV, a privacy-preserving network path validation protocol, that satisfies both path privacy and index privacy. We discuss several attacks related to network path validation and how PrivNPV defends against these attacks. Finally, we discuss the practicality of PrivNPV based on relevant parameters.\n          <\/jats:p>","DOI":"10.1145\/3372046","type":"journal-article","created":{"date-parts":[[2020,2,7]],"date-time":"2020-02-07T09:34:51Z","timestamp":1581068091000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Privacy-preserving Network Path Validation"],"prefix":"10.1145","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2944-3783","authenticated-orcid":false,"given":"Binanda","family":"Sengupta","sequence":"first","affiliation":[{"name":"Singapore Management University, Stamford Road, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingjiu","family":"Li","sequence":"additional","affiliation":[{"name":"University of Oregon, Eugene, Oregon, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Bu","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert H.","family":"Deng","sequence":"additional","affiliation":[{"name":"Singapore Management University, Stamford Road, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,2,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2016.12.001"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2656877.2656889"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354494"},{"key":"e_1_2_1_4_1","volume-title":"A survey. CoRR abs\/1804.03385","author":"Bu Kai","year":"2018","unstructured":"Kai Bu , Yutian Yang , Avery Laird , Jiaqing Luo , Yingjiu Li , and Kui Ren . 2018. What\u2019s (not) validating network paths : A survey. CoRR abs\/1804.03385 ( 2018 ). Kai Bu, Yutian Yang, Avery Laird, Jiaqing Luo, Yingjiu Li, and Kui Ren. 2018. What\u2019s (not) validating network paths: A survey. CoRR abs\/1804.03385 (2018)."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2015.7179368"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2016.7568576"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2010.08.010"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653682"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813628"},{"key":"e_1_2_1_10_1","unstructured":"Wei Dai. 2009. Crypto++ 5.6.0 Benchmarks. Retrieved from https:\/\/www.cryptopp.com\/benchmarks.html.  Wei Dai. 2009. Crypto++ 5.6.0 Benchmarks. Retrieved from https:\/\/www.cryptopp.com\/benchmarks.html."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2596705"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the USENIX Security Symposium. 303--320","author":"Dingledine Roger","unstructured":"Roger Dingledine , Nick Mathewson , and Paul F. Syverson . 2004. Tor: The second-generation onion router . In Proceedings of the USENIX Security Symposium. 303--320 . Roger Dingledine, Nick Mathewson, and Paul F. Syverson. 2004. Tor: The second-generation onion router. In Proceedings of the USENIX Security Symposium. 303--320."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2794400"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. 179--192","author":"Hu Yih-Chun","unstructured":"Yih-Chun Hu , Adrian Perrig , and Marvin A. Sirbu . 2004. SPV: Secure path vector routing for securing BGP . In Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. 179--192 . Yih-Chun Hu, Adrian Perrig, and Marvin A. Sirbu. 2004. SPV: Secure path vector routing for securing BGP. In Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. 179--192."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2009.08.006"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2006.262"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.839934"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the ACM SIGCOMM Conference. 271--282","author":"Hyun-Jin Kim Tiffany","year":"2014","unstructured":"Tiffany Hyun-Jin Kim , Cristina Basescu , Limin Jia , Soo Bum Lee , Yih-Chun Hu , and Adrian Perrig . 2014 . Lightweight source authentication and path validation . In Proceedings of the ACM SIGCOMM Conference. 271--282 . Tiffany Hyun-Jin Kim, Cristina Basescu, Limin Jia, Soo Bum Lee, Yih-Chun Hu, and Adrian Perrig. 2014. Lightweight source authentication and path validation. In Proceedings of the ACM SIGCOMM Conference. 271--282."},{"key":"e_1_2_1_20_1","unstructured":"David Kirkpatrick. 2016. Google: 53% of Mobile Users Abandon Sites That Take over 3 Seconds to Load. Retrieved from https:\/\/www.marketingdive.com\/news\/google-53-of-mobile-users-abandon-sites-that-take-over-3-seconds-to-load\/426070\/.  David Kirkpatrick. 2016. Google: 53% of Mobile Users Abandon Sites That Take over 3 Seconds to Load. Retrieved from https:\/\/www.marketingdive.com\/news\/google-53-of-mobile-users-abandon-sites-that-take-over-3-seconds-to-load\/426070\/."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1987-0866109-5"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787509"},{"key":"e_1_2_1_23_1","unstructured":"Steve Lohr. 2012. For Impatient Web Users an Eye Blink Is Just Too Long to Wait. Retrieved from https:\/\/www.nytimes.com\/2012\/03\/01\/technology\/impatient-web-users-flee-slow-loading-sites.html.  Steve Lohr. 2012. For Impatient Web Users an Eye Blink Is Just Too Long to Wait. Retrieved from https:\/\/www.nytimes.com\/2012\/03\/01\/technology\/impatient-web-users-flee-slow-loading-sites.html."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2774225.2774835"},{"key":"e_1_2_1_25_1","unstructured":"Microsoft. 2018. Microsoft Azure IoT Reference Architecture (Version 2.1). Retrieved from https:\/\/docs.microsoft.com\/en-us\/azure\/iot-fundamentals\/iot-introduction.  Microsoft. 2018. Microsoft Azure IoT Reference Architecture (Version 2.1). Retrieved from https:\/\/docs.microsoft.com\/en-us\/azure\/iot-fundamentals\/iot-introduction."},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","unstructured":"David L. Mills. 1992. Network Time Protocol (Version 3) Specification Implementation and Analysis. Retrieved from https:\/\/tools.ietf.org\/html\/rfc1305.  David L. Mills. 1992. Network Time Protocol (Version 3) Specification Implementation and Analysis. Retrieved from https:\/\/tools.ietf.org\/html\/rfc1305.","DOI":"10.17487\/rfc1305"},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","unstructured":"John Moy. 1998. OSPF Version 2. Retrieved from https:\/\/tools.ietf.org\/html\/rfc2328.  John Moy. 1998. OSPF Version 2. Retrieved from https:\/\/tools.ietf.org\/html\/rfc2328.","DOI":"10.17487\/rfc2328"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2079296.2079326"},{"key":"e_1_2_1_29_1","unstructured":"NIST. 2001. Advanced Encryption Standard (AES). Retrieved from https:\/\/nvlpubs.nist.gov\/nistpubs\/fips\/nist.fips.197.pdf.  NIST. 2001. Advanced Encryption Standard (AES). Retrieved from https:\/\/nvlpubs.nist.gov\/nistpubs\/fips\/nist.fips.197.pdf."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/774763.774775"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67080-5"},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Jon Postel. 1981. Transmission Control Protocol. Retrieved from https:\/\/tools.ietf.org\/html\/rfc793.  Jon Postel. 1981. Transmission Control Protocol. Retrieved from https:\/\/tools.ietf.org\/html\/rfc793.","DOI":"10.17487\/rfc0793"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the ACM SIGCOMM Conference. 167--178","author":"Raghavan Barath","unstructured":"Barath Raghavan and Alex C. Snoeren . 2004. A system for authenticated policy-compliant routing . In Proceedings of the ACM SIGCOMM Conference. 167--178 . Barath Raghavan and Alex C. Snoeren. 2004. A system for authenticated policy-compliant routing. In Proceedings of the ACM SIGCOMM Conference. 167--178."},{"key":"e_1_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Yakov Rekhter Tony Li and Susan Hares. 2006. A Border Gateway Protocol 4 (BGP-4). Retrieved from https:\/\/tools.ietf.org\/html\/rfc4271.  Yakov Rekhter Tony Li and Susan Hares. 2006. A Border Gateway Protocol 4 (BGP-4). Retrieved from https:\/\/tools.ietf.org\/html\/rfc4271.","DOI":"10.17487\/rfc4271"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the ACM SIGCOMM Conference. 295--306","author":"Savage Stefan","unstructured":"Stefan Savage , David Wetherall , Anna R. Karlin , and Thomas E. Anderson . 2000. Practical network support for IP traceback . In Proceedings of the ACM SIGCOMM Conference. 295--306 . Stefan Savage, David Wetherall, Anna R. Karlin, and Thomas E. Anderson. 2000. Practical network support for IP traceback. In Proceedings of the ACM SIGCOMM Conference. 295--306."},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the IEEE Military Communications Conference (MILCOM\u201912)","author":"Shen Yilin","unstructured":"Yilin Shen , Thang N. Dinh , and My T. Thai . 2012. Adaptive algorithms for detecting critical links and nodes in dynamic networks . In Proceedings of the IEEE Military Communications Conference (MILCOM\u201912) . 1--6. Yilin Shen, Thang N. Dinh, and My T. Thai. 2012. Adaptive algorithms for detecting critical links and nodes in dynamic networks. In Proceedings of the IEEE Military Communications Conference (MILCOM\u201912). 1--6."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383060"},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of the IEEE Conference on Computer Communications (INFOCOM\u201901)","author":"Song Dawn Xiaodong","year":"2001","unstructured":"Dawn Xiaodong Song and Adrian Perrig . 2001 . Advanced and authenticated marking schemes for IP traceback . In Proceedings of the IEEE Conference on Computer Communications (INFOCOM\u201901) . 878--886. Dawn Xiaodong Song and Adrian Perrig. 2001. Advanced and authenticated marking schemes for IP traceback. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM\u201901). 878--886."},{"key":"e_1_2_1_39_1","first-page":"254","article-title":"FastPRP: Fast pseudo-random permutations for small domains","volume":"2012","author":"Stefanov Emil","year":"2012","unstructured":"Emil Stefanov and Elaine Shi . 2012 . FastPRP: Fast pseudo-random permutations for small domains . IACR Cryptol. ePrint Arch. 2012 (2012), 254 . Emil Stefanov and Elaine Shi. 2012. FastPRP: Fast pseudo-random permutations for small domains. IACR Cryptol. ePrint Arch. 2012 (2012), 254.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633033"},{"key":"e_1_2_1_41_1","volume-title":"Proceedings of the IEEE Symposium on Security and Privacy (S8P\u201997)","author":"Syverson Paul F.","unstructured":"Paul F. Syverson , David M. Goldschlag , and Michael G. Reed . 1997. Anonymous connections and onion routing . In Proceedings of the IEEE Symposium on Security and Privacy (S8P\u201997) . 44--54. Paul F. Syverson, David M. Goldschlag, and Michael G. Reed. 1997. Anonymous connections and onion routing. In Proceedings of the IEEE Symposium on Security and Privacy (S8P\u201997). 44--54."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2774993.2775066"},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the Symposium on Operating System Design and Implementation (OSDI\u201904)","author":"Walfish Michael","year":"2004","unstructured":"Michael Walfish , Jeremy Stribling , Maxwell N. Krohn , Hari Balakrishnan , Robert Tappan Morris , and Scott Shenker . 2004 . Middleboxes no longer considered harmful . In Proceedings of the Symposium on Operating System Design and Implementation (OSDI\u201904) . 215--230. Michael Walfish, Jeremy Stribling, Maxwell N. Krohn, Hari Balakrishnan, Robert Tappan Morris, and Scott Shenker. 2004. Middleboxes no longer considered harmful. In Proceedings of the Symposium on Operating System Design and Implementation (OSDI\u201904). 215--230."},{"key":"e_1_2_1_44_1","unstructured":"Matthew Wall. 2016. How Long Will You Wait for a Shopping Website to Load? Retrieved from https:\/\/www.bbc.com\/news\/business-37100091.  Matthew Wall. 2016. How Long Will You Wait for a Shopping Website to Load? Retrieved from https:\/\/www.bbc.com\/news\/business-37100091."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281123"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660349"},{"key":"e_1_2_1_47_1","volume-title":"Proceedings of the IEEE Symposium on Security and Privacy (S8P\u201911)","author":"Zhang Xin","unstructured":"Xin Zhang , Hsu-Chun Hsiao , Geoffrey Hasker , Haowen Chan , Adrian Perrig , and David G. Andersen . 2011. SCION: Scalability, control, and isolation on next-generation networks . In Proceedings of the IEEE Symposium on Security and Privacy (S8P\u201911) . 212--227. Xin Zhang, Hsu-Chun Hsiao, Geoffrey Hasker, Haowen Chan, Adrian Perrig, and David G. Andersen. 2011. SCION: Scalability, control, and isolation on next-generation networks. In Proceedings of the IEEE Symposium on Security and Privacy (S8P\u201911). 212--227."}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372046","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:19Z","timestamp":1750203859000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,7]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2,29]]}},"alternative-id":["10.1145\/3372046"],"URL":"https:\/\/doi.org\/10.1145\/3372046","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,7]]},"assertion":[{"value":"2019-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-02-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}