Simultaneous broadcast revisited

DOI10.1145/1073814.1073878MaRDI QIDQ5177255zbMATH OpenOpenAlexFDO

Authors Alejandro Hevia, Daniele Micciancio

Publication date 10 March 2015

Published in Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1073814.1073878

zbMATH Keywords

independenceparallel broadcastsecure function evaluation

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Stochastic network models in operations research (90B15) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Efficient Simultaneous Broadcast
• scientific article; zbMATH DE number 3884101
• Universally Composable Simultaneous Broadcast
• Broadcasting from multiple originators
• Broadcasting multiple messages in simultaneous send/receive systems
• Dynamic simulcasting: design and optimization
• On time-relaxed broadcasting networks
• Structural Information and Communication Complexity
• On reversibility and broadcast

Cited in

(6)

• On expected constant-round protocols for Byzantine agreement
• Quantum anonymous ranking and selection with verifiability
• Information-Theoretic Security Without an Honest Majority
• Universally Composable Simultaneous Broadcast
• Efficient Simultaneous Broadcast
• Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications

This page was built for publication: Simultaneous broadcast revisited

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