Topology-hiding computation

DOI10.1007/978-3-662-46494-6_8MaRDI QIDQ5261628zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cited in

(17)

• Topology-hiding computation on all graphs
• 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
• Exploring the boundaries of topology-hiding computation
• Topology-hiding computation beyond logarithmic diameter
• Enabling collaborative network security with privacy-preserving data aggregation
• Network-Hiding Communication and Applications to Multi-party Protocols
• Topology-hiding computation for networks with unknown delays
• Topology-hiding computation on all graphs
• Information-theoretic topology-hiding broadcast: wheels, stars, friendship, and beyond
• 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

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)