Abstract
In countries such as China or Iran where Internet censorship is prevalent, users usually rely on proxies or anonymizers to freely access the web. The obvious difficulty with this approach is that once the address of a proxy or an anonymizer is announced for use to the public, the authorities can easily filter all traffic to that address. This poses a challenge as to how proxy addresses can be announced to users without leaking too much information to the censorship authorities. In this paper, we formulate this question as an interesting algorithmic problem. We study this problem in a static and a dynamic model, and give almost tight bounds on the number of proxy servers required to give access to n people k of whom are adversaries. We will also discuss how trust networks can be used in this context.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A Distributed Anonymous Information Storage and Retrieval System. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 46–66. Springer, Heidelberg (2001)
Clarke, I., Miller, S.G., Hong, T.W., Sandberg, O., Wiley, B.: Protecting Free Expression Online with Freenet. In: IEEE Internet Computing, pp. 40–49 (January/February 2002)
Clementi, A.E., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 709–718 (2001)
Dai, W., Milenkovic, O.: Weighted Superimposed Codes and Integer Compressive Sensing. IEEE Trans. on Inform. Theory (June 2008) (submitted)
Deibert, R.J., Palfrey, J.G., Rohozinski, R., Zittrain, J. (eds.): ACCESS DENIED: The Practice and Politics of Internet Filtering. The MIT Press, Cambridge (2008)
Dingledine, R., Mathewson, N., Syverson, P.: Tor: the second-generation onion router. In: Proceedings of the 13th Conference on USENIX Security Symposium, pp. 21–21 (2004)
Du, D.-Z., Hwang, F.K.: Combinatorial group testing and its applications. World Scientific Publishing Co., Singapore (2000)
D’yachkov, A., Lebedev, V., Vilenkin, P., Yekhanin, S.: Cover-free families and superimposed codes: constructions, bounds and applications to cryptography and group testing. In: Proceedings of International Symposium on Information Theory (ISIT), p. 117 (2001)
Fay, J.: Iran’s revolution will not be televised, but could be tweeted, The Register, June 16 (2009), http://wwwtheregister.co.uk/2009/06/16/iran_twitter/
Grossman, L.: Iran Protests: Twitter, the Medium of the Movement, Time, June 17 (2009), http://www.time.com/time/world/article/0,8599,1905125,00.html
Indyk, P.: Deterministic Superimposed Coding with Applications to Pattern Matching. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, p. 127 (1997)
Kautz, W., Singleton, R.: Nonrandom binary superimposed codes. IEEE Transactions on Information Theory 10(4), 363–377 (1964)
Kleitman, D., Spencer, J.: Families of k-independent sets. Discrete Mathematics 6, 255–262 (1973)
Li, L., Mahdian, M., Mirrokni, V.: Secure Overlay Network Design. Algorithmica 57(1), 82–96 (2010)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
OpenNet Initiative, ONI reports and articles, http://opennet.net/reports
Psiphon, Developed at the Citizen Lab at the University of Toronto, http://psiphon.ca
Reporters Without Borders, Internet Enemies, 2009th edn., March 12 (2009), http://www.rsf.org/IMG/pdf/Internet_enemies_2009_2_.pdf
Rhoads, C., Chao, L.: Iran’s Web Spying Aided By Western Technology. The Wall Street Journal, A1 (June 22, 2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mahdian, M. (2010). Fighting Censorship with Algorithms. In: Boldi, P., Gargano, L. (eds) Fun with Algorithms. FUN 2010. Lecture Notes in Computer Science, vol 6099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13122-6_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-13122-6_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13121-9
Online ISBN: 978-3-642-13122-6
eBook Packages: Computer ScienceComputer Science (R0)