19 citations · 32 across the 8 of their papers we have counts for
8 papers
Algorithms for the local and the global postage stamp problem
Léo Colisson Palais, Jean-Guillaume Dumas, Alexis Galan +2
We consider stamps with different values (denominations) and same dimensions, and an envelope with a fixed maximum number of stamp positions. The local postage stamp problem is to…
Fuzzy Private Set Union via Oblivious Key Homomorphic Encryption Retrieval
Jean-Guillaume Dumas, Aude Maignan, Luiza Soezima
Private Set Multi-Party Computations are protocols that allow parties to jointly and securely compute functions: apart from what is deducible from the output of the function, the i…
Optimal Communication Unbalanced Private Set Union
Jean-Guillaume Dumas, Alexis Galan, Bruno Grenet +2
We present new two-party protocols for the Unbalanced Private Set Union (UPSU) problem. Here, the Sender holds a set of data points, and the Receiver holds another (possibly much l…
Organic Structures Emerging From Bio-Inspired Graph-Rewriting Automata
Paul Cousin, Aude Maignan
Graph-Rewriting Automata (GRA) are an extension of Cellular Automata to a dynamic structure using local graph-rewriting rules. This work introduces linear algebra based tools that…
VESPo: Verified Evaluation of Secret Polynomials
Jean-Guillaume Dumas, Aude Maignan, Clément Pernet +1
Proofs of Retrievability are protocols which allow a Client to store data remotely and to efficiently ensure, via audits, that the entirety of that data is still intact. Dynamic Pr…
Dynamic proofs of retrievability with low server storage
Gaspard Anthoine, Jean-Guillaume Dumas, Michael Hanling +4
Proofs of Retrievability (PoRs) are protocols which allow a client to store data remotely and to efficiently ensure, via audits, that the entirety of that data is still intact. A d…
Parallel Graph Rewriting with Overlapping Rules
Rachid Echahed, Aude Maignan
We tackle the problem of simultaneous transformations of networks represented as graphs. Roughly speaking, one may distinguish two kinds of simultaneous or parallel rewrite relatio…
On the Planar Split Thickness of Graphs
David Eppstein, Philipp Kindermann, Stephen Kobourov +7
Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest such that the graph is -spl…