Topology-hiding computation for networks with unknown delays

DOI10.1007/978-3-030-45388-6_8MaRDI QIDQ2055692zbMATH OpenOpenAlexFDO

Authors Rio LaVigne, Chen-Da Liu-Zhang, Tal Moran, Marta Mularczyk, Daniel Tschudi, 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

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

Recommendations

• Exploring the boundaries of topology-hiding computation
• Towards practical topology-hiding computation
• Is information-theoretic topology-hiding computation possible?
• Towards topology-hiding computation from oblivious transfer
• Correction to: ``Topology-hiding communication from minimal assumptions

Cites work

• (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
• Asynchronous secure computation
• Communications in unknown networks: preserving the secret of topology
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• Efficient constant round multi-party computation combining BMR and SPDZ
• Eulerian graphs and related topics. Part 1, Volume 2
• Exploring the boundaries of topology-hiding computation
• Founding Cryptography on Tamper-Proof Hardware Tokens
• scientific article; zbMATH DE number 2081087 (Why is no real title available?)
• Network-Hiding Communication and Applications to Multi-party Protocols
• New Constructions for UC Secure Computation Using Tamper-Proof Hardware
• Probabilistic Termination and Composability of Cryptographic Protocols
• Topology-hiding computation
• Topology-hiding computation beyond logarithmic diameter
• Topology-hiding computation beyond semi-honest adversaries
• Topology-hiding computation for networks with unknown delays
• Topology-hiding computation on all graphs
• Universally composable synchronous computation
• Universally composable two-party and multi-party secure computation
• Universally composable zero-knowledge arguments and commitments from signature cards

Cited in

(6)

• Topology-hiding computation for networks with unknown delays
• Topology-hiding communication from minimal assumptions
• Correction to: ``Topology-hiding communication from minimal assumptions
• Towards practical topology-hiding computation
• Towards topology-hiding computation from oblivious transfer
• Information-theoretic topology-hiding broadcast: wheels, stars, friendship, and beyond

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

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