Adaptively secure broadcast, revisited

DOI10.1145/1993806.1993832zbMath1321.94060OpenAlexW2035527360MaRDI QIDQ2943395

Juan A. Garay, Hong-Sheng Zhou, Ranjit Kumaresan, Jonathan N. Katz

Publication date: 11 September 2015

Published in: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

cryptographic protocolsbroadcastadaptive securityfault-tolerant distributed computing

Mathematics Subject Classification ID

Cryptography (94A60) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items

The consensus number of a cryptocurrency, Synchronous consensus with optimal asynchronous fallback guarantees, Constant-round linear-broadcast secure computation with penalties, Formalizing delayed adaptive corruptions and the security of flooding networks, Constant-round adaptive zero-knowledge proofs for NP, Completeness theorems for adaptively secure broadcast, Communication complexity of Byzantine agreement, revisited, Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications, MPC with synchronous security and asynchronous responsiveness, Must the communication graph of MPC protocols be an expander?, Sublinear-round Byzantine agreement under corrupt majority

Cites Work

• Unnamed Item
• Gradient clock synchronization in dynamic networks
• Consensus algorithms with one-bit messages
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Broadcasting in dynamic radio networks
• Programming simultaneous actions using common knowledge
• Continuous consensus via common knowledge
• Distributed computation in dynamic networks
• Flooding time in edge-Markovian dynamic graphs
• Knowledge and common knowledge in a distributed environment
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony
• Fault Tolerance in Networks of Bounded Degree
• Reaching Agreement in the Presence of Faults
• Perfectly secure message transmission
• Parsimonious flooding in dynamic graphs
• Optimal gradient clock synchronization in dynamic networks
• Almost-Everywhere Secure Computation