Topology-hiding computation on all graphs

DOI10.1007/978-3-319-63688-7_15zbMath1407.94067OpenAlexW2613863580MaRDI QIDQ5915735

Tal Moran, Rio LaVigne, Adi Akavia

Publication date: 3 November 2017

Published in: Advances in Cryptology – CRYPTO 2017 (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1721.1/131498

Mathematics Subject Classification ID

Cryptography (94A60) Applications of graph theory to circuits and networks (94C15)

Related Items (7)

Topology-hiding computation beyond semi-honest adversaries ⋮ Is information-theoretic topology-hiding computation possible? ⋮ Correction to: ``Topology-hiding communication from minimal assumptions ⋮ Towards practical topology-hiding computation ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Topology-hiding computation on all graphs ⋮ Topology-hiding computation for networks with unknown delays

This page was built for publication: Topology-hiding computation on all graphs