Results 81 to 90 of about 1,316 (199)

Byzantine Fault Tolerant Causal Ordering

, 2021
Causal ordering in an asynchronous system has many applications in distributed computing, including in replicated databases and real-time collaborative software.
Misra, Anshuman, Kshemkalyani, Ajay
core   +1 more source

Scrooge: Reducing the costs of fast Byzantine replication in presence of unresponsive replicas

, 2010
Byzantine-Fault-Tolerant (BFT) state machine replication is an appealing technique to tolerate arbitrary failures. However, Byzantine agreement incurs a fundamental trade-off between being fast (i.e. optimal latency) and achieving optimal resilience (i.e.
Majuntke, M., Marco Serafini, Dan Dobre, Suri, Neeraj, Bokor, P., Dobre, D., Matthias Majuntke, Serafini, M., Neeraj Suri, Peter Bokor   +9 more
core   +1 more source

Federated Learning Framework for Efficient and Secure Anomaly Detection in Industrial Control Systems

Journal of Computer Networks and Communications
Industrial control systems (ICS) are increasingly vulnerable to cybersecurity threats due to the integration of IoT devices and operational technology networks.
Emmanuel Osei Owusu, Danlard Iddrisu, Griffith Selorm Klogo, Kwame Osei Boateng, Emmanuel Kofi Akowuah   +4 more
doaj   +1 more source

Reliable communication in multihop networks despite byzantine failures

, 2014
A mesure que les réseaux s'étendent, ils deviennent de plus en plus susceptibles de défaillir. En effet, leurs nœuds peuvent être sujets à des attaques, pannes, corruptions de mémoire...
Maurer, Alexandre
core  

A Scalable Byzantine Grid

, 2013
17 pagesInternational audienceModern networks assemble an ever growing number of nodes. However, it remains difficult to increase the number of channels per node, thus the maximal degree of the network may be bounded.
Sébastien Tixeuil, Alexandre Maurer, Tixeuil, Sébastien, Maurer, Alexandre   +3 more
core   +1 more source

Abstracting out Byzantine Behavior [PDF]

, 2007
Many distributed systems are designed to tolerate the presence of emph{Byzantine} failures: an individual process may arbitrarily deviate from the algorithm assigned to it.
Druschel, Peter, Haeberlen, Andreas, Kouznetsov, Petr   +2 more
core   +1 more source

Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register

, 2018
This paper addresses for the first time the problem of MWMR atomic memory in a Mobile Byzantine Agents model. The register is maintained by n servers and faulty (Byzantine) agents move from one server to another and when they are affecting a server, this
Antonella Del Pozzo, Del Pozzo, Antonella, POTOP BUTUCARU, MARIA, Potop-Butucaru, Maria, Silvia Bonomi, Bonomi, Silvia, Maria Potop-Butucaru   +6 more
core   +1 more source

A Proposal to investigate the use of error correcting code techniques in implementing distributed systems resistant to Byzantine failures and security breaches

, 1993
This paper proposes a method for dealing with these sort of failures. Fail-stop or non-Byzantine failures typically are characterised by the component or system involved ceasing to transmit or receive messages; effectively removing itself from the ...
Rob Good
core  

Tight self-stabilizing mobile byzantine-tolerant atomic register

, 2016
This paper proposes the first implementation of a self-stabilizing atomic register that is tolerant to both Mobile Byzantine Agents and transient failures.
Antonella Del Pozzo, BONOMI, Silvia, Potop-Butucaru, Maria, DEL POZZO, ANTONELLA, Potop Butucaru, Maria, Silvia Bonomi, Maria Potop-Butucaru   +6 more
core   +1 more source

A SURVIVABLE DISTRIBUTED DATABASE AGAINST BYZANTINE FAILURE

Journal of Natural Sciences Engineering and Technology, 2017
Distributed Database Systems have been very useful technologies in making a wide range of information available to users across the World. However, there are now growing security concerns, arising from the use of distributed systems, particularly the ones attached to critical systems.
D O ABORISADE, A S SODIYA, A A ODUMOSU, O Y ALOWOSILE, A A ADEDEJI   +4 more
openaire   +2 more sources