Results 31 to 40 of about 51,151 (259)
Reidentification and k-anonymity: A model for disclosure risk in graphs [PDF]
In this article we provide a formal framework for reidentification in general. We define n-confusion as a concept for modeling the anonymity of a database table and we prove that n-confusion is a generalization of k-anonymity. After a short survey on the
Stokes, Klara, Torra, Vicenç
core +1 more source
Privacy-Preserving Framework for Blockchain-Based Stock Exchange Platform
This paper presents a privacy persevering framework for a decentralized stock exchange platform, ensuring anonymity and unlinkability of the investors’ accounts and their respective trading activities.
Hamed Al-Shaibani +3 more
doaj +1 more source
Clustering with diversity [PDF]
We consider the {\em clustering with diversity} problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least $\ell$ points, all of which have distinct colors.
Li, Jian, Yi, Ke, Zhang, Qin
core +2 more sources
This study is a quantitative study that aims to determine the relationship between anonymity and moral disengagement with cyberbullying behavior in K-Pop fans who do fanwar.
Erfira Khoiriyah, Ridwan Budi Pramono
doaj +1 more source
Optimization-Based k-Anonymity Algorithms
<p>In this paper we present a formulation of <em>k</em>-anonymity as a mathematical <a href="https://www.sciencedirect.com/topics/computer-science/optimization-problem" target="_blank">optimization problem</a>. In solving this formulated problem, <em>k</em>-anonymity is achieved while maximizing the utility of ...
Yuting Liang, Reza Samavi
openaire +1 more source
k-anonymous Microdata Release via Post Randomisation Method
The problem of the release of anonymized microdata is an important topic in the fields of statistical disclosure control (SDC) and privacy preserving data publishing (PPDP), and yet it remains sufficiently unsolved.
Chida, Koji +3 more
core +1 more source
Development and Analysis of Deterministic Privacy-Preserving Policies Using Non-Stochastic Information Theory [PDF]
A deterministic privacy metric using non-stochastic information theory is developed. Particularly, minimax information is used to construct a measure of information leakage, which is inversely proportional to the measure of privacy.
Farokhi, Farhad
core +2 more sources
Parameterized Complexity of the k-anonymity Problem
The problem of publishing personal data without giving up privacy is becoming increasingly important. An interesting formalization that has been recently proposed is the $k$-anonymity.
A Gionis +21 more
core +1 more source
ABAKA : a novel attribute-based k-anonymous collaborative solution for LBSs [PDF]
The increasing use of mobile devices, along with advances in telecommunication systems, increased the popularity of Location-Based Services (LBSs). In LBSs, users share their exact location with a potentially untrusted Location-Based Service Provider ...
Ambrosin, M +3 more
core +2 more sources
Privacy-Preserving of Check-in Services in MSNS Based on a Bit Matrix
Check-in service, being one of the most popular services in Mobile Social Network Services (MSNS), has serious personal privacy leakage threats. In this paper check-in sequences of pseudonym users were buffered, and a bit matrix for buffered check-in ...
Wen Chen
doaj +1 more source

