We 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 F2 is solvable. Our protocol uses a diverse cryptographic toolkit which includes techniques such as homomorphic encryption, oblivious Gaussian elimination, and private set intersection.
|Number of pages||28|
|Journal||Transactions on Data Privacy|
|State||Published - Aug 2019|
Bibliographical notePublisher Copyright:
© 2019, University of Skovde. All rights reserved.
- Distributed graphs
- Graph planarity
- Privacy-preserving distributed computations
- Secure multiparty computation