Privacy-preserving data splitting: a combinatorial approach

Privacy-preserving data splitting is a technique that aims to protect privacy by storing different fragments of in locations. In this work we give new combinatorial formulation the problem. We see problem as purely problem, which have split attributes into way satisfies certain properties derived from processing and constraints. Using formulation, develop algebraic techniques obtain solutions present an method builds optimal solution using Gröbner bases. Since not efficient general, also greedy algorithm for finding are necessarily minimally sized.