Now showing items 1-20 of 21

    • 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 ...
    • Cache enhanced anonymity systems against probabilistic attacks 

      Lu, Huabo; Bagai, Rajiv (Springer, Cham, 2018-05-29)
      The technique of data caching is being increasingly recognized for its ability to increase the amount of anonymity provided by an anonymous communication network, and is expected to be widely adopted in the next generation ...
    • Data caching for enhancing anonymity 

      Bagai, Rajiv; Tang, Bin (IEEE Computer Society, 2011-03-22)
      The benefits of caching for reducing access time to frequently needed data, in order to improve system performance, are already well-known. In this paper, a proposal for employing data caching for increasing the level of ...
    • 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, ...
    • Effectiveness of probabilistic attacks on anonymity of users communicating via multiple messages 

      Bagai, Rajiv; Tang, Bin; Kim, Euna (IEEE, 2013-06)
      A major objective of any system-wide attack on an anonymity system is to uncover the extent to which each user of the system communicated with each other user. A probabilistic attack attempts to achieve this objective by ...
    • Efficient near-optimal t-closeness with low information loss 

      Thammanna Gowda, Vikas; Bagai, Rajiv; Spilinek, Gerald; Vitalapura, Spandana Siddaramanagowd (IEEE, 2021-09-22)
      The t-closeness technique is one of the most popular techniques for preserving individual privacy in data. It involves generalizing and suppressing some attributes of a given table, after partitioning the set of all records ...
    • 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 ...
    • Maximum diversity in web application user action privacy 

      Bagai, Rajiv; Layton, Seth; Gampa, Srikanth; Chandrashekar, Kavitha (IEEE, 2020-02-13)
      Popular web application features, like autosuggestion and auto-correction, are well-known to amply reveal input actions entered by their users to any eavesdroppers, by generating sufficiently unique network activity bursts ...
    • Measuring anonymity of pseudonymized data after probabilistic background attacks 

      Bagai, Rajiv; Malik, Nafia; Jadliwala, Murtuza Shabbir (IEEE, 2017-05)
      There is clear demand among organizations for sharing their data for mining and other purposes without compromising the privacy of individual objects contained in the data. Pseudonymization is a simple, yet widely employed ...
    • 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 ...
    • Measuring client-server anonymity 

      Bagai, Rajiv; Lu, Huabo (Springer International Publishing, 2016)
      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 ...
    • Mechanical generation of concrete syntax rules for the Schütz semantic editor 

      Johnson, Christopher Wayne (2007-05)
      Schütz is a programmer's editor designed by Dr. Rodney Bates. Through its language definition language, users may adapt Schütz to any programming language. Describing a programming language in the language definition ...
    • 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 ...
    • Safeguarding patients data for reasonable health care cost 

      Gampa, Srikanth (Wichita State University, 2018-02-20)
      Health care providers including hospitals are required by law to publicly release their patient data, removing explicitly identifiable attributes, such as name, social security number, and address. The release of this data ...
    • 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 ...