Authenticated Byzantine Generals in Dual Failure Model
From MaRDI portal
Publication:3406476
DOI10.1007/978-3-642-11322-2_12zbMath1350.68035OpenAlexW157980196MaRDI QIDQ3406476
Prasant Gopal, Piyush Bansal, Anuj Gupta, Kannan Srinathan
Publication date: 16 February 2010
Published in: Distributed Computing and Networking (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11322-2_12
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 (3)
Authenticated broadcast with a partially compromised public-key infrastructure ⋮ Player-Centric Byzantine Agreement ⋮ Byzantine Agreement Using Partial Authentication
Cites Work
- Unnamed Item
- Unnamed Item
- On expected constant-round protocols for Byzantine agreement
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Identity-Based Cryptosystems and Signature Schemes
- Authenticated Algorithms for Byzantine Agreement
- From partial consistency to global broadcast
- Trapdoors for hard lattices and new cryptographic constructions
- On the composition of authenticated byzantine agreement
- Robuster Combiners for Oblivious Transfer
- 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
- A method for obtaining digital signatures and public-key cryptosystems
- On Robust Combiners for Oblivious Transfer and Other Primitives
- New lattice-based cryptographic constructions
- On Robust Combiners for Private Information Retrieval and Other Primitives
- On the number of authenticated rounds in Byzantine Agreement
This page was built for publication: Authenticated Byzantine Generals in Dual Failure Model
