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).
|Title of host publication
|Advances in Cryptology – EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
|Jean-Sebastien Coron, Jesper Buus Nielsen
|Number of pages
|Published - 2017
|36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2017 - Paris, France
Duration: 30 Apr 2017 → 4 May 2017
|Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2017
|30/04/17 → 4/05/17
Bibliographical notePublisher Copyright:
© International Association for Cryptologic Research 2017.
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science