Applications of Byzantine agreement in database systems
ACM Transactions on Database Systems (TODS)
Early stopping in Byzantine agreement
Journal of the ACM (JACM)
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
Information and Computation
Byzantine Agreement in a Generalized Connected Network
IEEE Transactions on Parallel and Distributed Systems
Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
A Note on Consensus on Dual Failure Modes
IEEE Transactions on Parallel and Distributed Systems
Diffie-Hellman key distribution extended to group communication
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Communication complexity of group key distribution
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Consensus under unreliable transmission
Information Processing Letters
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Data Communications Computer Networks and Open Systems 3rd Ed.
Data Communications Computer Networks and Open Systems 3rd Ed.
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey)
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Byzantine clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
ICPADS '02 Proceedings of the 9th International Conference on Parallel and Distributed Systems
Streets of Byzantium: Network Architectures for Fast Reliable Broadcasts
IEEE Transactions on Software Engineering
New directions in cryptography
IEEE Transactions on Information Theory
Performance study of Byzantine Agreement Protocol with artificial neural network
Information Sciences: an International Journal
Computers and Electrical Engineering
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Networks are trending towards wireless systems that provide support for mobile computing. The Byzantine Agreement (BA) protocols used in static networks do not perform well in a dynamically changing mobile environment. Mobile commerce and related applications are necessary for wireless networks. There are numerous properties in a wireless network that play important roles. For example, the processors in a wireless network have highly mobile capabilities. Processors can immigrate into or move away from the network at any time. Although mobile technology has brought greater convenience, it is comparatively more dangerous. Wireless systems are susceptible to security flaws such as attacks by hackers. The number of allowable faulty components within the system is also decreased. To increase the number of allowable faulty components and ensure network security, a simple, secure and efficient protocol, BAM, is proposed to handle the BA problem. The fault symptoms include malicious and dormant faults. Furthermore, the proposed protocol uses the minimum number of message exchange rounds to make all healthy processors agree on a common value and can tolerate the maximum number of allowable faulty components. The proposed method will also ensure message security and increase the system's fault tolerant capability.