Now showing items 1-11 of 11

    • A framework for measuring post-attack system-wide anonymity in anonymous communication systems 

      Lu, Huabo (Wichita State University, 2018-12)
      We develop techniques for measuring the amount of anonymity provided by anonymity systems in the aftermath of attacks. Anonymity systems are special systems that enable their users to carry out anonymous communication over ...
    • A method for generating near optimal t-closed equivalence classes 

      Vitalapura, Spandana Siddaramanagowd (Wichita State University, 2021-05)
      A huge volume of data emanates from various digital sources, this data having sensitive information is being stored and released for purposes that serve the common good through the advancement of knowledge. Organizations ...
    • Disclosure risk measurement of anonymized datasets after probabilistic attacks 

      Malik, Nafia (Wichita State University, 2014-07)
      We present a unified metric for analyzing the risk of disclosing anonymized datasets. Datasets containing privacy sensitive information are often required to be shared with unauthorized users for utilization of valuable ...
    • Effect of data caching on systemwide anonymity with users sending and receiving multiple messages 

      Khan, Ahsan Ahmad (Wichita State University, 2012-05)
      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, ...
    • Foolproofing network communication by k-diverse padding 

      Chandrashekar, Kavitha (Wichita State University, 2018-12)
      It has been shown recently that a large majority of online web-based applications are prone to privacy attacks, causing serious breach in the privacy of any online activity, due to the popular application features that ...
    • An improved measure of network anonymity using profile functions 

      Jiang, Nan (Wichita State University, 2011-07)
      We present a graphical framework containing certain in nite pro les of probability distributions that result from an attack on an anonymity system. We represent currently popular anonymity metrics within our framework ...
    • Measuring anonymity while sending and receiving multiple messages 

      Samad, Abdus (Wichita State University, 2012-05)
      Anonymity systems are designed in a way that hides the level of communication between senders and receivers of a message, and the goal of an attacker is to find that communication pattern. It is usually very difficult to ...
    • A method for t-close anonymization in the presence of multiple numerical sensitive attributes 

      Weber, Eric (Wichita State University, 2020-05)
      Privacy Preserving Data Publishing is an area of research focused on developing methods of anonymizing sensitive relational data such that it can be published without compromising the privacy of the individuals the data ...
    • Online privacy preservation using packet padding 

      Chandrashekar, Kirankumar (Wichita State University, 2015-12)
      It is becoming very convenient for Internet users across the globe to have at their fingertips major online services, such as banking, equity share marketing, medical information, shopping, and much more. It is important ...
    • Sender cover traffic to counter an improved Statistical Disclosure Attack 

      Lu, Huabo (Wichita State University, 2011-07)
      The statistical disclosure attack (SDA) is quite an effective method for attackers to go against an anonymity system and to reveal the information behind it. It targets at a particular anonymity system user, tries to ...
    • A system-wide anonymity metric 

      Li, Rong (Wichita State University, 2011-07)
      In 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 ...