{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:13:26Z","timestamp":1761581606508,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319690834"},{"type":"electronic","value":"9783319690841"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-69084-1_32","type":"book-chapter","created":{"date-parts":[[2017,10,6]],"date-time":"2017-10-06T03:30:06Z","timestamp":1507260606000},"page":"426-440","source":"Crossref","is-referenced-by-count":7,"title":["TorBricks: Blocking-Resistant Tor Bridge Distribution"],"prefix":"10.1007","author":[{"given":"Mahdi","family":"Zamani","sequence":"first","affiliation":[]},{"given":"Jared","family":"Saia","sequence":"additional","affiliation":[]},{"given":"Jedidiah","family":"Crandall","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,7]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"The Tor Project metrics: bridges in the network between March 1, 2016 and March 31, 2016","DOI":"10.1097\/01.BACK.0000481336.74695.aa"},{"key":"32_CR2","unstructured":"The Tor Project metrics: direct users connecting between January 1, 2015 and March 31, 2015"},{"key":"32_CR3","unstructured":"The Tor Project metrics: relays in the network between January 1, 2015 and March 31, 2015"},{"key":"32_CR4","unstructured":"TorMetrics: Directly connecting users. https:\/\/metrics.torproject.org\/userstats-relay-country.html"},{"key":"32_CR5","unstructured":"The Tor Project: Pluggable transport (2015)"},{"issue":"3","key":"32_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/2818936.2818949","volume":"46","author":"MA Bender","year":"2015","unstructured":"Bender, M.A., Fineman, J.T., Movahedi, M., Saia, J., Dani, V., Gilbert, S., Pettie, S., Young, M.: Resource-competitive algorithms. ACM SIGACT News 46(3), 57\u201371 (2015)","journal-title":"ACM SIGACT News"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-03549-4_20","volume-title":"Financial Cryptography and Data Security","author":"P Bogetoft","year":"2009","unstructured":"Bogetoft, P., et al.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325\u2013343. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-03549-4_20"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1007\/978-3-662-48000-7_36","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"E Boyle","year":"2015","unstructured":"Boyle, E., Chung, K.-M., Pass, R.: Large-scale secure computation: multi-party computation for (parallel) RAM programs. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 742\u2013762. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48000-7_36"},{"issue":"4","key":"32_CR9","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/2829988.2787485","volume":"45","author":"S Burnett","year":"2015","unstructured":"Burnett, S., Feamster, N.: Encore: lightweight measurement of web censorship with cross-origin requests. SIGCOMM Comput. Commun. Rev. 45(4), 653\u2013667 (2015)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-45249-9_16","volume-title":"Distributed Computing and Networking","author":"V Dani","year":"2014","unstructured":"Dani, V., King, V., Movahedi, M., Saia, J.: Quorums quicken queries: efficient asynchronous secure multiparty computation. In: Chatterjee, M., Cao, J., Kothapalli, K., Rajsbaum, S. (eds.) ICDCN 2014. LNCS, vol. 8314, pp. 242\u2013256. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-45249-9_16"},{"key":"32_CR11","unstructured":"Dingledine, R.: Research problem: five ways to test bridge reachability (2011)"},{"key":"32_CR12","unstructured":"Dingledine, R.: Research problems: ten ways to discover Tor bridges (2011)"},{"key":"32_CR13","unstructured":"Dingledine, R., Mathewson, N.: Design of a blocking-resistant anonymity system. Technical report, The Tor Project Inc. (2006)"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson,N., Syverson, P.: Tor: the second-generation onion router. In: Proceedings of the 13th USENIX Security Symposium, Berkeley, CA, USA (2004)","DOI":"10.21236\/ADA465464"},{"key":"32_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581274","volume-title":"Concentration of Measure for the Analysis of Randomized Algorithms","author":"DP Dubhashi","year":"2009","unstructured":"Dubhashi, D.P., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, New York (2009)"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Ensafi, R., Fifield, D., Winter, P., Feamster, N., Weaver, N., Paxson, V.: Examining how the great firewall discovers hidden circumvention servers. In: Internet Measurement Conference (IMC). ACM (2015)","DOI":"10.1145\/2815675.2815690"},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-04918-2_11","volume-title":"Passive and Active Measurement","author":"R Ensafi","year":"2014","unstructured":"Ensafi, R., Knockel, J., Alexander, G., Crandall, J.R.: Detecting intentional packet drops on the internet via TCP\/IP side channels. In: Faloutsos, M., Kuzmanovic, A. (eds.) PAM 2014. LNCS, vol. 8362, pp. 109\u2013118. Springer, Cham (2014). doi: 10.1007\/978-3-319-04918-2_11"},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-40956-4_9","volume-title":"Privacy Enhancing Technologies","author":"N Feamster","year":"2003","unstructured":"Feamster, N., Balazinska, M., Wang, W., Balakrishnan, H., Karger, D.: Thwarting web censorship with untrusted messenger discovery. In: Dingledine, R. (ed.) PET 2003. LNCS, vol. 2760, pp. 125\u2013140. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-40956-4_9"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Gilbert, S., Saia, J., King, V., Young, M.: Resource-competitive analysis: a new perspective on attack-resistant distributed computing. In: Proceedings of the 8th International Workshop on Foundations of Mobile Computing, FOMC 2012, pp. 1:1\u20131:6. ACM, New York (2012)","DOI":"10.1145\/2335470.2335471"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 218\u2013229. ACM, New York (1987)","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"32_CR21","first-page":"5","volume":"1","author":"Y Lindell","year":"2009","unstructured":"Lindell, Y., Pinkas, B.: Secure multiparty computation for privacy-preserving data mining. J. Priv. Confid. 1(1), 5 (2009)","journal-title":"J. Priv. Confid."},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"Ling, Z., Luo, J., Yu, W., Yang, M., Fu, X.: Extensive analysis and large-scale empirical evaluation of tor bridge discovery. In: 2012 Proceedings IEEE INFOCOM, pp. 2381\u20132389, March 2012","DOI":"10.1109\/INFCOM.2012.6195627"},{"key":"32_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-13122-6_29","volume-title":"Fun with Algorithms","author":"M Mahdian","year":"2010","unstructured":"Mahdian, M.: Fighting censorship with algorithms. In: Boldi, P., Gargano, L. (eds.) FUN 2010. LNCS, vol. 6099, pp. 296\u2013306. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13122-6_29"},{"key":"32_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-27576-0_21","volume-title":"Financial Cryptography and Data Security","author":"D McCoy","year":"2012","unstructured":"McCoy, D., Morales, J.A., Levchenko, K.: Proximax: measurement-driven proxy dissemination (short paper). In: Danezis, G. (ed.) FC 2011. LNCS, vol. 7035, pp. 260\u2013267. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-27576-0_21"},{"key":"32_CR25","volume-title":"Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E., Probability, C.: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"issue":"2","key":"32_CR26","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"I Reed","year":"1960","unstructured":"Reed, I., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. (SIAM) 8(2), 300\u2013304 (1960)","journal-title":"J. Soc. Ind. Appl. Math. (SIAM)"},{"key":"32_CR27","unstructured":"Rushe, D.: Google reports \u2018alarming\u2019 rise in censorship by governments. The Guardian, June 2012"},{"key":"32_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-662-46078-8_3","volume-title":"SOFSEM 2015: Theory and Practice of Computer Science","author":"J Saia","year":"2015","unstructured":"Saia, J., Zamani, M.: Recent results in scalable multi-party computation. In: Italiano, G.F., Margaria-Steffen, T., Pokorn\u00fd, J., Quisquater, J.-J., Wattenhofer, R. (eds.) SOFSEM 2015. LNCS, vol. 8939, pp. 24\u201344. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46078-8_3"},{"issue":"11","key":"32_CR29","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"32_CR30","unstructured":"Sovran, Y., Libonati, A., Li, J.: Pass it on: social networks stymie censors. In: Proceedings of the 7th International Conference on Peer-to-peer Systems, IPTPS 2008, Berkeley, CA, USA, p. 3. USENIX Association (2008)"},{"key":"32_CR31","unstructured":"Turner, K.: Mass surveillance silences minority opinions, according to study. The Washington Post, March 2016"},{"key":"32_CR32","unstructured":"Wang, Q., Lin, Z., Borisov, N., Hopper, N.: rBridge: user reputation based tor bridge distribution with privacy preservation. In: Network and Distributed System Security Symposium, NDSS 2013. The Internet Society (2013)"},{"key":"32_CR33","unstructured":"Winter, P., Lindskog, S.: How the great firewall of China is blocking Tor. In: 2nd USENIX Workshop on Free and Open Communications on the Internet, Berkeley, CA (2012)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69084-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T01:28:59Z","timestamp":1659576539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69084-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319690834","9783319690841"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69084-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}