Filters








2,391 Hits in 6.8 sec

Multi-valued Byzantine Broadcast: The t < n Case [chapter]

Martin Hirt, Pavel Raykov
<span title="">2014</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Multi-valued Byzantine Broadcast: The t < n Case 449 Closely related to the broadcast problem is the consensus problem.  ...  Such a broadcast of long values is called multi-valued broadcast. In this paper we study the communication complexity of multi-valued broadcast protocols.  ...  ., there is a separation between t < n/2 and t < n cases not only for broadcast protocols but between constructions for multi-valued broadcast as well.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-45608-8_24">doi:10.1007/978-3-662-45608-8_24</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/54x33ihpo5dank62piq7rr5fdq">fatcat:54x33ihpo5dank62piq7rr5fdq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190503062717/https://link.springer.com/content/pdf/10.1007%2F978-3-662-45608-8_24.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/86/09/86095e5023d624c1dd61fe715904be7a65637e2c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-45608-8_24"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Complexity of Multi-Value Byzantine Agreement [article]

Guanfeng Liang, Nitin Vaidya
<span title="2010-06-12">2010</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Our algorithm has a bit complexity of n(n-1)l/(n-t), which leads to a linear cost (O(n)) per bit agreed upon, and overcomes the quadratic lower bound (Omega(n^2)) in the literature.  ...  We have proposed a highly efficient Byzantine agreement algorithm on values of length l>1 bits.  ...  The above agreement algorithm for the nt fault-free nodes can be used to check if the nt initial values are identical: Denote v as the value agreed upon by the agreement algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1006.2422v1">arXiv:1006.2422v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fypyvnsra5fh7je7pynbgoy6ge">fatcat:fypyvnsra5fh7je7pynbgoy6ge</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1006.2422/1006.2422.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/15/7d/157dfc6ede334f8a8b3689210d72866ad9348152.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1006.2422v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Error-Free Multi-Valued Consensus with Byzantine Failures [article]

Guanfeng Liang, Nitin Vaidya
<span title="2011-01-18">2011</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Our algorithm achieves consensus on an L-bit value with communication complexity O(nL + n^4 L^0.5 + n^6) bits, in a network consisting of n processors with up to t Byzantine failures, such that t<n/3.  ...  To the best of our knowledge, we are the first to show that, for large L, error-free multi-valued Byzantine consensus on an L-bit value is achievable with O(nL) bits of communication.  ...  Introduction This paper considers the multi-valued Byzantine consensus problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1101.3520v1">arXiv:1101.3520v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/svrz2zy4sza4rf33j4t6srh7qy">fatcat:svrz2zy4sza4rf33j4t6srh7qy</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1101.3520/1101.3520.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/01/e5/01e5c7a672aac346811503ee84e76831272550fe.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1101.3520v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Error-free multi-valued consensus with byzantine failures

Guanfeng Liang, Nitin Vaidya
<span title="">2011</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/t5fzg7fyy5byfdcl2vrzbn43ty" style="color: black;">Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC &#39;11</a> </i> &nbsp;
Our algorithm achieves consensus on an L-bit value with communication complexity O(nL + n 4 L 0.5 + n 6 ) bits, in a network consisting of n processors with up to t Byzantine failures, such that t < n/  ...  The adversary can take over up to t processors (t < n/3) at any point during the algorithm. These processors are said to be faulty.  ...  We thank Martin Hirt (ETH) for his encouraging feedback on our prior related work, and for pointing us to some of the relevant literature on multi-party computation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1993806.1993809">doi:10.1145/1993806.1993809</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/podc/LiangV11.html">dblp:conf/podc/LiangV11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/keqpeej34fcctkgjzoilfksswu">fatcat:keqpeej34fcctkgjzoilfksswu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150204193745/http://www.crhc.illinois.edu/wireless/papers/guanfeng-PODC2011.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f8/51/f8519159a1fd8389d79fd8ff75449d21921c0d58.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1993806.1993809"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Short Note on Complexity of Multi-Value Byzantine Agreement [article]

Guanfeng Liang, Nitin Vaidya
<span title="2010-07-28">2010</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Randomized algorithm that achieves multi-valued Byzantine agreement with high probability, and achieves optimal complexity.  ...  After receiving the hash values from all the peers, each node i broadcasts a 1-bit notification, indicating whether all hash values are consistent with m i or not, using a traditional Byzantine agreement  ...  Now consider the case when the source node is accused by no more than t peers.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1007.4857v1">arXiv:1007.4857v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5xnim6y4nbgp5nqpkgcwk7f27i">fatcat:5xnim6y4nbgp5nqpkgcwk7f27i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171005003740/https://core.ac.uk/download/pdf/2137412.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/61/4b/614b8af19a44298bbc32be225bd6a3cb12e1ed92.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1007.4857v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

New Efficient Error-Free Multi-Valued Consensus with Byzantine Failures [article]

Guanfeng Liang, Nitin Vaidya
<span title="2011-06-09">2011</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this report, we investigate the multi-valued Byzantine consensus problem.  ...  Both algorithms are more efficient than the ones introduces in our recent PODC 2011 paper titled "Error-Free Multi-Valued Consensus with Byzantine Failures".  ...  In this report, we investigate the multi-valued Byzantine consensus problem described as follows: There are n processors, namely P 1 , ..., P n , of which at most t processors may be faulty and deviate  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1106.1846v1">arXiv:1106.1846v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/afxkv66k5ncxjkryxe3zsar62m">fatcat:afxkv66k5ncxjkryxe3zsar62m</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1106.1846/1106.1846.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1106.1846v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience [chapter]

Arpita Patra, C. Pandu Rangan
<span title="">2011</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Byzantine Agreement (BA) and Broadcast (BC) are considered to be the most fundamental primitives for fault-tolerant distributed computing and cryptographic protocols.  ...  (i.e. the communication complexity is minimal in asymptotic sense) multi-valued BA and BC protocols with the help of BA and BC protocols for short message.  ...  (log κ) 2 log n) [1] (0, 0)-ABA t < n/3 Private: O(Cn 6 log |F|) C = O(n 2 ) A-cast: O(Cn 6 log |F|) [20] ( , 0)-ABA t < n/3 Private: O(Cn 6 log κ) C = O(1) A-cast: O(Cn 6 log κ) [20] Multi-valued  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-20728-0_19">doi:10.1007/978-3-642-20728-0_19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kqx32uzurzgqdm4toe2mks7tpe">fatcat:kqx32uzurzgqdm4toe2mks7tpe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120510103848/http://eprint.iacr.org/2009/433.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/39/b2/39b29736e1806a22358429500e6774099153c655.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-20728-0_19"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Byzantine Broadcast Under a Selective Broadcast Model for Single-hop Wireless Networks [article]

Lewis Tseng, Nitin Vaidya
<span title="2015-01-31">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We provide a collection of results for a single-hop wireless network under the new model. First, we present an algorithm for Multi-Valued BB that is order-optimal in bit complexity.  ...  This paper explores an old problem, Byzantine fault-tolerant Broadcast (BB), under a new model, selective broadcast model.  ...  We assume that the input x at source p 1 is L bits long. The case when L = 1 will be referred to as Binary BB, with the case when L > 1 being referred to as Multi-Valued BB.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1502.00075v1">arXiv:1502.00075v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/r2vzsbyjt5gsrmq3svxha7eyqu">fatcat:r2vzsbyjt5gsrmq3svxha7eyqu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826154541/https://arxiv.org/pdf/1502.00075v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2e/f3/2ef35326bcc91064453d5c4af6a9326358745e20.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1502.00075v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Secure and Efficient Asynchronous Broadcast Protocols [chapter]

Christian Cachin, Klaus Kursawe, Frank Petzold, Victor Shoup
<span title="">2001</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We present a randomized atomic broadcast protocol based on a new, efficient multi-valued asynchronous Byzantine agreement primitive with an external validity condition.  ...  Apparently, no such efficient asynchronous atomic broadcast protocol maintaining liveness and safety in the Byzantine model has appeared previously in the literature.  ...  A Protocol for the Multi-valued Case We now describe Protocol VBA that implements multi-valued validated Byzantine agreement.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-44647-8_31">doi:10.1007/3-540-44647-8_31</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6tcue5nvt5er5pxwjdefgjjxai">fatcat:6tcue5nvt5er5pxwjdefgjjxai</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190504121343/https://link.springer.com/content/pdf/10.1007%2F3-540-44647-8_31.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5a/3a/5a3ac9ac8f52cd463335f0135dea96acfc090c66.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-44647-8_31"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Byzantine-Tolerant Set-Constrained Delivery Broadcast

Alex Auvolat, Michel Raynal, François Taïani, Michael Wagner
<span title="2020-02-10">2020</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cism4u4i3jhmlkqr5j6mc3jemi" style="color: black;">International Conference on Principles of Distributed Systems</a> </i> &nbsp;
Unlike the original SCD-broadcast algorithm that is tolerant to up to t < n/2 crashing processes, and unlike the underlying Byzantine reliable broadcast primitive that is tolerant to up to t < n/3 Byzantine  ...  processes, our BSCD-broadcast algorithm is tolerant to up to t < n/4 Byzantine processes.  ...  Algorithm 5 Multi-shot version of Imbs-Raynal's BR-broadcast algorithm (t < n/5, code for pi).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.opodis.2019.6">doi:10.4230/lipics.opodis.2019.6</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/opodis/AuvolatRT19.html">dblp:conf/opodis/AuvolatRT19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kvcrta7tafgo5fjavryj7miphy">fatcat:kvcrta7tafgo5fjavryj7miphy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201212155924/https://drops.dagstuhl.de/opus/volltexte/2020/11792/pdf/LIPIcs-OPODIS-2019-6.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/da/7d/da7dedf1ed1abf190546dae1b17bf6feedc9a383.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.opodis.2019.6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Secure Anonymous Broadcast [article]

Mahnush Movahedi and Jared Saia and Mahdi Zamani
<span title="2014-05-21">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The protocol tolerates up to n/6 statically-scheduled Byzantine parties that are controlled by a computationally unbounded adversary.  ...  O( n) rounds of communication.  ...  The total bit complexity of the protocol is O(n 2 t 2 ) bits in worst case, where t is the number of dishonest parties. The latency of the protocol is O(n) in worst case.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1405.5326v1">arXiv:1405.5326v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/22npksye7vaqlg72ipshrmc2eu">fatcat:22npksye7vaqlg72ipshrmc2eu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826193455/https://arxiv.org/pdf/1405.5326v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a0/09/a009c2ebc5488f4a74c3ca17cbc44ede747c703d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1405.5326v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Broadcast Amplification [chapter]

Martin Hirt, Ueli Maurer, Pavel Raykov
<span title="">2014</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
A celebrated result by Pease, Shostak and Lamport states that such a broadcast protocol exists if and only if t < n/3, where n denotes the total number of parties and t denotes the upper bound on the number  ...  ), and if the sender is correct, then v is the value sent by the sender (validity).  ...  if up to t of the parties cheat (also called Byzantine) and deviate arbitrarily from the prescribed protocol.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-54242-8_18">doi:10.1007/978-3-642-54242-8_18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ciugwvncfrfjpduxp2ch6qgxem">fatcat:ciugwvncfrfjpduxp2ch6qgxem</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190303073755/http://pdfs.semanticscholar.org/c530/2586258dc579e2f0bd4525f8d3da5e07a79d.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c5/30/c5302586258dc579e2f0bd4525f8d3da5e07a79d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-54242-8_18"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Improved Extension Protocols for Byzantine Broadcast and Agreement [article]

Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, Zhuolun Xiang
<span title="2020-10-05">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
reliable broadcast and BA with t<n/3.  ...  We present new protocols with improved communication complexity in almost all settings: authenticated BA/BB with t<n/2, authenticated BB with t<(1-ϵ)n, unauthenticated BA/BB with t<n/3, and asynchronous  ...  Now we present an improved extension protocol for errorfree multi-valued synchronous Byzantine agreement when t < n/3, as presented in Figure 8 .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2002.11321v3">arXiv:2002.11321v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hln2vpokn5h7bahv5bdsji2ep4">fatcat:hln2vpokn5h7bahv5bdsji2ep4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200812225647/https://arxiv.org/pdf/2002.11321v2.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2002.11321v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Improved Extension Protocols for Byzantine Broadcast and Agreement

Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, Zhuolun Xiang, Hagit Attiya
<span title="2020-10-07">2020</span> <i title="Schloss Dagstuhl - Leibniz-Zentrum für Informatik"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2pcluxp32rfojgwekdrryxoaqu" style="color: black;">International Symposium on Distributed Computing</a> </i> &nbsp;
reliable broadcast and BA with t < n/3.  ...  We present new protocols with improved communication complexity in almost all settings: authenticated BA/BB with t < n/2, authenticated BB with t < (1-ε)n, unauthenticated BA/BB with t < n/3, and asynchronous  ...  No extension protocol has been proposed for this case to the best of our knowledge. As before, let t denote the maximum number of Byzantine parties, and let b = nt.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.disc.2020.28">doi:10.4230/lipics.disc.2020.28</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/wdag/Nayak0SVX20.html">dblp:conf/wdag/Nayak0SVX20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7y5chntspfbkpfmvygtq2zecqa">fatcat:7y5chntspfbkpfmvygtq2zecqa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201212154844/https://drops.dagstuhl.de/opus/volltexte/2020/13106/pdf/LIPIcs-DISC-2020-28.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/41/e2/41e223474471939a1d0efa75698e93dd007220c2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.disc.2020.28"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Multi-hop Byzantine Reliable Broadcast Made Practical

Silvia Bonomi, Giovanni Farina, Sebastien Tixeuil
<span title="">2018</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cuxyw5lz7bfjlhk4czk3m4wciq" style="color: black;">2018 Eighth Latin-American Symposium on Dependable Computing (LADC)</a> </i> &nbsp;
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  ...  This value depends on the graph topology. In the worst case, the wide diameter of a graph is n´k`1 [13] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ladc.2018.00026">doi:10.1109/ladc.2018.00026</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ladc/BonomiFT18.html">dblp:conf/ladc/BonomiFT18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ktsdbapksjb4vghpearwzgsfgu">fatcat:ktsdbapksjb4vghpearwzgsfgu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200305081317/https://hal.archives-ouvertes.fr/hal-01826865v2/document" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/19/06/190665fb33c866de74af8b882be4e99485cc52ce.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ladc.2018.00026"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 2,391 results