Unconditional Byzantine agreement for any number of faulty processors (extended abstract)

DOI10.1007/3-540-55210-3_195MaRDI QIDQ5096793zbMATH OpenOpenAlexFDO

Authors Birgit Pfitzmann, Michael Waidner

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) Computer security (68M25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 176512
• Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
• Authenticated Algorithms for Byzantine Agreement
• On the composition of authenticated Byzantine Agreement
• Byzantine agreement given partial broadcast

Cites work

• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Authenticated Algorithms for Byzantine Agreement
• Codes Which Detect Deception
• scientific article; zbMATH DE number 176512 (Why is no real title available?)
• scientific article; zbMATH DE number 3482343 (Why is no real title available?)
• Inversionless decoding of binary BCH codes
• New directions in cryptography
• New hash functions and their use in authentication and set equality
• Probabilistic Algorithms in Finite Fields
• Reaching Agreement in the Presence of Faults
• The dining cryptographers problem: Unconditional sender and recipient untraceability

Cited in

(21)

• Information-theoretic broadcast with dishonest majority for long messages
• Fairness versus guaranteed output delivery in secure multiparty computation
• Characterization of secure multiparty computation without broadcast
• The Do-All problem with Byzantine processor failures
• 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
• On the round complexity of randomized Byzantine agreement
• Agreement under faulty interfaces
• scientific article; zbMATH DE number 5506092 (Why is no real title available?)
• scientific article; zbMATH DE number 176512 (Why is no real title available?)
• Consensus in the presence of mortal Byzantine faulty processes
• Multi-verifier signatures
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Tolerating Random Byzantine Failures in an Unbounded Network
• A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract)
• Completeness theorems for adaptively secure broadcast
• Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
• Asymptotically optimal early termination for dishonest majority broadcast
• Communication lower bounds for cryptographic broadcast protocols

This page was built for publication: Unconditional Byzantine agreement for any number of faulty processors (extended abstract)

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