نتایج جستجو برای: byzantine attack

تعداد نتایج: 83821  

2002
Jean-Philippe Martin Lorenzo Alvisi Michael Dahlin

In this paper we present two protocols for asynchronous Byzantine Quorum Systems (BQS) built on top of reliable channels—one for self-verifying data and the other for any data. Our protocols tolerate f Byzantine failures with f fewer servers than existing solutions by eliminating nonessential work in the write protocol and by using read and write quorums of different sizes. In practice, however...

Journal: :Byzantinische Zeitschrift 1910

Journal: :CoRR 2012
Annu John Igor Konnov Ulrich Schmid Helmut Veith Josef Widder

We introduce an automated parameterized verification method for fault-tolerant distributed algorithms (FTDA). FTDAs are parameterized by both the number of processes and the assumed maximum number of Byzantine faulty processes. At the center of our technique is a parametric interval abstraction (PIA) where the interval boundaries are arithmetic expressions over parameters. Using PIA for both da...

2007
Len Sassaman Bart Preneel

Over the last several decades, there have been numerous proposals for systems which can preserve the anonymity of the recipient of some data. Some have involved trusted third-parties or trusted hardware; others have been constructed on top of link-layer anonymity systems or mix-nets. In this paper, we evaluate a pseudonymous message system which takes the different approach of using Private Inf...

2018
V. Strobel E. Castelló Volker Strobel Eduardo Castelló Ferrer Marco Dorigo

While swarm robotics systems are often claimed to be highly fault-tolerant, so far research has limited its attention to safe laboratory settings and has virtually ignored security issues in the presence of Byzantine robots—i.e., robots with arbitrarily faulty or malicious behavior. However, in many applications one or a few Byzantine robots might suffice to let current swarm coordination mecha...

2015
Achour Mostéfaoui Michel Raynal

This paper presents a new algorithm that reduces multivalued consensus to binary consensus in an asynchronous message-passing system made up of n processes where up to t may commit Byzantine failures. This algorithm has the following noteworthy properties: it assumes t < n/3 (and is consequently optimal from a resilience point of view), uses O(n) messages, has a constant time complexity, and do...

2007
CHRIS GILLEARD

This paper examines the status afforded old age in the Byzantine Empire. Frequently neglected in accounts of state formation or comparative history, this Christian imperial state transformed the moral ordering of the lifecourse. In contrast to both classical Greek and Roman society, old age acquired a distinct moral authority in Byzantine society. This status was not confined to a few members o...

2015
Vaishali Sahare

MANET is the collection of various wireless mobile nodes. Security is of high concern in mobile ad hoc network as it has no centralized authority which can oversee the particular node working in the network. The attacks can be preformed from both inside and outside the network. Nodes within surrounding to gain common radio link can be often used to set up ad hoc infrastructure. But the safe com...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید