Performance study of Byzantine agreement protocol with artificial neural network
From MaRDI portal
Publication:2384832
DOI10.1016/j.ins.2007.04.011zbMath1126.68011OpenAlexW2017129619MaRDI QIDQ2384832
Publication date: 10 October 2007
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2007.04.011
Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)
Cites Work
- Unnamed Item
- Unnamed Item
- A lower bound for the time to assure interactive consistency
- Consensus under unreliable transmission
- A speaker identification system using a model of artificial neural networks for an elevator application
- A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
- A flexible formal framework for masking/demasking faults
- Byzantine fault tolerant public key authentication in peer-to-peer systems
- Discovering Network Topology in the Presence of Byzantine Faults
- The Weak Byzantine Generals Problem
- Reaching Agreement in the Presence of Faults
- New directions in cryptography
- The Byzantine Generals Problem
- The Byzantine generals strike again
- Fault-Tolerant Systems
- Optimally efficient multi-valued byzantine agreement
- On Byzantine Agreement over (2,3)-Uniform Hypergraphs