Is information-theoretic topology-hiding computation possible?

DOI10.1007/978-3-030-36030-6_20zbMath1455.94116OpenAlexW2991421639MaRDI QIDQ2175925

Ran Cohen, Elette Boyle, Marshall Ball, Tal Malkin, Tal Moran

Publication date: 30 April 2020

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

zbMATH Keywords

adaptively secure low-locality MPCtopology-hiding broadcasttopology-hiding computation

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 ⋮ Must the communication graph of MPC protocols be an expander?

Cites Work

• Must the communication graph of MPC protocols be an expander?
• Private computation: \(k\)-connected versus 1-connected networks
• Easy impossibility proofs for distributed consensus problems
• Reliable communication over partially authenticated networks
• Topology-hiding computation beyond semi-honest adversaries
• Exploring the boundaries of topology-hiding computation
• On private computation in incomplete networks
• Security and composition of multiparty cryptographic protocols
• Communications in unknown networks: preserving the secret of topology
• Secure Multiparty Computation with General Interaction Patterns
• Network-Hiding Communication and Applications to Multi-party Protocols
• Non-Interactive Secure Multiparty Computation
• The Hidden Graph Model
• Edge Fault Tolerance on Sparse Networks
• Fault Tolerance in Networks of Bounded Degree
• The Byzantine generals strike again
• Perfectly secure message transmission
• Communication Locality in Secure Multi-party Computation
• Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction
• On perfectly secure communication over arbitrary networks
• Secure Computation on the Web: Computing without Simultaneous Interaction
• Topology-Hiding Computation
• Topology-Hiding Computation Beyond Logarithmic Diameter
• Topology-hiding computation on all graphs
• Efficient reliable communication over partially authenticated networks

This page was built for publication: Is information-theoretic topology-hiding computation possible?