Privacy-preserving data splitting: a combinatorial approach

DOI10.1007/s10623-021-00884-6OpenAlexW3164927955MaRDI QIDQ2035465

Oriol Farràs, Sara Ricci, Jordi Ribes-González

Publication date: 24 June 2021

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.05974

zbMATH Keywords

data privacydata splittinggraph colorings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Data structures (68P05)

Related Items

Local bounds for the optimal information ratio of secret sharing schemes

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Secret-sharing schemes for very dense graphs
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Gröbner bases and graph colorings
• Local bounds for the optimal information ratio of secret sharing schemes
• Algebraic characterization of uniquely vertex colorable graphs
• Graph-Coloring Ideals
• Hardness of Approximate Hypergraph Coloring
• Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz
• A Survey on Polly Cracker Systems
• A graph coloring algorithm for large scheduling problems
• A New Algorithm for Generating All the Maximal Independent Sets
• New methods to color the vertices of a graph
• The Representation of a Graph by Set Intersections
• An upper bound for the chromatic number of a graph and its application to timetabling problems