Towards Attack and Defense Views to K-Anonymous Using Information Theory Approach

Abstract

Ensuring multimedia content security is one of the main targets to solve multimedia information security problems and k-anonymous model is a classic and effective model to protect personal information when we publish multimedia data. The k-anonymous security with different k values has always been a hot topic of research, and there is no specific quantitative method for k-anonymous model security without considering any application scenarios or assumptions. In this paper, we give a quantitative method for the capability of attacker and defender under k-anonymous model. More specifically, we present a new general notion of limitation to provide a precise bound of attack and defense capability in a k-anonymous model. Firstly, we establish the attack channel and the defense channel from the point of the attacker's and the defender's view respectively. Moreover, we describe the capability of both attacking and defending sides by introducing the average mutual information, as well as the maximum value of the the average mutual information is the limitation of the capability of both sides, i.e. the channel capacity. Finally, according to the variation curve of the average mutual information amount, we compare the capability of the attacker and defender and analyze the effect of k value on it and get the best interval of k, that is, the value of k should be greater than 8 and less than 40.

DE‐RSTC: A rational secure two‐party computation protocol based on direction entropy

“…Subsequently, Li et al 27 extended the one‐to‐one rational commission calculation to the one‐to‐many rational delegating computation. In addition, Liu et al 28 utilized mutual information to obtain the optimal interval of the $$k$$ value under the $$k$$‐anonymous model. However, in these schemes, the researcher converts the two or more parties' protocol into a communication problem between players.…”

Verifiable Location-Encrypted Spatial Aggregation Computing for Mobile Crowd Sensing

“…At the same time, these methods will reduce data accuracy and data availability, leading to deviation of the location-participation aggregated calculation results and lower data service quality of MCS. At present, most researches about spatial sensing privacy protection mainly focus on decentralized location privacy protection schemes, which fail to guarantee the application requirements of sensing data aggregation analysis [10,11]. erefore, we focus on two main problems: one is how to carry out ciphertext computing in spatial sensing computing service more efficiently, and the other is how to realize MCS architecture of homomorphic encryption and decryption operation without loss of spatial positioning accuracy.…”

A Privacy-Preserving Personalized Service Framework through Bayesian Game in Social IoT

“…Therefore, the privacy protection of social IoT users should also be analyzed from these two aspects. At present, from the technical perspective, user privacy is protected mainly through anonymity [20,21], differential privacy [22,23], network access control [24,25], and ecosystem [26] in social IoT.…”

“…Anonymity protection [20] hides private data in a data block so that other users are incapable of associating a user's real identity information with the collected data blocks. This is also a common problem of anonymous protection schemes, and it is difficult to defend against background knowledge attacks.…”