Cryptology ePrint Archive: Report 2017/130

Topology-Hiding Computation Beyond Logarithmic Diameter

Adi Akavia and Tal Moran

Abstract: A distributed computation in which nodes are connected by a partial communication graph is called \emph{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 {\em large-diameter networks}, including cycles, trees and graphs with logarithmic \emph{circumference}. Our results use very different methods from [MOR15] and can be based on a standard assumption (such as DDH).

Category / Keywords: topology hiding multi party computation, broadcast, voting

Original Publication (in the same form): IACR-EUROCRYPT-2017

Date: received 13 Feb 2017

Contact author: akavia at mta ac il, talm@idc ac il

Available format(s): PDF | BibTeX Citation

Version: 20170216:220309 (All versions of this report)

Short URL: ia.cr/2017/130

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]