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

DOI10.1007/S00145-023-09473-3MaRDI QIDQ6054730zbMATH OpenFDO

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

Publication date 25 October 2023

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

Full work available at URL https://doi.org/10.1007/S00145-023-09473-3

zbMATH Keywords

foundationssecure multiparty computationtopology-hiding computation

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• Completeness for symmetric two-party functionalities: revisited
• Computational two-party correlation: a dichotomy for key-agreement protocols
• Computing an st-numbering
• Exploring the boundaries of topology-hiding computation
• scientific article; zbMATH DE number 3949734 (Why is no real title available?)
• scientific article; zbMATH DE number 176562 (Why is no real title available?)
• scientific article; zbMATH DE number 1030984 (Why is no real title available?)
• Is information-theoretic topology-hiding computation possible?
• Network-Hiding Communication and Applications to Multi-party Protocols
• Perfectly secure message transmission
• Reaching Agreement in the Presence of Faults
• Security and composition of multiparty cryptographic protocols
• The Byzantine Generals Problem
• The Byzantine generals strike again
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Topology-hiding communication from minimal assumptions
• 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

Cited in

(3)

• Topology-hiding computation for networks with unknown delays
• Topology-hiding communication from minimal assumptions
• Towards topology-hiding computation from oblivious transfer

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

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