Authenticated Byzantine generals in dual failure model
From MaRDI portal
Publication:3406476
Recommendations
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 1024040 (Why is no real title available?)
- A method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Authenticated Algorithms for Byzantine Agreement
- From partial consistency to global broadcast
- Identity-based cryptosystems and signature schemes
- Impossibility of distributed consensus with one faulty process
- New lattice-based cryptographic constructions
- On Robust Combiners for Oblivious Transfer and Other Primitives
- On Robust Combiners for Private Information Retrieval and Other Primitives
- On expected constant-round protocols for Byzantine agreement
- On the composition of authenticated byzantine agreement
- On the minimal synchronism needed for distributed consensus
- On the number of authenticated rounds in Byzantine Agreement
- Reaching Agreement in the Presence of Faults
- Robuster Combiners for Oblivious Transfer
- The Byzantine Generals Problem
- The Byzantine generals strike again
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(5)- Zombies and ghosts: optimal Byzantine agreement in the presence of omission faults
- Byzantine Agreement Using Partial Authentication
- Byzantine fault tolerant public key authentication in peer-to-peer systems
- Authenticated broadcast with a partially compromised public-key infrastructure
- Player-centric Byzantine agreement
This page was built for publication: Authenticated Byzantine generals in dual failure model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3406476)