Topology-hiding computation beyond logarithmic diameter

DOI10.1007/978-3-319-56617-7_21MaRDI QIDQ5270378zbMATH OpenOpenAlexFDO

Authors Adi Akavia, Tal Moran

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)

Recommendations

• Topology-hiding computation on all graphs
• Topology-hiding computation on all graphs
• Is information-theoretic topology-hiding computation possible?
• Topology-hiding computation
• Topology-hiding computation beyond semi-honest adversaries

Cites work

• Communications in unknown networks: preserving the secret of topology
• Diameter and broadcast time of random geometric graphs in arbitrary dimensions
• Foundations of Cryptography
• Multi-input functional encryption
• Network-Hiding Communication and Applications to Multi-party Protocols
• Non-interactive secure multiparty computation
• Random Geometric Graphs
• Secure computation on the web: computing without simultaneous interaction
• Secure multiparty computation with general interaction patterns
• The hidden graph model: communication locality and optimal resiliency with adaptive faults
• Topology-hiding computation

Cited in

(15)

• Topology-hiding computation beyond semi-honest adversaries
• On location hiding in distributed systems
• Topology-hiding computation for networks with unknown delays
• Topology-hiding communication from minimal assumptions
• Is information-theoretic topology-hiding computation possible?
• Communications in unknown networks: preserving the secret of topology
• Structural Information and Communication Complexity
• Topology-hiding computation on all graphs
• Topology-hiding computation on all graphs
• Correction to: ``Topology-hiding communication from minimal assumptions
• Must the communication graph of MPC protocols be an expander?
• Towards practical topology-hiding computation
• Towards topology-hiding computation from oblivious transfer
• Information-theoretic topology-hiding broadcast: wheels, stars, friendship, and beyond
• Maintaining sublinear locality over time: adaptively secure MPC on a reusable hidden graph

This page was built for publication: Topology-hiding computation beyond logarithmic diameter

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