{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,5]],"date-time":"2023-09-05T13:22:37Z","timestamp":1693920157864},"reference-count":44,"publisher":"Institution of Engineering and Technology (IET)","issue":"7","license":[{"start":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T00:00:00Z","timestamp":1677456000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2021YFB1006200","2021YFB1006201"],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62002383","62072467"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["ietresearch.onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["IET Communications"],"published-print":{"date-parts":[[2023,4]]},"abstract":"Abstract<\/jats:title>Proxy based censorship circumvention technique is treated as one of the most promising approaches to fighting against Internet censorship, and its practical applications like the onion router and Lantern have been widely utilized. However, the proxy distribution, as a basic and core issue, still remains unsolved due to (i) the finiteness and non\u2010renewable nature of proxy resources, (ii) the heterogeneity of clients and proxies requirements, and (iii) the existence of secondary censorship. In this paper, a win\u2010win driven proxy distribution mechanism for proxy based censorship circumvention systems is designed by leveraging the blind matching theory. Specifically, a combinational manner is developed to measure the quality of service (QoS) requirements of clients in terms of normalized bandwidth and reliability, and security requirements of proxies in terms of credits and suspicion. Then, by introducing the concept of virtual currency, the proxy distribution issue is formulated as two\u2010sided combinatorial problems from the perspective of clients and proxies, respectively. To solve the complex NP\u2010hard combinatorial problems in a win\u2010win manner without unilateral dominance, a two\u2010sided many\u2010to\u2010many context\u2010free matching game is constructed, in which the aspiration levels and agreement functions are defined to capture the security and QoS concerns of clients and proxies. Further, a modified notion of pairwise stability is exploited as the solution concept, and a client\u2010proxy blind matching algorithm with market and information decentralization is proposed to obtain the \u03b5\u2010pairwise stable solution, where clients and proxies make encounters randomly and update their aspiration levels through a stochastic learning process. Finally, theoretical analysis and numerical results are carried out to validate the properties and performance of the proposed algorithm including stability, complexity, and\u00a0convergence.<\/jats:p>","DOI":"10.1049\/cmu2.12589","type":"journal-article","created":{"date-parts":[[2023,3,5]],"date-time":"2023-03-05T07:38:42Z","timestamp":1678001922000},"page":"863-877","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Blind matching algorithm based proxy distribution against internet censorship"],"prefix":"10.1049","volume":"17","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-0243-1539","authenticated-orcid":false,"given":"Xin","family":"Shi","sequence":"first","affiliation":[{"name":"PLA Strategic Support Force Information Engineering University Zhengzhou China"}]},{"given":"Yunfei","family":"Guo","sequence":"additional","affiliation":[{"name":"PLA Strategic Support Force Information Engineering University Zhengzhou China"}]},{"given":"Hongchao","family":"Hu","sequence":"additional","affiliation":[{"name":"PLA Strategic Support Force Information Engineering University Zhengzhou China"}]},{"given":"Yawen","family":"Wang","sequence":"additional","affiliation":[{"name":"PLA Strategic Support Force Information Engineering University Zhengzhou China"}]},{"given":"Zhen","family":"Gao","sequence":"additional","affiliation":[{"name":"PLA Strategic Support Force Information Engineering University Zhengzhou China"}]},{"given":"Xiaoli","family":"Sun","sequence":"additional","affiliation":[{"name":"PLA Strategic Support Force Information Engineering University Zhengzhou China"}]}],"member":"265","published-online":{"date-parts":[[2023,2,27]]},"reference":[{"key":"e_1_2_11_2_1","unstructured":"Douglas F.E.:Circumvention of censorship of internet access and publication. Ph.D. Dissertation University of Illinois at Urbana\u2010Champaign 2017."},{"key":"e_1_2_11_3_1","doi-asserted-by":"crossref","unstructured":"Tschantz M.C. Afroz S. Paxson V. et\u00a0al.:Sok: Towards grounding censorship circumvention in empiricism. In:2016 IEEE Symposium on Security and Privacy (SP). pp.914\u2013933.IEEE Piscataway(2016)","DOI":"10.1109\/SP.2016.59"},{"key":"e_1_2_11_4_1","doi-asserted-by":"crossref","unstructured":"Kim J. Camtepe S. Baek J. Susilo W. Pieprzyk J. Nepal S.:P2dpi: practical and privacy\u2010preserving deep packet inspection. In:Proceedings of the 2021 ACM Asia Conference on Computer and Communications Security pp.135\u2013146.ACM New York(2021)","DOI":"10.1145\/3433210.3437525"},{"key":"e_1_2_11_5_1","first-page":"303","volume-title":"Usenix Security","author":"Syverson P.","year":"2004"},{"key":"e_1_2_11_6_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2015-0009"},{"key":"e_1_2_11_7_1","doi-asserted-by":"crossref","unstructured":"Ejeta T.G. Kim H.J.:Website fingerprinting attack on psiphon and its forensic analysis. In:International Workshop on Digital Watermarking pp.42\u201351.Springer Cham(2017)","DOI":"10.1007\/978-3-319-64185-0_4"},{"key":"e_1_2_11_8_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2018.5591"},{"key":"e_1_2_11_9_1","doi-asserted-by":"crossref","unstructured":"Douceur J.R.:The sybil attack. In:International Workshop on Peer\u2010to\u2010Peer Systems pp.251\u2013260.Springer Cham(2002)","DOI":"10.1007\/3-540-45748-8_24"},{"key":"e_1_2_11_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.108424"},{"key":"e_1_2_11_11_1","doi-asserted-by":"crossref","unstructured":"Mahdian M.:Fighting censorship with algorithms. In:International Conference on Fun with Algorithms pp.296\u2013306.Springer Cham(2010)","DOI":"10.1007\/978-3-642-13122-6_29"},{"issue":"9","key":"e_1_2_11_12_1","first-page":"10","article-title":"Proximax: A measurement based system for proxies dissemination","volume":"5","author":"McCoy D.","year":"2011","journal-title":"Financial Cryptogr. Data Sec."},{"key":"e_1_2_11_13_1","doi-asserted-by":"crossref","unstructured":"Zamani M. Saia J. Crandall J.:Torbricks: Blocking\u2010resistant tor bridge distribution. In:International Symposium on Stabilization Safety and Security of Distributed Systems pp.426\u2013440.Springer Cham(2017)","DOI":"10.1007\/978-3-319-69084-1_32"},{"key":"e_1_2_11_14_1","unstructured":"Wang Q. Lin Z. Borisov N. Hopper N.:rBridge: User reputation based tor bridge distribution with privacy preservation. In:Network & Distributed System Security Symposium (NDSS).Internet Society Reston VA(2013)"},{"key":"e_1_2_11_15_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2016-0026"},{"key":"e_1_2_11_16_1","doi-asserted-by":"crossref","unstructured":"Nasr M. Farhang S. Houmansadr A. Grossklags J.:Enemy at the gateways: Censorship\u2010resilient proxy distribution using game theory. In:Network & Distributed System Security Symposium (NDSS).Internet Society Reston VA(2019)","DOI":"10.14722\/ndss.2019.23496"},{"key":"e_1_2_11_17_1","doi-asserted-by":"crossref","unstructured":"Tsiropoulou E.E. Paruchuri S.T. Baras J.S.:Interest energy and physical\u2010aware coalition formation and resource allocation in smart iot applications. In:2017 51st Annual Conference on Information Sciences and Systems (CISS) pp.1\u20136.IEEE Piscataway(2017)","DOI":"10.1109\/CISS.2017.7926111"},{"key":"e_1_2_11_18_1","doi-asserted-by":"publisher","DOI":"10.1049\/cmu2.12279"},{"key":"e_1_2_11_19_1","unstructured":"Winter P. Ensafi R. Loesing K. Feamster N.:Identifying and characterizing sybils in the tor network. In:25th USENIX Security Symposium (USENIX Security 16) pp.1169\u20131185.USENIX Association Berkeley CA(2016)"},{"key":"e_1_2_11_20_1","unstructured":"Gupta D.:Sybil defense using efficient resource burning. Ph.D. Dissertation The University of New Mexico(2020)"},{"key":"e_1_2_11_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2018.2825366"},{"key":"e_1_2_11_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"key":"e_1_2_11_23_1","doi-asserted-by":"crossref","unstructured":"Hamza D. Shamma J.S.:Many\u2010to\u2010one blind matching for device\u2010to\u2010device communications. In:2017 IEEE 56th Annual Conference on Decision and Control (CDC) pp.4988\u20134993.IEEE Piscataway(2017)","DOI":"10.1109\/CDC.2017.8264397"},{"key":"e_1_2_11_24_1","doi-asserted-by":"crossref","unstructured":"Zolfaghari H. Houmansadr A.:Practical censorship evasion leveraging content delivery networks. In:Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security pp.1715\u20131726.ACM New York(2016)","DOI":"10.1145\/2976749.2978365"},{"key":"e_1_2_11_25_1","unstructured":"Wustrow E. Wolchok S. Goldberg I. Halderman J.A.:Telex: Anticensorship in the network infrastructure. In:20th USENIX Security Symposium (USENIX Security 11).USENIX Association Berkeley CA(2011)"},{"key":"e_1_2_11_26_1","unstructured":"Wei M.:Domain shadowing: Leveraging content delivery networks for robust Blocking\u2010Resistant communications. In:30th USENIX Security Symposium (USENIX Security 21) pp.3327\u20133343.USENIX Association Berkeley CA(2021)"},{"key":"e_1_2_11_27_1","unstructured":"Birtel B. Rossow C.:Slitheen++: Stealth tls\u2010based decoy routing. In:10th USENIX Workshop on Free and Open Communications on the Internet (FOCI 20).USENIX Association Berkeley CA(2020)"},{"key":"e_1_2_11_28_1","doi-asserted-by":"crossref","unstructured":"Frolov S. Douglas F. Scott W. McDonald A. VanderSloot B. Hynes R. Kruger A. Kallitsis M. Robinson D.G. Schultze S. et\u00a0al.:An isp\u2010scale deployment of tapdance. In:7th USENIX Workshop on Free and Open Communications on the Internet (FOCI 17).USENIX Association Berkeley CA(2017)","DOI":"10.1145\/3232755.3232787"},{"key":"e_1_2_11_29_1","doi-asserted-by":"crossref","unstructured":"Nasr M. Zolfaghari H. Houmansadr A.:The waterfall of liberty: Decoy routing circumvention that resists routing attacks. In:Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security pp.2037\u20132052.ACM New York(2017)","DOI":"10.1145\/3133956.3134075"},{"key":"e_1_2_11_30_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2020-0051"},{"key":"e_1_2_11_31_1","doi-asserted-by":"publisher","DOI":"10.1049\/cmu2.12442"},{"key":"e_1_2_11_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2919453"},{"key":"e_1_2_11_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2747509"},{"key":"e_1_2_11_34_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2019.0944"},{"key":"e_1_2_11_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2659098"},{"key":"e_1_2_11_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3041082"},{"key":"e_1_2_11_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3093615"},{"key":"e_1_2_11_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2016.2598848"},{"key":"e_1_2_11_39_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.2000.0815"},{"key":"e_1_2_11_40_1","volume-title":"Two\u2010Sided Matching: A Study in Game\u2010Theoretic Modeling and Analysis","author":"Roth A.E.","year":"1992"},{"key":"e_1_2_11_41_1","doi-asserted-by":"publisher","DOI":"10.2307\/1913320"},{"key":"e_1_2_11_42_1","doi-asserted-by":"publisher","DOI":"10.2307\/1912658"},{"key":"e_1_2_11_43_1","volume-title":"Probability, random variables, and stochastic processes","author":"Papoulis A.","year":"2002"},{"key":"e_1_2_11_44_1","doi-asserted-by":"crossref","unstructured":"Pradelski B.S.:Decentralized dynamics and fast convergence in the assignment game. In:Proceedings of the Sixteenth ACM Conference on Economics and Computation pp.43\u201343.ACM New York(2015)","DOI":"10.1145\/2764468.2764470"},{"key":"e_1_2_11_45_1","unstructured":"M P.T.:The tor project (2021).https:\/\/metrics.torproject.org\/."}],"container-title":["IET Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/cmu2.12589","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1049\/cmu2.12589","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/cmu2.12589","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T16:56:15Z","timestamp":1692723375000},"score":1,"resource":{"primary":{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/10.1049\/cmu2.12589"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,27]]},"references-count":44,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["10.1049\/cmu2.12589"],"URL":"https:\/\/doi.org\/10.1049\/cmu2.12589","archive":["Portico"],"relation":{},"ISSN":["1751-8628","1751-8636"],"issn-type":[{"value":"1751-8628","type":"print"},{"value":"1751-8636","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,27]]},"assertion":[{"value":"2022-05-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-10","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}