Paper Info
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'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).
Year
DOI
Venue
2017
10.1007/978-3-319-56617-7_21
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2017, PT III
DocType
Volume
ISSN
Conference
10212
0302-9743
Citations 
PageRank 
References 
4
0.41
8
Authors
2
Name
Order
Citations
PageRank
Adi Akavia152.80
Tal Moran243925.36