Topology-Hiding Computation

DOI10.1007/978-3-662-46494-6_8zbMath1354.94041OpenAlexW2140260792MaRDI QIDQ5261628

Silas Richelson, Ilan Orlov, Tal Moran

Publication date: 6 July 2015

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46494-6_8

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

Topology-hiding computation beyond semi-honest adversaries ⋮ Another step towards realizing random oracles: non-malleable point obfuscation ⋮ 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 ⋮ Network-Hiding Communication and Applications to Multi-party Protocols ⋮ Topology-Hiding Computation Beyond Logarithmic Diameter

This page was built for publication: Topology-Hiding Computation