Filters








3,118 Hits in 3.5 sec

Dynamic Byzantine Reliable Broadcast [Technical Report] [article]

Rachid Guerraoui and Jovan Komatovic and Petr Kuznetsov and Yvonne-Anne Pignolet and Dragos-Adrian Seredinschi and Andrei Tonkikh
2020 arXiv   pre-print
., Byzantine) environment. We introduce the first specification of a dynamic Byzantine reliable broadcast (DBRB) primitive that is amenable to an asynchronous implementation.  ...  The problem we tackle in this paper is that of dynamic reliable broadcast, i.e., enabling processes to join or leave the system.  ...  We have presented in this paper the specification of (dynamic Byzantine reliable broadcast), as well as an asynchronous algorithm implementing this primitive. generalizes traditional Byzantine reliable  ... 
arXiv:2001.06271v2 fatcat:qt6gkn2zvba4pb47x6562cui5a

Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures [article]

Silvia Bonomi, Giovanni Farina
2018 arXiv   pre-print
of the reliable broadcast.  ...  In this paper, we investigate the possibility of reliable broadcast in a dynamic network whose topology may evolve while the broadcast is in progress.  ...  In this paper, we investigate the possibility of reliable broadcast in a dynamic network that is subject to Byzantine faults.  ... 
arXiv:1811.01770v1 fatcat:5rw3k6sirbh7vmxygur7jlbpwm

Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures [chapter]

Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil
2018 Lecture Notes in Computer Science  
In this paper, we consider the problem of Reliable Broadcast over dynamic networks assuming a f -locally bounded Byzantine failure model from a given correct source p s .  ...  broadcast safety and we provided the necessary and sufficient conditions about the dynamic network to ensure reliable broadcast liveness.  ...  the necessary condition considering any possible Byzantine placement over the network (lines 12 − 18) as in [17] .  ... 
doi:10.1007/978-3-030-03232-6_12 fatcat:jxwvof7s5rezlplxrl3lfoo7ha

Dynamic Byzantine Reliable Broadcast

Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov, Yvonne-Anne Pignolet, Dragos-Adrian Seredinschi, Andrei Tonkikh, Quentin Bramas, Rotem Oshman, Paolo Romano
2021
., Byzantine) environment. We introduce the first specification of a dynamic Byzantine reliable broadcast (dbrb) primitive that is amenable to an asynchronous implementation.  ...  The problem we tackle in this paper is that of dynamic reliable broadcast, i.e., enabling processes to join or leave the system.  ...  Byzantine Reliable Broadcast.  ... 
doi:10.4230/lipics.opodis.2020.23 fatcat:2zrq4ipxqbhyrhwqjskkshgyma

Dynamic Byzantine Reliable Broadcast [Technical Report] [article]

Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov, Yvonne-Anne Pignolet, Dragos-Adrian Seredinschi, Andrei Tonkikh
2020
., Byzantine) environment. We introduce the first specification of a dynamic Byzantine reliable broadcast (DBRB) primitive that is amenable to an asynchronous implementation.  ...  The problem we tackle in this paper is that of dynamic reliable broadcast, i.e., enabling processes to join or leave the system.  ...  This paper presents the specification of dbrb (dynamic Byzantine reliable broadcast), as well as an asynchronous algorithm implementing this primitive. dbrb generalizes traditional Byzantine reliable broadcast  ... 
doi:10.48550/arxiv.2001.06271 fatcat:fru74cdvzrc6djufbus22hbnbe

Reliable Communication in a Dynamic Network in the Presence of Byzantine Faults [article]

Alexandre Maurer, Xavier Défago
2015 arXiv   pre-print
We consider the following problem: two nodes want to reliably communicate in a dynamic multihop network where some nodes have been compromised, and may have a totally arbitrary and unpredictable behavior  ...  Our proof is constructive, as we provide Byzantine-resilient algorithms for reliable communication that are optimal with respect to our impossibility results.  ...  Non-cryptographic reliable communication In this section, we consider that cryptography is not available. We first provide a Byzantine-resilient multihop broadcast protocol.  ... 
arXiv:1402.0121v4 fatcat:foe6nptjcbh4lmp7in5pxulsp4

A Scalable Byzantine Grid [chapter]

Alexandre Maurer, Sébastien Tixeuil
2013 Lecture Notes in Computer Science  
To be more specific, we consider the problem or reliably broadcasting information on an asynchronous grid in the presence of Byzantine failures -that is, some nodes may have an arbitrary and potentially  ...  Besides, if we assume a constant Byzantine ratio (each node has the same probability to be Byzantine), the probability to have a fatal placement approaches 1 when the number of nodes increases, and reliability  ...  the notion of a correct macro-node (see Definition 3) can be generalized to an arbitrary graph -the key idea is that, for each interface with another macro-node, we must still have a 3/4 fraction of reliable  ... 
doi:10.1007/978-3-642-35668-1_7 fatcat:vp2ikxnhwzhzhprsdemv7nquua

Multi-hop Byzantine Reliable Broadcast Made Practical

Silvia Bonomi, Giovanni Farina, Sebastien Tixeuil
2018 2018 Eighth Latin-American Symposium on Dependable Computing (LADC)  
We revisit Byzantine tolerant reliable broadcast algorithms in multihop networks.  ...  To tolerate up to f Byzantine nodes, previous solutions require a factorial number of messages to be sent over the network if the messages are not authenticated (e.g. digital signatures are not available  ...  Finally, the Bizantine Reliable Broadcast problem should be analyzed also on dynamic networks.  ... 
doi:10.1109/ladc.2018.00026 dblp:conf/ladc/BonomiFT18 fatcat:ktsdbapksjb4vghpearwzgsfgu

A Scalable Byzantine Grid [article]

Alexandre Maurer
2012 arXiv   pre-print
To be more specific, we consider the problem or reliably broadcasting information on an asynchronous grid in the presence of Byzantine failures -- that is, some nodes may have an arbitrary and potentially  ...  Besides, if we assume a constant Byzantine ratio (each node has the same probability to be Byzantine), the probability to have a fatal placement approaches 1 when the number of nodes increases, and reliability  ...  the notion of a correct macro-node (see Definition 3) can be generalized to an arbitrary graph -the key idea is that, for each interface with another macro-node, we must still have a 3/4 fraction of reliable  ... 
arXiv:1210.4640v1 fatcat:qca5pmtadbaclj5jxztg36i37a

Multi-hop Byzantine Reliable Broadcast with Honest Dealer Made Practical [article]

Silvia Bonomi, Giovanni Farina
2019 arXiv   pre-print
We revisit Byzantine tolerant reliable broadcast with honest dealer algorithms in multi-hop networks.  ...  To tolerate Byzantine faulty nodes arbitrarily spread over the network, previous solutions require a factorial number of messages to be sent over the network if the messages are not authenticated (e.g.  ...  Finally, the Bizantine Reliable Broadcast problem should be analyzed also on dynamic networks.  ... 
arXiv:1903.08988v2 fatcat:qbvik6uegremvmagfqk35pzhxq

Multi-hop Byzantine reliable broadcast with honest dealer made practical

Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil
2019 Journal of the Brazilian Computer Society  
We revisit Byzantine-tolerant reliable broadcast with honest dealer algorithms in multi-hop networks.  ...  We consider the reliable broadcast with honest dealer problem in the presence of Byzantine failures, i.e., the problem of distributing information from a source to every other process considering that  ...  Finally, the Bizantine reliable broadcast problem should be analyzed also on dynamic networks.  ... 
doi:10.1186/s13173-019-0090-x fatcat:pe736ibskrhexejq3sqwyzw52u

Parameterizable Byzantine Broadcast in Loosely Connected Networks [article]

Alexandre Maurer
2013 arXiv   pre-print
We consider the problem of reliably broadcasting information in a multihop asynchronous network, despite the presence of Byzantine failures: some nodes are malicious and behave arbitrarly.  ...  Most existing approaches give conditions for perfect reliable broadcast (all correct nodes deliver the good information), but require a highly connected network.  ...  In this paper, we study the problem of reliably broadcasting information in a network despite the presence of Byzantine failures.  ... 
arXiv:1301.3996v2 fatcat:o2w2wskkrvajpjl6f6peyqehya

Asynchronous Byzantine Reliable Broadcast With a Message Adversary [article]

Timothé Albouy
2022 arXiv   pre-print
This paper considers the problem of reliable broadcast in asynchronous authenticated systems, in which n processes communicate using signed messages and up to t processes may behave arbitrarily (Byzantine  ...  It is then shown that the condition n > 3t + 2d is necessary for implementing reliable broadcast in the presence of both Byzantine processes and a message adversary (whether the underlying system is enriched  ...  Acknowledgments This work was partially supported by the French ANR projects ByBloS (ANR-20-CE25-0002-01) and PriCLeSS (ANR-10-LABX-07-81) devoted to the modular design of building blocks for large-scale Byzantine-tolerant  ... 
arXiv:2205.09992v1 fatcat:nigxbs2nm5acdp6khvt4qsts3e

On Byzantine Broadcast in Loosely Connected Networks [chapter]

Alexandre Maurer, Sébastien Tixeuil
2012 Lecture Notes in Computer Science  
We consider the problem of reliably broadcasting information in a multihop asynchronous network that is subject to Byzantine failures.  ...  Then, we give conditions for perfect reliable broadcast in a torus network.  ...  However, no general condition on the distance between Byzantine nodes can guarantee reliable broadcast in the grid.  ... 
doi:10.1007/978-3-642-33651-5_18 fatcat:jc5qatyvkrf2higo7wd2fmy34m

Blockguard: Adaptive Blockchain Security [article]

Shishir Rai, Kendric Hood, Mikhail Nesterenko, Gokarna Sharma
2019 arXiv   pre-print
For in-committee consensus, our algorithms may use various available byzantine-robust fault tolerant algorithms (BFT). We implement synchronous BFT, asynchronous BFT and proof-of-work consensus.  ...  On the other hand, Dynamic Blockguard automatically prefers the most active and, potentially, more reliable peers.  ...  In PoW, if an honest peer mines a transaction in a defeated committee, the transaction is counted as reliable. Byzantine peer behavior affects reliable committees as well.  ... 
arXiv:1907.13232v1 fatcat:plbicnr46vcf3cfwdfjqcyc55e
« Previous Showing results 1 — 15 out of 3,118 results