{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T05:22:13Z","timestamp":1725772933830},"reference-count":28,"publisher":"Privacy Enhancing Technologies Symposium Advisory Board","issue":"4","license":[{"start":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T00:00:00Z","timestamp":1597622400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,10,1]]},"abstract":"Abstract<\/jats:title>\n Refraction networking is a next-generation censorship circumvention approach that locates proxy functionality in the network itself, at participating ISPs or other network operators. Following years of research and development and a brief pilot, we established the world\u2019s first production deployment of a Refraction Networking system. Our deployment uses a highperformance implementation of the TapDance protocol and is enabled as a transport in the popular circumvention app Psiphon. It uses TapDance stations at four physical uplink locations of a mid-sized ISP, Merit Network, with an aggregate bandwidth of 140 Gbps. By the end of 2019, our system was enabled as a transport option in 559,000 installations of Psiphon, and it served upwards of 33,000 unique users per month. This paper reports on our experience building the deployment and operating it for the first year. We describe how we overcame engineering challenges, present detailed performance metrics, and analyze how our system has responded to dynamic censor behavior. Finally, we review lessons learned from operating this unique artifact and discuss prospects for further scaling Refraction Networking to meet the needs of censored users.<\/jats:p>","DOI":"10.2478\/popets-2020-0075","type":"journal-article","created":{"date-parts":[[2020,8,28]],"date-time":"2020-08-28T14:43:23Z","timestamp":1598625803000},"page":"321-335","source":"Crossref","is-referenced-by-count":7,"title":["Running Refraction Networking for Real"],"prefix":"10.56553","volume":"2020","author":[{"given":"Benjamin","family":"VanderSloot","sequence":"first","affiliation":[{"name":"University of Michigan"}]},{"given":"Sergey","family":"Frolov","sequence":"additional","affiliation":[{"name":"University of Colorado Boulder"}]},{"given":"Jack","family":"Wampler","sequence":"additional","affiliation":[{"name":"University of Colorado Boulder"}]},{"given":"Sze Chuen","family":"Tan","sequence":"additional","affiliation":[{"name":"University of Illinois , Urbana-Champaign"}]},{"given":"Irv","family":"Simpson","sequence":"additional","affiliation":[{"name":"Psiphon"}]},{"given":"Michalis","family":"Kallitsis","sequence":"additional","affiliation":[{"name":"Merit Network"}]},{"given":"J. Alex","family":"Halderman","sequence":"additional","affiliation":[{"name":"University of Michigan"}]},{"given":"Nikita","family":"Borisov","sequence":"additional","affiliation":[{"name":"University of Illinois , Urbana-Champaign"}]},{"given":"Eric","family":"Wustrow","sequence":"additional","affiliation":[{"name":"University of Colorado Boulder"}]}],"member":"35752","published-online":{"date-parts":[[2020,8,17]]},"reference":[{"key":"2022042622580055905_j_popets-2020-0075_ref_001_w2aab3b7c34b1b6b1ab1ab1Aa","doi-asserted-by":"crossref","unstructured":"[1] D. J. Bernstein, M. Hamburg, A. Krasnova, and T. Lange. Elligator: Elliptic-curve points indistinguishable from uniform random strings. In ACM Conference on Computer and Communications Security (CCS), 2013.10.1145\/2508859.2516734","DOI":"10.1145\/2508859.2516734"},{"key":"2022042622580055905_j_popets-2020-0075_ref_002_w2aab3b7c34b1b6b1ab1ab2Aa","doi-asserted-by":"crossref","unstructured":"[2] C. Bocovich and I. Goldberg. Slitheen: Perfectly imitated decoy routing through traffic replacement. In ACM Conference on Computer and Communications Security (CCS), 2016.10.1145\/2976749.2978312","DOI":"10.1145\/2976749.2978312"},{"key":"2022042622580055905_j_popets-2020-0075_ref_003_w2aab3b7c34b1b6b1ab1ab3Aa","doi-asserted-by":"crossref","unstructured":"[3] C. Bocovich and I. Goldberg. Secure asymmetry and deployability for decoy routing systems. Proceedings on Privacy Enhancing Technologies, 2018(3), 2018.10.1515\/popets-2018-0020","DOI":"10.1515\/popets-2018-0020"},{"key":"2022042622580055905_j_popets-2020-0075_ref_004_w2aab3b7c34b1b6b1ab1ab4Aa","unstructured":"[4] J. Cesareo, J. Karlin, M. Schapira, and J. Rexford. Optimizing the placement of implicit proxies, June 2012. Technical Report, Available: http:\/\/www.cs.princeton.edu\/~jrex\/papers\/decoy-routing.pdf."},{"key":"2022042622580055905_j_popets-2020-0075_ref_005_w2aab3b7c34b1b6b1ab1ab5Aa","doi-asserted-by":"crossref","unstructured":"[5] L. Dixon, T. Ristenpart, and T. Shrimpton. Network traffic obfuscation and automated Internet censorship. IEEE Security & Privacy, 14(6):43\u201353, 2016.10.1109\/MSP.2016.121","DOI":"10.1109\/MSP.2016.121"},{"key":"2022042622580055905_j_popets-2020-0075_ref_006_w2aab3b7c34b1b6b1ab1ab6Aa","unstructured":"[6] Elastic, Co. Elastic stack and product documentation. Available: https:\/\/www.elastic.co\/guide\/index.html."},{"key":"2022042622580055905_j_popets-2020-0075_ref_007_w2aab3b7c34b1b6b1ab1ab7Aa","doi-asserted-by":"crossref","unstructured":"[7] D. Ellard, A. Jackson, C. Jones, V. Manfredi, W. T. Strayer, B. Thapa, and M. V. Welie. Rebound: Decoy routing on asymmetric routes via error messages. In IEEE Conference on Local Computer Networks (LCN), 2015.10.1109\/LCN.2015.7366287","DOI":"10.1109\/LCN.2015.7366287"},{"key":"2022042622580055905_j_popets-2020-0075_ref_008_w2aab3b7c34b1b6b1ab1ab8Aa","doi-asserted-by":"crossref","unstructured":"[8] S. Frolov, F. Douglas, W. Scott, A. McDonald, B. VanderSloot, R. Hynes, A. Kruger, M. Kallitsis, D. Robinson, N. Borisov, J. A. Halderman, and E. Wustrow. An ISP-scale deployment of TapDance. In USENIX Workshop on Free and Open Communications on the Internet (FOCI), 2017.10.1145\/3232755.3232787","DOI":"10.1145\/3232755.3232787"},{"key":"2022042622580055905_j_popets-2020-0075_ref_009_w2aab3b7c34b1b6b1ab1ab9Aa","doi-asserted-by":"crossref","unstructured":"[9] S. Frolov, J. Wampler, S. C. Tan, J. A. Halderman, N. Borisov, and E. Wustrow. Conjure: Summoning proxies from unused address space. In ACM Conference on Computer and Communications Security (CCS), 2019.10.1145\/3319535.3363218","DOI":"10.1145\/3319535.3363218"},{"key":"2022042622580055905_j_popets-2020-0075_ref_010_w2aab3b7c34b1b6b1ab1ac10Aa","doi-asserted-by":"crossref","unstructured":"[10] D. Gosain, A. Agarwal, S. Chakravarty, and H. B. Acharya. The devil\u2019s in the details: Placing decoy routers in the Internet. In Annual Computer Security Applications Conference (ACSAC), 2017.10.1145\/3134600.3134608","DOI":"10.1145\/3134600.3134608"},{"key":"2022042622580055905_j_popets-2020-0075_ref_011_w2aab3b7c34b1b6b1ab1ac11Aa","unstructured":"[11] Grafana Labs. Grafana documentation. Available: https:\/\/grafana.com\/docs\/."},{"key":"2022042622580055905_j_popets-2020-0075_ref_012_w2aab3b7c34b1b6b1ab1ac12Aa","unstructured":"[12] P. Hintjens. ZeroMQ: Messaging for Many Applications. O\u2019Reilly, 2013."},{"key":"2022042622580055905_j_popets-2020-0075_ref_013_w2aab3b7c34b1b6b1ab1ac13Aa","doi-asserted-by":"crossref","unstructured":"[13] A. Houmansadr, G. T. K. Nguyen, M. Caesar, and N. Borisov. Cirripede: Circumvention infrastructure using router redirection with plausible deniability. In ACM Conference on Computer and Communications Security (CCS), 2011.10.1145\/2046707.2046730","DOI":"10.1145\/2046707.2046730"},{"key":"2022042622580055905_j_popets-2020-0075_ref_014_w2aab3b7c34b1b6b1ab1ac14Aa","doi-asserted-by":"crossref","unstructured":"[14] A. Houmansadr, E. L. Wong, and V. Shmatikov. No direction home: The true cost of routing around decoys. In Internet Society Network and Distributed System Security Symposium (NDSS), 2014.10.14722\/ndss.2014.23292","DOI":"10.14722\/ndss.2014.23292"},{"key":"2022042622580055905_j_popets-2020-0075_ref_015_w2aab3b7c34b1b6b1ab1ac15Aa","unstructured":"[15] M. Kan. Russia to block 9 VPNs for rejecting censorship demand. PCMag, June 7, 2019. Available: https:\/\/www.pcmag.com\/news\/russia-to-block-9-vpns-for-rejectingcensorship-demand."},{"key":"2022042622580055905_j_popets-2020-0075_ref_016_w2aab3b7c34b1b6b1ab1ac16Aa","unstructured":"[16] J. Karlin, D. Ellard, A. W. Jackson, C. E. Jones, G. Lauer, D. P. Mankins, and W. T. Strayer. Decoy routing: Toward unblockable Internet communication. In USENIX Workshop on Free and Open Communications on the Internet (FOCI), 2011."},{"key":"2022042622580055905_j_popets-2020-0075_ref_017_w2aab3b7c34b1b6b1ab1ac17Aa","unstructured":"[17] V. Manfredi and P. Songkuntham. Multiflow: Crossconnection decoy routing using TLS 1.3 session resumption. In USENIX Workshop on Free and Open Communications on the Internet (FOCI), 2018."},{"key":"2022042622580055905_j_popets-2020-0075_ref_018_w2aab3b7c34b1b6b1ab1ac18Aa","unstructured":"[18] B. Marczak, N. Weaver, J. Dalek, R. Ensafi, D. Fifield, S. McKune, A. Rey, J. Railton, R. Deibert, and V. Paxson. An analysis of China\u2019s Great Cannon. In USENIX Workshop on Free and Open Communications on the Internet (FOCI), 2015."},{"key":"2022042622580055905_j_popets-2020-0075_ref_019_w2aab3b7c34b1b6b1ab1ac19Aa","doi-asserted-by":"crossref","unstructured":"[19] M. Nasr and A. Houmansadr. Game of decoys: Optimal decoy routing through game theory. In ACM Conference on Computer and Communications Security (CCS), 2016.10.1145\/2976749.2978367","DOI":"10.1145\/2976749.2978367"},{"key":"2022042622580055905_j_popets-2020-0075_ref_020_w2aab3b7c34b1b6b1ab1ac20Aa","doi-asserted-by":"crossref","unstructured":"[20] M. Nasr, H. Zolfaghari, and A. Houmansadr. The waterfall of liberty: Decoy routing circumvention that resists routing attacks. In ACM Conference on Computer and Communications Security (CCS), 2017.10.1145\/3133956.3134075","DOI":"10.1145\/3133956.3134075"},{"key":"2022042622580055905_j_popets-2020-0075_ref_021_w2aab3b7c34b1b6b1ab1ac21Aa","unstructured":"[21] Ntop. PF_RING. Available: http:\/\/www.ntop.org\/products\/pf_ring."},{"key":"2022042622580055905_j_popets-2020-0075_ref_022_w2aab3b7c34b1b6b1ab1ac22Aa","unstructured":"[22] Prometheus: Monitoring system and time series database. Available: https:\/\/prometheus.io."},{"key":"2022042622580055905_j_popets-2020-0075_ref_023_w2aab3b7c34b1b6b1ab1ac23Aa","doi-asserted-by":"crossref","unstructured":"[23] E. Rescorla. The transport layer security (TLS) protocol version 1.3. RFC 8446, 2018.10.17487\/RFC8446","DOI":"10.17487\/RFC8446"},{"key":"2022042622580055905_j_popets-2020-0075_ref_024_w2aab3b7c34b1b6b1ab1ac24Aa","unstructured":"[24] D. Robinson, H. Yu, and A. An. Collateral freedom: A snapshot of Chinese Internet users circumventing censorship, 2013. Available at https:\/\/www.upturn.org\/static\/files\/CollateralFreedom.pdf."},{"key":"2022042622580055905_j_popets-2020-0075_ref_025_w2aab3b7c34b1b6b1ab1ac25Aa","doi-asserted-by":"crossref","unstructured":"[25] M. Schuchard, J. Geddes, C. Thompson, and N. Hopper. Routing around decoys. In ACM Conference on Computer and Communications Security (CCS), 2012.10.1145\/2382196.2382209","DOI":"10.1145\/2382196.2382209"},{"key":"2022042622580055905_j_popets-2020-0075_ref_026_w2aab3b7c34b1b6b1ab1ac26Aa","unstructured":"[26] W. Tarreau. The PROXY protocol versions 1 & 2, 2017. Available: https:\/\/www.haproxy.org\/download\/1.8\/doc\/proxy-protocol.txt."},{"key":"2022042622580055905_j_popets-2020-0075_ref_027_w2aab3b7c34b1b6b1ab1ac27Aa","unstructured":"[27] E. Wustrow, C. M. Swanson, and J. A. Halderman. Tap- Dance: End-to-middle anticensorship without flow blocking. In USENIX Security Symposium, 2014."},{"key":"2022042622580055905_j_popets-2020-0075_ref_028_w2aab3b7c34b1b6b1ab1ac28Aa","unstructured":"[28] E. Wustrow, S. Wolchok, I. Goldberg, and J. A. Halderman. Telex: Anticensorship in the network infrastructure. In USENIX Security Symposium, 2011."}],"container-title":["Proceedings on Privacy Enhancing Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/content.sciendo.com\/view\/journals\/popets\/2020\/4\/article-p321.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.sciendo.com\/pdf\/10.2478\/popets-2020-0075","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T16:31:13Z","timestamp":1658334673000},"score":1,"resource":{"primary":{"URL":"https:\/\/petsymposium.org\/popets\/2020\/popets-2020-0075.php"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,17]]},"references-count":28,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2020,8,17]]},"published-print":{"date-parts":[[2020,10,1]]}},"alternative-id":["10.2478\/popets-2020-0075"],"URL":"https:\/\/doi.org\/10.2478\/popets-2020-0075","relation":{},"ISSN":["2299-0984"],"issn-type":[{"value":"2299-0984","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,17]]}}}