Simultaneous broadcast revisited

DOI10.1145/1073814.1073878zbMath1314.68158OpenAlexW1965363108MaRDI QIDQ5177255

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

independencesecure function evaluationparallel broadcast

Mathematics Subject Classification ID

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

Related Items (5)

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

This page was built for publication: Simultaneous broadcast revisited