Privacy-preserving Data Splitting: A Combinatorial Approach
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F21%3APU140904" target="_blank" >RIV/00216305:26220/21:PU140904 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/article/10.1007/s10623-021-00884-6" target="_blank" >http://link.springer.com/article/10.1007/s10623-021-00884-6</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10623-021-00884-6" target="_blank" >10.1007/s10623-021-00884-6</a>
Alternative languages
Result language
angličtina
Original language name
Privacy-preserving Data Splitting: A Combinatorial Approach
Original language description
Privacy-preserving data splitting is a technique that aims to protect data privacy by storing different fragments of data in different locations. In this work we give a new combinatorial formulation to the data splitting problem. We see the data splitting problem as a purely combinatorial problem, in which we have to split data attributes into different fragments in a way that satisfies certain combinatorial properties derived from processing and privacy constraints. Using this formulation, we develop new combinatorial and algebraic techniques to obtain solutions to the data splitting problem. We present an algebraic method which builds an optimal data splitting solution by using Grobner bases. Since this method is not efficient in general, we also develop a greedy algorithm for finding solutions that are not necessarily minimally sized.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/VJ01030002" target="_blank" >VJ01030002: International Partnership for Cryptography and Cybersecurity Research</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
DESIGNS CODES AND CRYPTOGRAPHY
ISSN
0925-1022
e-ISSN
1573-7586
Volume of the periodical
89
Issue of the periodical within the volume
7
Country of publishing house
US - UNITED STATES
Number of pages
22
Pages from-to
1735-1756
UT code for WoS article
000652910800001
EID of the result in the Scopus database
—