Show simple item record

dc.contributor.advisorBagai, Rajiv
dc.contributor.authorLi, Rong
dc.date.accessioned2012-04-02T19:52:51Z
dc.date.available2012-04-02T19:52:51Z
dc.date.copyright2011en
dc.date.issued2011-07
dc.identifier.othert11070
dc.identifier.urihttp://hdl.handle.net/10057/5041
dc.descriptionThesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and Computer Science.en_US
dc.description.abstractIn this thesis we present a critical analysis of the system-wide anonymity metric by Edman et al. [1], which is based on the permanent value of a doubly-stochastic matrix. From the view of intuitive understanding, we show that a metric that looks no further than the permanent, a composite value, is at best a rough indicator of anonymity, We find the range where its inaccuracy is acute, and propose a better anonymity indicator. Also, we show that this metric fails to possess desirable generalization properties by constructing an information-preserving embedding of a smaller class of attacks into the wider class for which this metric was proposed. Finally, we show a new general, accurate anonymity metric that does not exhibit these shortcomings.en_US
dc.format.extentviii, 28 p.en
dc.language.isoen_USen_US
dc.publisherWichita State Universityen_US
dc.rights© Copyright 2011 by Rong Li. All rights reserveden
dc.subject.lcshElectronic dissertationsen
dc.titleA system-wide anonymity metricen_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record