May 4, 2016 · This type of attack is much easier to deploy and is thus very harmful. In this paper, we propose new frameworks of probabilistic (1, k)and (k, k)- ...

the probabilistic (1,k)-anonymity and (k, 1)-anonymity in the hybrid randomization model. Section 6 analyzes the semantic closeness in the randomization model.

This type of attack is much easier to deploy and is thus very harmful. In this paper, we propose new frameworks of probabilistic (1,k)- and (k,k)-anonymity to ...

Achieving probabilistic anonymity against one-to ... 2016, Achieving probabilistic anonymity in a linear and hybrid randomization model ...

Effective reconstruction of data perturbed by random projections. Y Sang, H Shen ... Achieving probabilistic anonymity in a linear and hybrid randomization model.

Nov 1, 2016 · The method combines three simple yet effective anonymization techniques to achieve the principle. First, random sampling and perturbation are ...

Aug 19, 2017 · Sang, Y., et al.: Achieving probabilistic anonymity in a linear and hybrid randomization model. IEEE Trans. Inf. Forensics Secur. 11(10) ...

The purpose of this paper is to study the network computer security hidden trouble and vulnerability mining technology. In this paper, the types of security ...

In this paper, we study the problem of data gathering in multi-hop linear sensor networks. We employ a simple model based on random channel access scheme to ...

... model is proposed to estimate the lower bound and ... Probabilistic Anonymity in a Linear and Hybrid ... Achieving anonymity via clustering · Gagan Aggarwal ...