https://hal.inria.fr/hal-01954423Barshap, GuyGuyBarshapThe Open University of IsraelTassa, TamirTamirTassaThe Open University of IsraelPrivacy-Preserving Planarity Testing of Distributed GraphsHAL CCSD2018Secure multiparty computationPrivacy-preserving distributed computationsDistributed graphsGraph planarity[INFO] Computer Science [cs]Ifip, HalFlorian KerschbaumStefano Paraboschi2018-12-13 16:04:062019-02-07 15:37:442018-12-13 16:06:48enConference papershttps://hal.inria.fr/hal-01954423/document10.1007/978-3-319-95729-6_9application/pdf1We study the problem of privacy-preserving planarity testing of distributed graphs. The setting involves several parties that hold private graphs on the same set of vertices, and an external mediator that helps with performing the computations. Their goal is to test whether the union of their private graphs is planar, but in doing so each party wishes to deny from his peers any information on his own private edge set beyond what is implied by the final output of the computation. We present a privacy-preserving protocol for that purpose which is based on the Hanani-Tutte Theorem. That theorem enables translating the planarity question into the question of whether a specific system of linear equations over the field $${\mathbf F}_2$$F2 is solvable. Our protocol uses a diverse cryptographic toolkit which includes techniques such as homomorphic encryption, oblivious Gaussian elimination, and private set intersection. This is the first time that a solution to this problem is presented.