Openly accessible

Anonymous web browsing through predicted pages

Yu, Shui, Thapngam, Theerasak, Tse, Hou In and Wang, Jinlong 2010, Anonymous web browsing through predicted pages, in IEEE Globecom 2010 : Proceedings of the 53rd Global Communications Conference, Exhibition and Industry Forum, IEEE, United States, pp. 1581-1585.

Attached Files
Name Description MIMEType Size Downloads
yu-anonymousweb-2010.pdf Published version application/pdf 247.13KB 280

Title Anonymous web browsing through predicted pages
Author(s) Yu, Shui
Thapngam, Theerasak
Tse, Hou In
Wang, Jinlong
Conference name Global Communications Conference, Exhibition and Industry Forum (53rd : 2010 : Miami, Florida)
Conference location Miami, Fla.
Conference dates 6-10 Dec. 2010
Title of proceedings IEEE Globecom 2010 : Proceedings of the 53rd Global Communications Conference, Exhibition and Industry Forum
Editor(s) [unknown]
Publication date 2010
Conference series Global Communications Conference, Exhibition and Industry Forum
Start page 1581
End page 1585
Total pages 5
Publisher IEEE
Place of publication United States
Summary Anonymous web browsing is an emerging hot topic with many potential applications for privacy and security. However, research on low latency anonymous communication, such as web browsing, is quite limited; one reason is the intolerable delay caused by the current dominant dummy packet padding strategy, as a result, it is hard to satisfy perfect anonymity and limited delay at the same time for web browsing. In this paper, we extend our previous proposal on using prefetched web pages as cover traffic to obtain perfect anonymity for anonymous web browsing, we further explore different aspects in this direction. Based on Shannon’s perfect secrecy theory, we formally established a mathematical model for the problem, and defined a metric to measure the cost of achieving perfect anonymity. The experiments on a real world data set demonstrated that the proposed strategy can reduce delay more than ten times compared to the dummy packet padding methods, which confirmed the vast potentials of the proposed strategy.
Notes This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder
ISBN 9781424488650
Language eng
Field of Research 080503 Networking and Communications
Socio Economic Objective 890101 Fixed Line Data Networks and Services
HERDC Research category E1 Full written paper - refereed
HERDC collection year 2010
Copyright notice ©2010, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30035262

Document type: Conference Paper
Collections: School of Information Technology
Open Access Collection
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

Versions
Version Filter Type
Access Statistics: 177 Abstract Views, 289 File Downloads  -  Detailed Statistics
Created: Mon, 30 May 2011, 15:12:39 EST by Sandra Dunoon

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.