Topology-hiding computation

DOI10.1007/978-3-662-46494-6_8zbMATH Open1354.94041OpenAlexW2140260792MaRDI QIDQ5261628FDOQ5261628

Authors: Tal Moran, Ilan Orlov, Silas Richelson 

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

Recommendations

• Topology-hiding computation on all graphs
• Topology-hiding computation beyond semi-honest adversaries
• Network-Hiding Communication and Applications to Multi-party Protocols
• Is information-theoretic topology-hiding computation possible?
• Almost-Everywhere Secure Computation

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (14)

• Another step towards realizing random oracles: non-malleable point obfuscation
• Topology-hiding communication from minimal assumptions
• Towards topology-hiding computation from oblivious transfer
• Topology-hiding computation beyond semi-honest adversaries
• Enabling collaborative network security with privacy-preserving data aggregation
• Network-Hiding Communication and Applications to Multi-party Protocols
• Topology-hiding computation on all graphs
• Topology-hiding computation for networks with unknown delays
• Is information-theoretic topology-hiding computation possible?
• Almost-Everywhere Secure Computation
• Must the communication graph of MPC protocols be an expander?
• Correction to: ``Topology-hiding communication from minimal assumptions
• Towards practical topology-hiding computation
• Topology-Hiding Computation Beyond Logarithmic Diameter

This page was built for publication: Topology-hiding computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261628)