Efficient web browsing with perfect anonymity using page prefetching

Yu, Shui, Thapngam, Theerasak, Wei, Su and Zhou, Wanlei 2010, Efficient web browsing with perfect anonymity using page prefetching, in ICA3PP 2010 : Algorithms and architectures for parallel processing : Proceedings of the 10th International Conference Algorithms and Architectures for Parallel Processing, Springer-Verlag, Berlin, Germany, pp. 1-12.

Attached Files
Name Description MIMEType Size Downloads

Title Efficient web browsing with perfect anonymity using page prefetching
Author(s) Yu, Shui
Thapngam, Theerasak
Wei, Su
Zhou, Wanlei
Conference name Algorithms and Architectures for Parallel Processing. Conference (10th : 2010 : Busan, Korea)
Conference location Busan, Korea
Conference dates 21-23 May. 2010
Title of proceedings ICA3PP 2010 : Algorithms and architectures for parallel processing : Proceedings of the 10th International Conference Algorithms and Architectures for Parallel Processing
Editor(s) Hsu, Ching-Hsien
Yang, Laurence T.
Park, Jong Hyuk
Yeo, Sang-Soo
Publication date 2010
Series Lecture Notes in Computer Science; v.6081-6082
Conference series Algorithms and Architectures for Parallel Processing Conference
Start page 1
End page 12
Total pages 12
Publisher Springer-Verlag
Place of publication Berlin, Germany
Keyword(s) perfect anonymity
web browsing
prefetch
Summary Anonymous web browsing is a hot topic with many potential applications for privacy reasons. The current dominant strategy to achieve anonymity is packet padding with dummy packets as cover traffic. However, this method introduces extra bandwidth cost and extra delay. Therefore, it is not practical for anonymous web browsing applications. In order to solve this problem, we propose to use the predicted web pages that users are going to access as the cover traffic rather than dummy packets. Moreover, we defined anonymity level as a metric to measure anonymity degrees, and established a mathematical model for anonymity systems, and transformed the anonymous communication problem into an optimization problem. As a result, users can find tradeoffs among anonymity level and cost. With the proposed model, we can describe and compare our proposal and the previous schemas in a theoretical style. The preliminary experiments on the real data set showed the huge potential of the proposed strategy in terms of resource saving.
ISBN 3642131182
9783642131189
ISSN 0302-9743
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
Persistent URL http://hdl.handle.net/10536/DRO/DU:30035300

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

Versions
Version Filter Type
Access Statistics: 201 Abstract Views, 11 File Downloads  -  Detailed Statistics
Created: Wed, 01 Jun 2011, 13:37:08 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.