Topology-Hiding Computation Beyond Logarithmic Diameter

DOI10.1007/978-3-319-56617-7_21zbMath1415.94400OpenAlexW2592164191MaRDI QIDQ5270378

Tal Moran, Adi Akavia

Publication date: 23 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56617-7_21

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Topology-hiding computation beyond semi-honest adversaries ⋮ Is information-theoretic topology-hiding computation possible? ⋮ Correction to: ``Topology-hiding communication from minimal assumptions ⋮ Towards practical topology-hiding computation ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Topology-hiding computation on all graphs ⋮ Topology-hiding computation for networks with unknown delays

Cites Work

• Diameter and broadcast time of random geometric graphs in arbitrary dimensions
• 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
• Random Geometric Graphs
• Foundations of Cryptography
• Secure Computation on the Web: Computing without Simultaneous Interaction
• Topology-Hiding Computation
• Multi-input Functional Encryption

This page was built for publication: Topology-Hiding Computation Beyond Logarithmic Diameter