Privacy-preserving planarity testing of distributed graphs

Guy Barshap; Tamir Tassa

doi:https://doi.org/10.1007/978-3-319-95729-6_9

Privacy-preserving planarity testing of distributed graphs

Guy Barshap, Tamir Tassa

Computer Science

Open University of Israel

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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 F₂ 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.

Original language	English
Title of host publication	Data and Applications Security and Privacy XXXII - 32nd Annual IFIP WG 11.3 Conference, DBSec 2018, Proceedings
Editors	Stefano Paraboschi, Florian Kerschbaum
Publisher	Springer Verlag
Pages	131-147
Number of pages	17
ISBN (Print)	9783319957289
DOIs	https://doi.org/10.1007/978-3-319-95729-6_9
State	Published - 1 Jan 2018
Event	32nd Annual IFIP WG 11.3 Conference on Data and Applications Security and Privacy, DBSec 2018 - Bergamo, Italy Duration: 16 Jul 2018 → 18 Jul 2018

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10980 LNCS

Conference

Conference	32nd Annual IFIP WG 11.3 Conference on Data and Applications Security and Privacy, DBSec 2018
Country/Territory	Italy
City	Bergamo
Period	16/07/18 → 18/07/18

Keywords

Distributed graphs
Graph planarity
Privacy-preserving distributed computations
Secure multiparty computation

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

https://doi.org/10.1007/978-3-319-95729-6_9

Cite this

Barshap, G., & Tassa, T. (2018). Privacy-preserving planarity testing of distributed graphs. In S. Paraboschi, & F. Kerschbaum (Eds.), Data and Applications Security and Privacy XXXII - 32nd Annual IFIP WG 11.3 Conference, DBSec 2018, Proceedings (pp. 131-147). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10980 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-95729-6_9

Barshap, Guy ; Tassa, Tamir. / Privacy-preserving planarity testing of distributed graphs. Data and Applications Security and Privacy XXXII - 32nd Annual IFIP WG 11.3 Conference, DBSec 2018, Proceedings. editor / Stefano Paraboschi ; Florian Kerschbaum. Springer Verlag, 2018. pp. 131-147 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{68dae78caad741509c9ed76dfb568959,

title = "Privacy-preserving planarity testing of distributed graphs",

abstract = "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. This is the first time that a solution to this problem is presented.",

keywords = "Distributed graphs, Graph planarity, Privacy-preserving distributed computations, Secure multiparty computation",

author = "Guy Barshap and Tamir Tassa",

note = "Publisher Copyright: {\textcopyright} IFIP International Federation for Information Processing 2018.; 32nd Annual IFIP WG 11.3 Conference on Data and Applications Security and Privacy, DBSec 2018 ; Conference date: 16-07-2018 Through 18-07-2018",

year = "2018",

month = jan,

day = "1",

doi = "https://doi.org/10.1007/978-3-319-95729-6_9",

language = "الإنجليزيّة",

isbn = "9783319957289",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "131--147",

editor = "Stefano Paraboschi and Florian Kerschbaum",

booktitle = "Data and Applications Security and Privacy XXXII - 32nd Annual IFIP WG 11.3 Conference, DBSec 2018, Proceedings",

address = "ألمانيا",

}

Barshap, G & Tassa, T 2018, Privacy-preserving planarity testing of distributed graphs. in S Paraboschi & F Kerschbaum (eds), Data and Applications Security and Privacy XXXII - 32nd Annual IFIP WG 11.3 Conference, DBSec 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10980 LNCS, Springer Verlag, pp. 131-147, 32nd Annual IFIP WG 11.3 Conference on Data and Applications Security and Privacy, DBSec 2018, Bergamo, Italy, 16/07/18. https://doi.org/10.1007/978-3-319-95729-6_9

Privacy-preserving planarity testing of distributed graphs. / Barshap, Guy; Tassa, Tamir.
Data and Applications Security and Privacy XXXII - 32nd Annual IFIP WG 11.3 Conference, DBSec 2018, Proceedings. ed. / Stefano Paraboschi; Florian Kerschbaum. Springer Verlag, 2018. p. 131-147 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10980 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Privacy-preserving planarity testing of distributed graphs

AU - Barshap, Guy

AU - Tassa, Tamir

N1 - Publisher Copyright: © IFIP International Federation for Information Processing 2018.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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. This is the first time that a solution to this problem is presented.

AB - 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. This is the first time that a solution to this problem is presented.

KW - Distributed graphs

KW - Graph planarity

KW - Privacy-preserving distributed computations

KW - Secure multiparty computation

UR - http://www.scopus.com/inward/record.url?scp=85050543882&partnerID=8YFLogxK

U2 - https://doi.org/10.1007/978-3-319-95729-6_9

DO - https://doi.org/10.1007/978-3-319-95729-6_9

M3 - منشور من مؤتمر

SN - 9783319957289

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 131

EP - 147

BT - Data and Applications Security and Privacy XXXII - 32nd Annual IFIP WG 11.3 Conference, DBSec 2018, Proceedings

A2 - Paraboschi, Stefano

A2 - Kerschbaum, Florian

PB - Springer Verlag

T2 - 32nd Annual IFIP WG 11.3 Conference on Data and Applications Security and Privacy, DBSec 2018

Y2 - 16 July 2018 through 18 July 2018

ER -

Barshap G, Tassa T. Privacy-preserving planarity testing of distributed graphs. In Paraboschi S, Kerschbaum F, editors, Data and Applications Security and Privacy XXXII - 32nd Annual IFIP WG 11.3 Conference, DBSec 2018, Proceedings. Springer Verlag. 2018. p. 131-147. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: https://doi.org/10.1007/978-3-319-95729-6_9

Privacy-preserving planarity testing of distributed graphs

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this