dc.contributor.author | Bagai, Rajiv | |
dc.contributor.author | Lu, Huabo | |
dc.date.accessioned | 2017-01-06T23:58:36Z | |
dc.date.available | 2017-01-06T23:58:36Z | |
dc.date.issued | 2016 | |
dc.identifier.citation | Bagai, Rajiv; Lu, Huabo. 2016. Measuring client-server anonymity. Computer Networks, CN 2016, Book Series: Communications in Computer and Information Science, vol. 608:pp 96-106 | en_US |
dc.identifier.isbn | 978-3-319-39207-3 | |
dc.identifier.issn | 1865-0929 | |
dc.identifier.other | WOS:000387430100009 | |
dc.identifier.uri | http://dx.doi.org/10.1007/978-3-319-39207-3_9 | |
dc.identifier.uri | http://hdl.handle.net/10057/12792 | |
dc.description | Click on the DOI link to access the article (may not be free). | en_US |
dc.description.abstract | The primary intent of clients performing anonymous online tasks is to conceal the extent of their already encrypted communication with sensitive servers. We present an accurate method for evaluating the amount of anonymity still available to such clients in the aftermath of an attack. Our method is based upon probabilities arrived at by the attack of possible client-server association levels for being the real one, along with the correctness levels of those associations. We demonstrate how additionally taking correctness levels into account results in more accurate anonymity measurement than the customary approach of just computing the Shannon entropy of the probabilities. | en_US |
dc.language.iso | en_US | en_US |
dc.publisher | Springer International Publishing | en_US |
dc.relation.ispartofseries | Communications in Computer and Information Science;v.608 | |
dc.subject | Online anonymity | en_US |
dc.subject | Caching | en_US |
dc.subject | Infeasibility attacks | en_US |
dc.subject | Measuring anonymity | en_US |
dc.subject | Combinatorial matrix theory | en_US |
dc.title | Measuring client-server anonymity | en_US |
dc.type | Conference paper | en_US |
dc.rights.holder | © Springer International Publishing Switzerland 2016 | en_US |