Show simple item record

dc.contributor.authorBagai, Rajiv
dc.contributor.authorLu, Huabo
dc.date.accessioned2017-01-06T23:58:36Z
dc.date.available2017-01-06T23:58:36Z
dc.date.issued2016
dc.identifier.citationBagai, Rajiv; Lu, Huabo. 2016. Measuring client-server anonymity. Computer Networks, CN 2016, Book Series: Communications in Computer and Information Science, vol. 608:pp 96-106en_US
dc.identifier.isbn978-3-319-39207-3
dc.identifier.issn1865-0929
dc.identifier.otherWOS:000387430100009
dc.identifier.urihttp://dx.doi.org/10.1007/978-3-319-39207-3_9
dc.identifier.urihttp://hdl.handle.net/10057/12792
dc.descriptionClick on the DOI link to access the article (may not be free).en_US
dc.description.abstractThe 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.isoen_USen_US
dc.publisherSpringer International Publishingen_US
dc.relation.ispartofseriesCommunications in Computer and Information Science;v.608
dc.subjectOnline anonymityen_US
dc.subjectCachingen_US
dc.subjectInfeasibility attacksen_US
dc.subjectMeasuring anonymityen_US
dc.subjectCombinatorial matrix theoryen_US
dc.titleMeasuring client-server anonymityen_US
dc.typeConference paperen_US
dc.rights.holder© Springer International Publishing Switzerland 2016en_US


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record