Data caching is a well-acknowledged method for reducing access times to commonly requested data. Data caching yields considerable results when employed in communication systems that exhibit bidirectional communication, such as web browsing. This technique has been used in anonymous networks to increase the overall anonymity provided by the system. With the increasing number of anonymous networks in place today, the need arises for a metric in order to differentiate the degree of anonymity provided by these systems. This thesis presents a method to compute the degree of anonymity provided by such systems. The model focuses on an anonymous system employing data caching and builds on existing related work in order to allow senders to send multiple messages and receivers to receive multiple messages. A systemwide metric is proposed for measuring the anonymity provided by such systems and is then tested under special conditions. The thesis concludes with an analysis of a pool mix system employing data caching. / Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and Computer Science
| Identifer | oai:union.ndltd.org:WICHITA/oai:soar.wichita.edu:10057/5411 |
| Date | 05 1900 |
| Creators | Khan, Ahsan Ahmad |
| Contributors | Bagai, Rajiv |
| Publisher | Wichita State University |
| Source Sets | Wichita State University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis |
| Format | vii, 37 p. |
| Rights | Copyright Ahsan Ahmad Khan, 2012. All rights reserved |
Page generated in 0.0017 seconds