Unconditional Byzantine agreement for any number of faulty processors

DOI10.1007/3-540-55210-3_195zbMath1493.68036OpenAlexW1570025561MaRDI QIDQ5096793

Michael Waidner, Birgit Pfitzmann

Publication date: 18 August 2022

Published in: STACS 92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55210-3_195

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Authentication, digital signatures and secret sharing (94A62) Computer security (68M25)

Related Items (10)

On the round complexity of randomized Byzantine agreement ⋮ Information-theoretic broadcast with dishonest majority for long messages ⋮ Fairness versus guaranteed output delivery in secure multiparty computation ⋮ Completeness theorems for adaptively secure broadcast ⋮ Multi-verifier signatures ⋮ Characterization of secure multiparty computation without broadcast ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ Efficient constant-round MPC with identifiable abort and public verifiability ⋮ Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era ⋮ Broadcast-optimal two-round MPC

Cites Work

• Unnamed Item
• Unnamed Item
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• New hash functions and their use in authentication and set equality
• Authenticated Algorithms for Byzantine Agreement
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Reaching Agreement in the Presence of Faults
• New directions in cryptography
• Probabilistic Algorithms in Finite Fields
• Codes Which Detect Deception
• Inversionless decoding of binary BCH codes

This page was built for publication: Unconditional Byzantine agreement for any number of faulty processors