Strong Separations Between Broadcast and Authenticated Channels

DOI10.4230/LIPICS.DISC.2018.36MaRDI QIDQ5090929zbMATH OpenOpenAlexFDO

Authors Julian Loss, Ueli M. Maurer, Daniel Tschudi

Publication date 21 July 2022

Full work available at URL https://doi.org/10.4230/LIPIcs.DISC.2018.36

zbMATH Keywords

broadcastcryptographyimpossibilitymulti-party computation

Mathematics Subject Classification ID

Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)

Recommendations

• scientific article; zbMATH DE number 1857529
• Authenticated broadcast with a partially compromised public-key infrastructure
• Secure Pseudonymous Channels
• Secure Channels Based on Authenticated Encryption Schemes: A Simple Characterization
• Secure refinements of communication channels
• scientific article; zbMATH DE number 1231619
• Secure implementation of channel abstractions
• Strongly Secure Multiuser Communication and Authentication With Anonymity Constraints

Cites work

• Broadcast amplification
• Broadcast from minicast secure against general adversaries
• Byzantine agreement given partial broadcast
• Detectable Byzantine agreement secure against faulty majorities
• Efficient general-adversary multi-party computation
• From partial consistency to global broadcast
• On Byzantine Agreement over (2,3)-Uniform Hypergraphs
• On the price of equivocation in Byzantine agreement
• Player simulation and general adversary structures in perfect multiparty computation
• The Byzantine Generals Problem
• The Weak Byzantine Generals Problem
• Towards a Theory of Consistency Primitives

Cited in

(1)

• Broadcast amplification

This page was built for publication: Strong Separations Between Broadcast and Authenticated Channels

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