Privacy-preserving Data Splitting: A Combinatorial Approach

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Privacy-preserving Data Splitting: A Combinatorial Approach

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Privacy-preserving Data Splitting: A Combinatorial Approach

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/VJ01030002" target="_blank" >VJ01030002: Mezinárodní partnerství pro výzkum kryptografie a kyberbezpečnosti</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

DESIGNS CODES AND CRYPTOGRAPHY

ISSN

0925-1022

e-ISSN

1573-7586

Svazek periodika

89

Číslo periodika v rámci svazku

7

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

22

Strana od-do

1735-1756

Kód UT WoS článku

000652910800001

EID výsledku v databázi Scopus

—