Topology-hiding computation for networks with unknown delays

DOI10.1007/978-3-030-45388-6_8OpenAlexW3022958501MaRDI QIDQ2055692

Chen-Da Liu-Zhang, Tal Moran, Daniel Tschudi, Marta Mularczyk, Rio LaVigne, Ueli M. Maurer

Publication date: 1 December 2021

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

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (3)

Correction to: ``Topology-hiding communication from minimal assumptions ⋮ Towards practical topology-hiding computation ⋮ Topology-hiding computation for networks with unknown delays

Cites Work

• Unnamed Item
• Unnamed Item
• Eulerian graphs and related topics. Part 1, Volume 2
• Topology-hiding computation beyond semi-honest adversaries
• Exploring the boundaries of topology-hiding computation
• Topology-hiding computation for networks with unknown delays
• Communications in unknown networks: preserving the secret of topology
• Network-Hiding Communication and Applications to Multi-party Protocols
• Probabilistic Termination and Composability of Cryptographic Protocols
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
• Universally composable two-party and multi-party secure computation
• Universally Composable Synchronous Computation
• Asynchronous secure computation
• Topology-Hiding Computation
• Topology-Hiding Computation Beyond Logarithmic Diameter
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• New Constructions for UC Secure Computation Using Tamper-Proof Hardware
• (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
• Topology-hiding computation on all graphs

This page was built for publication: Topology-hiding computation for networks with unknown delays