Ziqing Mao and Cormac Herley
Link-translating proxies are widely used for anonymous browsing, policy circumvention and WebVPN functions. These are implemented by encoding the destination URL in the path of the URL submitted to the proxy and rewriting all links before returning the document to the client. Commonly these are based on the CGIProxy implementation or a variant. While popular, broken links and very slow load times are common. This is so, since the use of scripting languages makes finding and translating links (the essential task of such a proxy) very difficult. Some web-sites become entirely non-functional when loaded. This paper proposes a novel architecture for a link-translating proxy. By using a sub-domain mapping technique we entirely eliminate the need to translate (or even find) relative links in content. This makes the link rewriting algorithm very simple and robust. We have implemented, deployed, and tested extensively. We conducted a comparison between the our proxy and CGIProxy. Both the theoretical analysis and experimental evaluation show that the our proxy is significantly better in terms of robustness, performance, and security. We call our system ABOProxy, since it involves the address bar only. Our implementation is running and can be used to navigate at will by appending url .aboproxy.com to the hostname of any URL to be loaded.
|Publisher||Association for Computing Machinery, Inc.|
Copyright © 2007 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or firstname.lastname@example.org. The definitive version of this paper can be found at ACM’s Digital Library --http://www.acm.org/dl/.