Performance study of Byzantine agreement protocol with artificial neural network

DOI10.1016/j.ins.2007.04.011zbMath1126.68011MaRDI QIDQ2384832

Kok-Wah Lee, Hong-Tat Ewe

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

zbMATH Keywords

Cryptology; Fault tolerance; Byzantine agreement; Artificial neural networks; Communication protocol

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

68M12: Network protocols

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