Topology-hiding computation beyond logarithmic diameter

Adi Akavia; Tal Moran

doi:10.1007/978-3-319-56617-7_21

Topology-hiding computation beyond logarithmic diameter

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

Abstract

A distributed computation in which nodes are connected by a partial communication graph is called topology-hiding if it does not reveal information about the graph (beyond what is revealed by the output of the function). Previous results [Moran, Orlov, Richelson; TCC’15] have shown that topology-hiding computation protocols exist for graphs of logarithmic diameter (in the number of nodes), but the feasibility question for graphs of larger diameter was open even for very simple graphs such as chains, cycles and trees. In this work, we take a step towards topology-hiding computation protocols for arbitrary graphs by constructing protocols that can be used in a large class of large-diameter networks, including cycles, trees and graphs with logarithmic circumference. Our results use very different methods from [MOR15] and can be based on a standard assumption (such as DDH).

Original language	English
Title of host publication	Advances in Cryptology – EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
Editors	Jean-Sebastien Coron, Jesper Buus Nielsen
Publisher	Springer Verlag
Pages	609-637
Number of pages	29
ISBN (Print)	9783319566160
DOIs	https://doi.org/10.1007/978-3-319-56617-7_21
State	Published - 2017
Externally published	Yes
Event	36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2017 - Paris, France Duration: 30 Apr 2017 → 4 May 2017

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10212 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2017
Country/Territory	France
City	Paris
Period	30/04/17 → 4/05/17

Bibliographical note

Publisher Copyright:
© International Association for Cryptologic Research 2017.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-319-56617-7_21

Cite this

Akavia, A., & Moran, T. (2017). Topology-hiding computation beyond logarithmic diameter. In J.-S. Coron, & J. B. Nielsen (Eds.), Advances in Cryptology – EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 609-637). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10212 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-56617-7_21

Akavia, Adi ; Moran, Tal. / Topology-hiding computation beyond logarithmic diameter. Advances in Cryptology – EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. editor / Jean-Sebastien Coron ; Jesper Buus Nielsen. Springer Verlag, 2017. pp. 609-637 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{22c17bda779e4ffd911d8481ff0858ab,

title = "Topology-hiding computation beyond logarithmic diameter",

abstract = "A distributed computation in which nodes are connected by a partial communication graph is called topology-hiding if it does not reveal information about the graph (beyond what is revealed by the output of the function). Previous results [Moran, Orlov, Richelson; TCC{\textquoteright}15] have shown that topology-hiding computation protocols exist for graphs of logarithmic diameter (in the number of nodes), but the feasibility question for graphs of larger diameter was open even for very simple graphs such as chains, cycles and trees. In this work, we take a step towards topology-hiding computation protocols for arbitrary graphs by constructing protocols that can be used in a large class of large-diameter networks, including cycles, trees and graphs with logarithmic circumference. Our results use very different methods from [MOR15] and can be based on a standard assumption (such as DDH).",

author = "Adi Akavia and Tal Moran",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2017.; 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2017 ; Conference date: 30-04-2017 Through 04-05-2017",

year = "2017",

doi = "10.1007/978-3-319-56617-7_21",

language = "English",

isbn = "9783319566160",

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

publisher = "Springer Verlag",

pages = "609--637",

editor = "Jean-Sebastien Coron and Nielsen, {Jesper Buus}",

booktitle = "Advances in Cryptology – EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings",

address = "Germany",

}

Akavia, A & Moran, T 2017, Topology-hiding computation beyond logarithmic diameter. in J-S Coron & JB Nielsen (eds), Advances in Cryptology – EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10212 LNCS, Springer Verlag, pp. 609-637, 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2017, Paris, France, 30/04/17. https://doi.org/10.1007/978-3-319-56617-7_21

Topology-hiding computation beyond logarithmic diameter. / Akavia, Adi; Moran, Tal.
Advances in Cryptology – EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. ed. / Jean-Sebastien Coron; Jesper Buus Nielsen. Springer Verlag, 2017. p. 609-637 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10212 LNCS).

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

TY - GEN

T1 - Topology-hiding computation beyond logarithmic diameter

AU - Akavia, Adi

AU - Moran, Tal

N1 - Publisher Copyright: © International Association for Cryptologic Research 2017.

PY - 2017

Y1 - 2017

N2 - A distributed computation in which nodes are connected by a partial communication graph is called topology-hiding if it does not reveal information about the graph (beyond what is revealed by the output of the function). Previous results [Moran, Orlov, Richelson; TCC’15] have shown that topology-hiding computation protocols exist for graphs of logarithmic diameter (in the number of nodes), but the feasibility question for graphs of larger diameter was open even for very simple graphs such as chains, cycles and trees. In this work, we take a step towards topology-hiding computation protocols for arbitrary graphs by constructing protocols that can be used in a large class of large-diameter networks, including cycles, trees and graphs with logarithmic circumference. Our results use very different methods from [MOR15] and can be based on a standard assumption (such as DDH).

AB - A distributed computation in which nodes are connected by a partial communication graph is called topology-hiding if it does not reveal information about the graph (beyond what is revealed by the output of the function). Previous results [Moran, Orlov, Richelson; TCC’15] have shown that topology-hiding computation protocols exist for graphs of logarithmic diameter (in the number of nodes), but the feasibility question for graphs of larger diameter was open even for very simple graphs such as chains, cycles and trees. In this work, we take a step towards topology-hiding computation protocols for arbitrary graphs by constructing protocols that can be used in a large class of large-diameter networks, including cycles, trees and graphs with logarithmic circumference. Our results use very different methods from [MOR15] and can be based on a standard assumption (such as DDH).

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

U2 - 10.1007/978-3-319-56617-7_21

DO - 10.1007/978-3-319-56617-7_21

M3 - Conference contribution

AN - SCOPUS:85018714465

SN - 9783319566160

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

SP - 609

EP - 637

BT - Advances in Cryptology – EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings

A2 - Coron, Jean-Sebastien

A2 - Nielsen, Jesper Buus

PB - Springer Verlag

T2 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2017

Y2 - 30 April 2017 through 4 May 2017

ER -

Akavia A, Moran T. Topology-hiding computation beyond logarithmic diameter. In Coron JS, Nielsen JB, editors, Advances in Cryptology – EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Springer Verlag. 2017. p. 609-637. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-56617-7_21

Topology-hiding computation beyond logarithmic diameter

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this