Byzantine Agreement Using Partial Authentication
DOI10.1007/978-3-642-24100-0_38zbMATH Open1350.68033OpenAlexW75522826MaRDI QIDQ3095344FDOQ3095344
Authors: Piyush Bansal, Prasant Gopal, Anuj Gupta, Pranav Kumar Vasishta, Kannan Srinathan
Publication date: 28 October 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24100-0_38
Recommendations
- Authenticated Algorithms for Byzantine Agreement
- Byzantine agreement given partial broadcast
- On the composition of authenticated Byzantine Agreement
- scientific article; zbMATH DE number 1154413
- scientific article; zbMATH DE number 1973984
- Asynchronous byzantine agreement protocols
- A hybrid protocol to solve authenticated Byzantine consensus
- scientific article; zbMATH DE number 7774289
Distributed algorithms (68W15) Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)
Cites Work
- Title not available (Why is that?)
- Player simulation and general adversary structures in perfect multiparty computation
- Authenticated Algorithms for Byzantine Agreement
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- The Byzantine generals strike again
- Perfectly secure message transmission
- Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
- Authenticated Byzantine generals in dual failure model
- Byzantine Agreement Using Partial Authentication
Cited In (14)
- Title not available (Why is that?)
- Authenticated Byzantine generals in dual failure model
- Levels of authentication in distributed agreement
- On Byzantine Agreement over (2,3)-Uniform Hypergraphs
- On the composition of authenticated Byzantine Agreement
- Byzantine Agreement Using Partial Authentication
- On the number of authenticated rounds in Byzantine Agreement
- Fast agreement in networks with Byzantine nodes
- Efficient reliable communication over partially authenticated networks
- Title not available (Why is that?)
- Byzantine fault tolerant public key authentication in peer-to-peer systems
- On the price of equivocation in Byzantine agreement
- Byzantine agreement given partial broadcast
- Multidimensional Byzantine agreement in a synchronous setting
This page was built for publication: Byzantine Agreement Using Partial Authentication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095344)