Topology-hiding computation beyond logarithmic diameter

Adi Akavia, Tal Moran

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationAdvances in Cryptology – EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
EditorsJean-Sebastien Coron, Jesper Buus Nielsen
PublisherSpringer Verlag
Pages609-637
Number of pages29
ISBN (Print)9783319566160
DOIs
StatePublished - 2017
Externally publishedYes
Event36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2017 - Paris, France
Duration: 30 Apr 20174 May 2017

Publication series

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

Conference

Conference36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2017
Country/TerritoryFrance
City Paris
Period30/04/174/05/17

Bibliographical note

Funding Information:
T. Moran—Supported by ISF grant no. 1790/13.

Funding Information:
A. Akavia—Work partly supported by the ERC under the EU’s Seventh Framework Programme (FP/2007-2013) ERC Grant Agreement no. 307952.

Publisher Copyright:
© International Association for Cryptologic Research 2017.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Topology-hiding computation beyond logarithmic diameter'. Together they form a unique fingerprint.

Cite this