Detectable byzantine agreement secure against faulty majorities
From MaRDI portal
Publication:5170873
DOI10.1145/571825.571841zbMath1292.68029OpenAlexW1990955330MaRDI QIDQ5170873
No author found.
Publication date: 25 July 2014
Published in: Proceedings of the twenty-first annual symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/571825.571841
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
Broadcast (and Round) Efficient Verifiable Secret Sharing ⋮ Secure Protocols with Asymmetric Trust ⋮ Quantum detectable Byzantine agreement for distributed data trust management in blockchain ⋮ Fairness versus guaranteed output delivery in secure multiparty computation ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ MPC with synchronous security and asynchronous responsiveness ⋮ Resource fairness and composability of cryptographic protocols ⋮ Secure computation without authentication ⋮ Characterization of secure multiparty computation without broadcast ⋮ On the power of an honest majority in three-party computation without broadcast ⋮ Yet another compiler for active security or: efficient MPC over arbitrary rings ⋮ Characterization of Secure Multiparty Computation Without Broadcast ⋮ Strong Separations Between Broadcast and Authenticated Channels ⋮ Quantum Byzantine agreement with tripartite entangled states ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback ⋮ Practical quantum Byzantine protocol via nearly optimal entanglement resources ⋮ Broadcast-optimal two-round MPC
