Correction to: ``Topology-hiding communication from minimal assumptions

DOI10.1007/s00145-023-09473-3MaRDI QIDQ6054730

Tal Moran, Lisa Kohl, Elette Boyle, Marshall Ball, Ran Cohen, Pierre-Jean Meyer, Tal Malkin

Publication date: 25 October 2023

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

foundationssecure multiparty computationtopology-hiding computation

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Communication theory (94A05) Computer system organization (68Mxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Computing an st-numbering
• Topology-hiding computation beyond semi-honest adversaries
• Exploring the boundaries of topology-hiding computation
• Security and composition of multiparty cryptographic protocols
• Topology-hiding computation for networks with unknown delays
• Topology-hiding communication from minimal assumptions
• Is information-theoretic topology-hiding computation possible?
• Completeness for symmetric two-party functionalities: revisited
• Network-Hiding Communication and Applications to Multi-party Protocols
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Perfectly secure message transmission
• Universally Composable Synchronous Computation
• Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols
• Topology-Hiding Computation
• Topology-Hiding Computation Beyond Logarithmic Diameter
• Topology-hiding computation on all graphs

This page was built for publication: Correction to: ``Topology-hiding communication from minimal assumptions