Privacy-preserving data splitting: a combinatorial approach
type: Item
instance of: scholarly article
title: Privacy-preserving data splitting: a combinatorial approach
author: Oriol Farràs
author: Jordi Ribes-González
author: Sara Ricci
published in: Designs, Codes and Cryptography
publication date: 2021-06-24T00:00:00Z
full work available at URL: https://arxiv.org/abs/1801.05974
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 7363113
zbMATH Keywords: data splitting
zbMATH Keywords: data privacy
zbMATH Keywords: graph colorings
describes a project that uses: SageMath
MaRDI profile type: Publication
OpenAlex ID: W3164927955
cites work: Secret-sharing schemes for very dense graphs
cites work: New methods to color the vertices of a graph
cites work: Q4023642
cites work: Gröbner bases and graph colorings
cites work: Graph-coloring ideals: Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases
cites work: The Representation of a Graph by Set Intersections
cites work: Efficient computation of zero-dimensional Gröbner bases by change of ordering
cites work: Local bounds for the optimal information ratio of secret sharing schemes
cites work: Hardness of Approximate Hypergraph Coloring
cites work: Algebraic characterization of uniquely vertex colorable graphs
cites work: A graph coloring algorithm for large scheduling problems
cites work: A Survey on Polly Cracker Systems
cites work: Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz
cites work: Q3481743
cites work: A New Algorithm for Generating All the Maximal Independent Sets
cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems
DOI: 10.1007/S10623-021-00884-6
description: scientific article; zbMATH DE number 7363113