1 citations · 1 across the 5 of their papers we have counts for
6 papers
Optimizing Extension Techniques for Discovering Non-Algebraic Matroids
Michael Bamiloshin, Oriol Farràs
In this work, we revisit some combinatorial and information-theoretic extension techniques for detecting non-algebraic matroids. These are the Dress-Lovász and Ahlswede-Körner exte…
A Note on Extension Properties and Representations of Matroids
Michael Bamiloshin, Oriol Farràs, Carles Padró
We discuss several extension properties of matroids and polymatroids and their application as necessary conditions for the existence of different matroid representations, namely li…
Common Information, Matroid Representation, and Secret Sharing for Matroid Ports
Michael Bamiloshin, Aner Ben-Efraim, Oriol Farràs +1
Linear information and rank inequalities as, for instance, Ingleton inequality, are useful tools in information theory and matroid theory. Even though many such inequalities have b…
Privacy-preserving Data Splitting: A Combinatorial Approach
Oriol Farràs, Jordi Ribes-González, Sara Ricci
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 combina…
Privacy-Preserving Trust Management Mechanisms from Private Matching Schemes
Oriol Farràs, Josep Domingo-Ferrer, Alberto Blanco-Justicia
Cryptographic primitives are essential for constructing privacy-preserving communication mechanisms. There are situations in which two parties that do not know each other need to e…
Linear spaces and transversal designs: k-anonymous combinatorial configurations for anonymous database search
Klara Stokes, Oriol Farràs
Anonymous database search protocols allow users to query a database anonymously. This can be achieved by letting the users form a peer-to-peer community and post queries on behalf…