Relevant bibliographies by topics / Byzantine failure

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Byzantine failure'

Author: Grafiati
Published: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Byzantine failure.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Byzantine failure"

1

Raynal, Michel. "On the Versatility of Bracha’s Byzantine Reliable Broadcast Algorithm." Parallel Processing Letters 31, no. 03 (2021): 2150006. http://dx.doi.org/10.1142/s0129626421500067.

Full text
Abstract:
G. Bracha presented in 1987 a simple and efficient reliable broadcast algorithm for [Formula: see text]-process asynchronous message-passing systems, which tolerates up to [Formula: see text] Byzantine processes. Following an idea recently introduced by Hirt, Kastrato and Liu-Zhang (OPODIS 2020), instead of considering the upper bound on the number of Byzantine processes [Formula: see text], the present short article considers two types of Byzantine behavior: the ones that can prevent the safety property from being satisfied, and the ones that can prevent the liveness property from being satis
APA, Harvard, Vancouver, ISO, and other styles
2

ABORISADE, D. O., A. S. SODIYA, A. A. ODUMOSU, O. Y. ALOWOSILE, and A. A. ADEDEJI. "A SURVIVABLE DISTRIBUTED DATABASE AGAINST BYZANTINE FAILURE." Journal of Natural Sciences Engineering and Technology 15, no. 2 (2017): 61–72. http://dx.doi.org/10.51406/jnset.v15i2.1684.

Full text
Abstract:
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. More than ever before, data in distributed databases are more susceptible to attacks, failures or accidents owing to advanced knowledge explosions in network and database technologies. The imperfection of the existing security mechanisms coupled with the heightened and growing concerns for intrusion, attack, comp
APA, Harvard, Vancouver, ISO, and other styles
3

PAQUETTE, MICHEL, and ANDRZEJ PELC. "FAST BROADCASTING WITH BYZANTINE FAULTS." International Journal of Foundations of Computer Science 17, no. 06 (2006): 1423–39. http://dx.doi.org/10.1142/s0129054106004492.

Full text
Abstract:
We construct and analyze a fast broadcasting algorithm working in the presence of Byzantine component faults. Such faults are particularly difficult to deal with, as faulty components may behave arbitrarily (even maliciously) as transmitters, by either blocking, rerouting, or altering transmitted messages in a way most detrimental to the broadcasting process. We assume that links and nodes of a communication network are subject to Byzantine failures, and that faults are distributed randomly and independently, with link failure probability p and node failure probability q, these parameters bein
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Shu-Ching, and Kuo-Qin Yan. "Byzantine Agreement under dual failure mobile network." Computer Standards & Interfaces 28, no. 4 (2006): 475–92. http://dx.doi.org/10.1016/j.csi.2005.03.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

FRIEDMAN, ROY, ACHOUR MOSTEFAOUI, and MICHEL RAYNAL. "$\diamondsuit {\mathcal P}_{mute}$-BASED CONSENSUS for ASYNCHRONOUS BYZANTINE SYSTEMS." Parallel Processing Letters 15, no. 01n02 (2005): 169–82. http://dx.doi.org/10.1142/s0129626405002131.

Full text
Abstract:
This paper presents a consensus protocol for asynchronous distributed systems made up of n processes, where up to f<n/4 processes can behave arbitrarily (Byzantine processes). The protocol assumes that the underlying system is equipped with an unreliable failure detector of the class [Formula: see text]. The failure detectors of the class [Formula: see text] ensure that (1) all mute processes are detected (a mute process is a process that, after some time, stops sending protocol messages), and (2) after some unknown but finite time, no correct process is suspected (mute processes are a subs
APA, Harvard, Vancouver, ISO, and other styles
6

Porada, Aleksandra. "Kardynał Bessarion i jego księgozbiór." Bibliotekarz Podlaski Ogólnopolskie Naukowe Pismo Bibliotekoznawcze i Bibliologiczne 60, no. 3 (2023): 297–324. http://dx.doi.org/10.36770/bp.834.

Full text
Abstract:
Cardinal Bessarion (ca. 1400–1472), a theologian born in Trebizond and educated in Byzantium, made a career in the hierarchy of the Byzantine clergy and attracted the attention of the imperial family. He was one of the most active participants of the Council of Ferrara-Florence (1438–1439). Following the failure of the church union in Constantinople, Bessarion came to work for the papal curia in Rome. As a cardinal he used his income and contacts to help Byzantine refugees and Greeks living under the rule of the Republic of Venice, especially after the fall of Constantinople. Fearing that the
APA, Harvard, Vancouver, ISO, and other styles
7

Betancourt, Roland. "Faltering images: failure and error in Byzantine manuscript illumination." Word & Image 32, no. 1 (2016): 1–20. http://dx.doi.org/10.1080/02666286.2016.1143766.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Maurer, Alexandre, and Sebastien Tixeuil. "Tolerating Random Byzantine Failures in an Unbounded Network." Parallel Processing Letters 26, no. 01 (2016): 1650003. http://dx.doi.org/10.1142/s0129626416500031.

Full text
Abstract:
In a context where networks grow larger and larger, their nodes become more likely to fail. Indeed, they may be subject to crashes, attacks, memory corruptions… To encompass all possible types of failure, we consider the most general model of failure: the Byzantine model, where any failing node may exhibit arbitrary (and potentially malicious) behavior. We consider an asynchronous grid-shaped network where each node has a probability λ to be Byzantine. Our metric is the communication probability, that is, the probability that any two nodes communicate reliably. A number of Byzantine-resilient
APA, Harvard, Vancouver, ISO, and other styles
9

Karavites, Peter. "Gregory Nazianzinos and Byzantine hymnography." Journal of Hellenic Studies 113 (November 1993): 81–98. http://dx.doi.org/10.2307/632399.

Full text
Abstract:
Frequent references have been made by several scholars to the use of Gregory's writings as a ‘mine’ for Byzantine hymnography. The discussions have usually stopped with three or four quick citations of the instances that best exemplify the borrowing. To date there has not been any systematic effort to research the topic in greater detail. This failure is understandable. Such a research presupposes knowledge not only of Gregory's writings, a major task in itself since his works occupy four volumes of PG, but also of Byzantine hymnography which is scattered throughout several volumes used by the
APA, Harvard, Vancouver, ISO, and other styles
10

Honoré, Wolf, Longfei Qiu, Yoonseung Kim, Ji-Yong Shin, Jieung Kim, and Zhong Shao. "AdoB: Bridging Benign and Byzantine Consensus with Atomic Distributed Objects." Proceedings of the ACM on Programming Languages 8, OOPSLA1 (2024): 419–48. http://dx.doi.org/10.1145/3649826.

Full text
Abstract:
Achieving consensus is a challenging and ubiquitous problem in distributed systems that is only made harder by the introduction of malicious byzantine servers. While significant effort has been devoted to the benign and byzantine failure models individually, no prior work has considered the mechanized verification of both in a generic way. We claim this is due to the lack of an appropriate abstraction that is capable of representing both benign and byzantine consensus without either losing too much detail or becoming impractically complex. We build on recent work on the atomic distributed obje
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Byzantine failure"

1

Del, Pozzo Antonella. "Building distributed computing abstractions in the presence of mobile byzantine failures." Thesis, Paris 6, 2017. http://www.theses.fr/2017PA066159/document.

Full text
Abstract:
Dans cette thèse on s’intéresse à un modèle de faute Byzantins Mobiles. Jusqu’à présent, seulement le problème du Consensus a été résolu en présente de faute Byzantines Mobiles et plusieurs variations de ce modèle de faute ont été proposé. Pour chacun de ces modelés ont été prouvées les bornes inferieures du nombre de processus correct nécessaire et des solutions asymptotiquement optimales ont été proposées. Notre première contribution porte sur les registres repartis dans ce modèle. Les registres repartis sont l’abstraction à la base du stockage reparti. Ces résultats préconisent donc notre d
APA, Harvard, Vancouver, ISO, and other styles
2

Del, Pozzo Antonella. "Building distributed computing abstractions in the presence of mobile byzantine failures." Electronic Thesis or Diss., Paris 6, 2017. http://www.theses.fr/2017PA066159.

Full text
Abstract:
Dans cette thèse on s’intéresse à un modèle de faute Byzantins Mobiles. Jusqu’à présent, seulement le problème du Consensus a été résolu en présente de faute Byzantines Mobiles et plusieurs variations de ce modèle de faute ont été proposé. Pour chacun de ces modelés ont été prouvées les bornes inferieures du nombre de processus correct nécessaire et des solutions asymptotiquement optimales ont été proposées. Notre première contribution porte sur les registres repartis dans ce modèle. Les registres repartis sont l’abstraction à la base du stockage reparti. Ces résultats préconisent donc notre d
APA, Harvard, Vancouver, ISO, and other styles
3

Farina, Giovanni. "Tractable Reliable Communication in Compromised Networks." Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS310.

Full text
Abstract:
Une communication fiable est une primitive fondamentale dans les systèmes distribués sujets aux pannes Byzantines (c'est-à-dire arbitraires et éventuellement malveillants) pour garantir l'intégrité, l’authenticité et la livraison des messages échangés entre les processus. Son adoption pratique dépend fortement des hypothèses du système. Plusieurs solutions ont été proposées jusqu'à présent dans la littérature mettant en œuvre une telle primitive, mais certaines manquent d'évolutivité et / ou exigent des conditions de réseau topologiques difficiles à vérifier. Cette thèse vise à étudier et à ré
APA, Harvard, Vancouver, ISO, and other styles
4

Maurer, Alexandre. "Communication fiable dans les réseaux multi-sauts en présence de fautes byzantines." Thesis, Paris 6, 2014. http://www.theses.fr/2014PA066347/document.

Full text
Abstract:
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... Afin d'englober tous les types de fautes possibles, nous considérons le modèle le plus général possible : le modèle Byzantin, où les nœuds fautifs ont un comportement arbitraire (et donc, potentiellement malveillant). De telles fautes sont extrêmement dangereuses : un seul nœud Byzantin, s'il n'est pas neutralisé, peut déstabiliser l'intégralité du réseau.Nous considérons le problème d'échanger fiablement des
APA, Harvard, Vancouver, ISO, and other styles
5

Maurer, Alexandre. "Communication fiable dans les réseaux multi-sauts en présence de fautes byzantines." Electronic Thesis or Diss., Paris 6, 2014. http://www.theses.fr/2014PA066347.

Full text
Abstract:
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... Afin d'englober tous les types de fautes possibles, nous considérons le modèle le plus général possible : le modèle Byzantin, où les nœuds fautifs ont un comportement arbitraire (et donc, potentiellement malveillant). De telles fautes sont extrêmement dangereuses : un seul nœud Byzantin, s'il n'est pas neutralisé, peut déstabiliser l'intégralité du réseau.Nous considérons le problème d'échanger fiablement des
APA, Harvard, Vancouver, ISO, and other styles
6

Abid, Muhammad Zeeshan. "A Multi-leader Approach to Byzantine Fault Tolerance : Achieving Higher Throughput Using Concurrent Consensus." Thesis, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-170553.

Full text
Abstract:
Byzantine Fault Tolerant protocols are complicated and hard to implement.Today’s software industry is reluctant to adopt these protocols because of thehigh overhead of message exchange in the agreement phase and the high resourceconsumption necessary to tolerate faults (as 3 f + 1 replicas are required totolerate f faults). Moreover, total ordering of messages is needed by mostclassical protocols to provide strong consistency in both agreement and executionphases. Research has improved throughput of the execution phase by introducingconcurrency using modern multicore infrastructures in recent
APA, Harvard, Vancouver, ISO, and other styles
7

FARINA, GIOVANNI. "Tractable reliable communication in compromised networks." Doctoral thesis, 2020. http://hdl.handle.net/11573/1479204.

Full text
Abstract:
Reliable communication is a fundamental primitive in distributed systems prone to Byzantine (i.e. arbitrary, and possibly malicious) failures to guarantee the integrity, delivery, and authorship of the messages exchanged between processes. Its practical adoption strongly depends on the system assumptions. Several solutions have been proposed so far in the literature implementing such a primitive, but some lack in scalability and/or demand topological network conditions computationally hard to be verified. This thesis aims to investigate and address some of the open problems and challenges im
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Byzantine failure"

1

Lenski, Noel Emmanuel. Failure of empire: Valens and the Roman state in the fourth century A.D. University of California Press, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Failure of empire: Valens and the Roman state in the fourth century A.D. University of California Press, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lenski, Noel. Failure of Empire: Valens and the Roman State in the Fourth Century A.D. University of California Press, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lenski, Noel. Failure of Empire: Valens and the Roman State in the Fourth Century A.D. University of California Press, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lenski, Noel. Failure of Empire: Valens and the Roman State in the Fourth Century A. D. University of California Press, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Byzantine failure"

1

Doudou, Assia, Benoît Garbinato, and Rachid Guerraoui. "Encapsulating Failure Detection: From Crash to Byzantine Failures." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-48046-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bazzi, Rida A., and Maurice Herlihy. "Enhanced Fault-Tolerance through Byzantine Failure Detection." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10877-8_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gupta, Anuj, Prasant Gopal, Piyush Bansal, and Kannan Srinathan. "Authenticated Byzantine Generals in Dual Failure Model." In Distributed Computing and Networking. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11322-2_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Le Brun, Matthew Alan, and Ornela Dardha. "MAG$$\pi $$: Types for Failure-Prone Communication." In Programming Languages and Systems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30044-8_14.

Full text
Abstract:
AbstractMultiparty Session Types (MPST) are a typing discipline for communication-centric systems, guaranteeing communication safety, deadlock freedom and protocol compliance. Several works have emerged which model failures and introduce fault-tolerance techniques. However, such works often make assumptions on the underlying network, e.g., assuming TCP-based communication where messages are guaranteed to be delivered; or adopting centralised reliable nodes and ad-hoc notions of reliability; or only addressing a single kind of failure, such as node crashes. In this work, we develop MAG$$\pi $$ π —a Multiparty, Asynchronous and Generalised $$\pi $$ π -calculus, which is the first language and type system to accommodate in unison: (i) the widest range of non-Byzantine faults, including message loss, delays and reordering; crash and link failures; and network partitioning; (ii) a novel and most general notion of reliability, taking into account the viewpoint of each participant in the protocol; (iii) a spectrum of network assumptions from the lowest UDP-based network programming to the TCP-based application level. We prove subject reduction and session fidelity; process properties (deadlock freedom, termination, etc.); failure-handling safety and reliability adherence.
APA, Harvard, Vancouver, ISO, and other styles
5

Dolev, Shlomi, Chryssis Georgiou, Ioannis Marcoullis, and Elad M. Schiller. "Self-stabilizing Byzantine Tolerant Replicated State Machine Based on Failure Detectors." In Lecture Notes in Computer Science. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94147-9_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Altmann, Bernd, Matthias Fitzi, and Ueli Maurer. "Byzantine Agreement Secure against General Adversaries in the Dual Failure Model." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48169-9_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Raynal, Michel. "Consensus Despite Byzantine Failures." In Fault-tolerant Agreement in Synchronous Message-passing Systems. Springer International Publishing, 2010. http://dx.doi.org/10.1007/978-3-031-02001-8_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Imbs, Damien, Michel Raynal, and Julien Stainer. "Are Byzantine Failures Really Different from Crash Failures?" In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-53426-7_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hamada, Yukihiro, Aohan Mei, Feng Bao, and Yoshihide Igarashi. "Broadcasting in star graphs with Byzantine failures." In Concurrency and Parallelism, Programming, Networking, and Security. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0027789.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Okun, Michael, and Amnon Barak. "Renaming in Message Passing Systems with Byzantine Failures." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11864219_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Byzantine failure"

1

Dalmas, Marcelo, Higor Rachadel, Gustavo Silvano, and Carlos Dutra. "Improving PTP robustness to the byzantine failure." In 2015 IEEE International Symposium on Precision Clock Synchronization for Measurement, Control, and Communication (ISPCS). IEEE, 2015. http://dx.doi.org/10.1109/ispcs.2015.7324693.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sota, Norihiro, and Hiroaki Higaki. "Byzantine failure detection in wireless ad-hoc networks." In 2015 36th IEEE Sarnoff Symposium. IEEE, 2015. http://dx.doi.org/10.1109/sarnof.2015.7324664.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Greve, F., M. S. de Lima, L. Arantes, and P. Sens. "A Time-Free Byzantine Failure Detector for Dynamic Networks." In 2012 Ninth European Dependable Computing Conference (EDCC). IEEE, 2012. http://dx.doi.org/10.1109/edcc.2012.28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhang, Mingyue, Zhi Jin, Jian Hou, and Renwei Luo. "Resilient Mechanism Against Byzantine Failure for Distributed Deep Reinforcement Learning." In 2022 IEEE 33rd International Symposium on Software Reliability Engineering (ISSRE). IEEE, 2022. http://dx.doi.org/10.1109/issre55969.2022.00044.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Stanev, Kamen. "THE FIFTH SLAVIC SIEGE OF THESSALONIKI." In THE PATH OF CYRIL AND METHODIUS – SPATIAL AND CULTURAL HISTORICAL DIMENSIONS. Cyrillo-Methodian Research Centre – Bulgarian Academy of Sciences, 2023. http://dx.doi.org/10.59076/2815-3855.2023.33.16.

Full text
Abstract:
The fifth Slavic siege of Thessaloniki took place in 676 – 678 and it shows that the relationship between the Slavic tribes and Byzantium, as well as between the Slavic tribes themselves, is much more complex than is traditionally presented in the historiography. The hostile actions of the slavs against the city can be divided into two periods. In the first stage participated the Rhynchines, Strymonites and Sagudates. During this period, in Thessaloniki, as Byzantine allies, there was also a Slavic squad, without specifying which tribe it was from. The fact that the Dragovites, who lived west
APA, Harvard, Vancouver, ISO, and other styles
6

de Lima, Murilo Santos, Fabiola Greve, Luciana Arantes, and Pierre Sens. "The time-free approach to Byzantine failure detection in dynamic networks." In 2011 IEEE/IFIP 41st International Conference on Dependable Systems and Networks Workshops (DSN-W). IEEE, 2011. http://dx.doi.org/10.1109/dsnw.2011.5958855.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sota, Norihiro, and Hiroaki Higaki. "Ad-Hoc routing and data transmission protocol with Byzantine failure detection and isolation." In 2015 International Conference on Advanced Technologies for Communications (ATC). IEEE, 2015. http://dx.doi.org/10.1109/atc.2015.7388322.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Rjazanovs, Dmitrijs, Ernests Petersons, Aleksandrs Ipatovs, Loreta Juskaite, and Roman Yeryomin. "Byzantine Failures and Vehicular Networks." In 2021 IEEE Microwave Theory and Techniques in Wireless Communications (MTTW). IEEE, 2021. http://dx.doi.org/10.1109/mttw53539.2021.9607266.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Guerraoui, Rachid, Florian Huc, and Anne-Marie Kermarrec. "Highly dynamic distributed computing with byzantine failures." In the 2013 ACM symposium. ACM Press, 2013. http://dx.doi.org/10.1145/2484239.2484263.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Uehara, Minoru. "Evaluations of Stateful NMR with Byzantine Failures." In 2011 International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA). IEEE, 2011. http://dx.doi.org/10.1109/bwcca.2011.48.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Byzantine failure"

1

Liang, Guanfeng, and Nitin Vaidya. Error-Free Multi-Valued Consensus with Byzantine Failures. Defense Technical Information Center, 2011. http://dx.doi.org/10.21236/ada555083.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography