Filters








2,397 Hits in 3.5 sec

Byzantine Agreement Given Partial Broadcast

Jeffrey Considine, Matthias Fitzi, Matthew Franklin, Leonid A. Levin, Ueli Maurer, David Metcalf
<span title="2005-05-20">2005</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7jmi32x7o5hfnpkgh2irnuqpim" style="color: black;">Journal of Cryptology</a> </i> &nbsp;
We show that, by extending this model by the existence of partial broadcast channels among subsets of b players, global broadcast can be achieved if and only if the number h of honest players satisfies  ...  This paper considers unconditionally secure protocols for reliable broadcast among a set of n players, where up to t of the players can be corrupted by a (Byzantine) adversary but the remaining h = n −  ...  There are two main variations of Byzantine agreement, broadcast and consensus.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00145-005-0308-x">doi:10.1007/s00145-005-0308-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sl467o7udzclhkt4qngn2r4gsi">fatcat:sl467o7udzclhkt4qngn2r4gsi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190329194709/https://core.ac.uk/download/pdf/159147995.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/8e/e4/8ee47a93b73604f50819b99f25f93b526e1ca227.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00145-005-0308-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Secure Computation without Agreement [chapter]

Shafi Goldwasser, Yehuda Lindell
<span title="">2002</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).  ...  Such protocols strongly rely on the extensive use of a broadcast channel, which is in turn realized using authenticated Byzantine Agreement.  ...  In particular, all the feasibility results above assume a broadcast channel (and implement it using Byzantine agreement or authenticated Byzantine agreement).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-36108-1_2">doi:10.1007/3-540-36108-1_2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gdsqn5o3w5eipcb5oo4szcly2q">fatcat:gdsqn5o3w5eipcb5oo4szcly2q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181105104237/http://groups.csail.mit.edu:80/cis/pubs/shafi/2002-disc.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/54/32/5432a4eae229c4304dd20645e4491286b05295e8.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-36108-1_2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Byzantine agreement with homonyms

Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The
<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;
In this paper, we ask how many identifiers are actually needed to reach agreement in a distributed system with t Byzantine processes.  ...  We show that removing this ability makes agreement easier: then, t + 1 identifiers are sufficient for agreement, even in the partially synchronous model.  ...  Theorem 13 Partially synchronous Byzantine agreement is solvable if and only if > n+3t 2 .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1993806.1993810">doi:10.1145/1993806.1993810</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/podc/Delporte-GalletFGKRT11.html">dblp:conf/podc/Delporte-GalletFGKRT11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cneitujhavcifhplnq6h4ymvsu">fatcat:cneitujhavcifhplnq6h4ymvsu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829205714/https://infoscience.epfl.ch/record/208944/files/byz_agr_with_homo_p21-delporte-gallet.pdf?version=1" 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/89/e0/89e03249c2e8e0bc1948f27758da2fd139c7e950.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1993806.1993810"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Byzantine agreement with homonyms

Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The
<span title="2013-05-26">2013</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/c5flcyc6ozdv3p2dehbhbc7pqy" style="color: black;">Distributed computing</a> </i> &nbsp;
In this paper, we ask how many identifiers are actually needed to reach agreement in a distributed system with t Byzantine processes.  ...  We show that removing this ability makes agreement easier: then, t + 1 identifiers are sufficient for agreement, even in the partially synchronous model.  ...  Theorem 13 Partially synchronous Byzantine agreement is solvable if and only if > n+3t 2 .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00446-013-0190-3">doi:10.1007/s00446-013-0190-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bodvget4cfeexagynedcti4x4q">fatcat:bodvget4cfeexagynedcti4x4q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829205714/https://infoscience.epfl.ch/record/208944/files/byz_agr_with_homo_p21-delporte-gallet.pdf?version=1" 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/89/e0/89e03249c2e8e0bc1948f27758da2fd139c7e950.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00446-013-0190-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Secure Multi-Party Computation without Agreement

Shafi Goldwasser, Yehuda Lindell
<span title="2005-05-20">2005</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7jmi32x7o5hfnpkgh2irnuqpim" style="color: black;">Journal of Cryptology</a> </i> &nbsp;
for running authenticated Byzantine agreement).  ...  This is because these protocols strongly rely on the extensive use of a broadcast channel, which is in turn realized using authenticated Byzantine agreement.  ...  authenticated Byzantine agreement.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00145-005-0319-z">doi:10.1007/s00145-005-0319-z</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/i2narlrnsjahplxte6po2wo4by">fatcat:i2narlrnsjahplxte6po2wo4by</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070417163751/http://eprint.iacr.org/2002/040.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/24/84/2484330f40e318036d81c63974b5c28fe9c31f99.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00145-005-0319-z"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

On the price of equivocation in byzantine agreement

Alexander Jaffe, Thomas Moscibroda, Siddhartha Sen
<span title="">2012</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/t5fzg7fyy5byfdcl2vrzbn43ty" style="color: black;">Proceedings of the 2012 ACM symposium on Principles of distributed computing - PODC &#39;12</a> </i> &nbsp;
Algorithmically, we show that deciding whether a given set of broadcast channels enables Byzantine agreement is co-NPcomplete.  ...  partial broadcast channels.  ...  Our tight bounds on the number of 3-processor partial broadcast channels required for Byzantine agreement describe the amount of equivocation a system can tolerate for a given level of redundancy.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2332432.2332491">doi:10.1145/2332432.2332491</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/podc/JaffeMS12.html">dblp:conf/podc/JaffeMS12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/enj3lcrh6nfhjh3qsunk6w5wu4">fatcat:enj3lcrh6nfhjh3qsunk6w5wu4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808204759/http://sns.cs.princeton.edu/docs/hypergraph-podc12.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/1c/ce/1cce2c5fc07b990e57cf8bad04da1d14bc150c06.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2332432.2332491"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Brief Announcement: Towards Byzantine Broadcast in Generalized Communication and Adversarial Models

Chen-Da Liu-Zhang, Varun Maram, Ueli Maurer, Michael Wagner
<span title="2019-10-11">2019</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2pcluxp32rfojgwekdrryxoaqu" style="color: black;">International Symposium on Distributed Computing</a> </i> &nbsp;
Byzantine broadcast is a primitive which allows a specific party to distribute a message consistently among n parties, even if up to t parties exhibit malicious behaviour.  ...  technique -used to achieve broadcast in general 3-minicast networks [7] -with regard to higher b-minicast networks, and 3) providing some necessary conditions on general networks for broadcast to be possible  ...  We remark that -as noted in [1] -when b > 3, perfectly secure broadcast can be realized even when there is no honest majority, in contrast to Byzantine agreement. 47:2 Towards Byzantine Broadcast in  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.disc.2019.47">doi:10.4230/lipics.disc.2019.47</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/wdag/ZhangMM19.html">dblp:conf/wdag/ZhangMM19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/q2embvfx6ja3xg5cnfwbpja4na">fatcat:q2embvfx6ja3xg5cnfwbpja4na</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220307212131/https://drops.dagstuhl.de/opus/volltexte/2019/11354/pdf/LIPIcs-DISC-2019-47.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/48/bd/48bd5b8f368f8f763949436b9a2466d3ad5c1131.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.2019.47"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Fast Asynchronous Consensus with Optimal Resilience [chapter]

Ittai Abraham, Marcos K. Aguilera, Dahlia Malkhi
<span title="">2010</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;
For Byzantine failures, we solve weak Byzantine agreement assuming a public-key infrastructure and a broadcast primitive called weak sequenced broadcast.  ...  Algorithm for securely implementing verifiable secret sharing and n ≥ 2f +1 using sequenced broadcast in a system with Byzantine failures.  ...  Using sequenced broadcast, we show how to implement probabilistic agreement with Byzantine failures, and then how to implement weak Byzantine agreement.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-15763-9_3">doi:10.1007/978-3-642-15763-9_3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/376hdxtoy5eerkbvllzqfapqi4">fatcat:376hdxtoy5eerkbvllzqfapqi4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120714034855/http://research.microsoft.com/en-us/people/aguilera/fast-consensus-disc2010.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/e3/3c/e33c5df39322128d9cfedfeace09ad5ddfde8b21.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-15763-9_3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Good-case Latency of Byzantine Broadcast: A Complete Categorization [article]

Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang
<span title="2022-03-10">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
., 2-round PBFT-style partially synchronous Byzantine broadcast is possible if and only if n≥ 5f-1, and a tight bound for good-case latency under n/3<f<n/2 under synchrony is not an integer multiple of  ...  This paper explores the problem good-case latency of Byzantine fault-tolerant broadcast, motivated by the real-world latency and performance of practical state machine replication protocols.  ...  We would like to thank Andrei Tonkikh for pointing out a subtle issue in the good-case latency definition under partial synchrony.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2102.07240v3">arXiv:2102.07240v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sbgcij7asnaavkf6r2xsjksg3a">fatcat:sbgcij7asnaavkf6r2xsjksg3a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220315003029/https://arxiv.org/pdf/2102.07240v3.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/b6/55/b655f07ef3f59282bda0448a02df76c04c39f955.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2102.07240v3" 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>

Byzantine Agreement with a Rational Adversary [chapter]

Adam Groce, Jonathan Katz, Aishwarya Thiruvengadam, Vassilis Zikas
<span title="">2012</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;
Here we apply this model for the first time to the problem of Byzantine agreement (BA) and the closely related problem of broadcast, for natural classes of utilities.  ...  We show that perfectly secure BA is possible for t < n corruptions given complete knowledge of the adversary's preferences, and characterize when statistical security is possible with only partial knowledge  ...  Byzantine Agreement We briefly review the traditional definitions of broadcast and consensus.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-31585-5_50">doi:10.1007/978-3-642-31585-5_50</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xxd5hrnqjfci3ijgkew7zq7aae">fatcat:xxd5hrnqjfci3ijgkew7zq7aae</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130421032959/http://www.cs.umd.edu/~agroce/ICALP2012.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/f4/07/f407af624b127af27e00e9321dbb4c0f31ed4a78.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-31585-5_50"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

No Need for Recovery: A Simple Two-Step Byzantine Consensus [article]

Tung-Wei Kuo, Kung Chen
<span title="2019-11-23">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper, we give a deterministic two-step Byzantine consensus protocol that achieves safety and liveness.  ...  A two-step Byzantine consensus protocol only needs two communication steps to commit in the absence of faults.  ...  Several two-step consensus algorithms have been proposed to solve the Byzantine agreement problem [4] [5] [6] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1911.10361v1">arXiv:1911.10361v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uwrpjl4arbe3digisy55g62t6y">fatcat:uwrpjl4arbe3digisy55g62t6y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200914180749/https://arxiv.org/pdf/1911.10361v1.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/c9/82/c982247836e322680275aab6a0568f8f45b2bf22.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1911.10361v1" 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>

TRAP: The Bait of Rational Players to Solve Byzantine Consensus [article]

Alejandro Ranchal-Pedrosa, Vincent Gramoli
<span title="2022-03-07">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
It is impossible to solve the Byzantine consensus problem in an open network of n participants if only 2n/3 or less of them are correct.  ...  First, we show that it is impossible to solve this rational agreement problem without implementing a baiting strategy.  ...  the Byzantine consensus problem [32] in the presence of rational players: The Byzantine consensus problem is, given n players, each with an initial value, to ensure (i) agreement in that no two non-deviating  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2105.04357v2">arXiv:2105.04357v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/i3tjtictgjauhbmhuhkoeg5mk4">fatcat:i3tjtictgjauhbmhuhkoeg5mk4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220309092357/https://arxiv.org/pdf/2105.04357v2.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/d9/0b/d90b1804fc83609e96d1f98beb6deb264cbe21c8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2105.04357v2" 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>

Payment Does Not Imply Consensus (For Distributed Payment Systems) [article]

Thomas Orton
<span title="2021-05-25">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In Theorem 1, we show that even though there exists a single step black box reduction from Payment Systems to Byzantine Broadcast, there does not exist any black box reduction in the other direction which  ...  We then show a relation between the construction in Theorem 2 and the Lightning Network, relating the formal model constructions we have given to a practical algorithm proposed by the cryptocurrency community  ...  We note that since Byzantine Broadcast is reducible to Byzantine Agreement (proposition 3.2.2), the analogous statements hold for Byzantine Agreement as well. We prove this theorem in two parts.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2105.11821v1">arXiv:2105.11821v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fdx2cme5bfezfexa37s6j66gc4">fatcat:fdx2cme5bfezfexa37s6j66gc4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210530150500/https://arxiv.org/pdf/2105.11821v1.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/8e/40/8e40720c8a4a42c78011762e645976d917ad230a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2105.11821v1" 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>

Homonyms with Forgeable Identifiers [chapter]

Carole Delporte-Gallet, Hugues Fauconnier, Hung Tran-The
<span title="">2012</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;
Assuming that at most t processes may be Byzantine and at most k (t ≤ k ≤ l) of these identifiers are forgeable in the sense that any Byzantine process can falsely use them, we prove that Byzantine Agreement  ...  We consider here the Byzantine Agreement problem (BA) in synchronous systems with homonyms in the case where some identifiers may be forgeable.  ...  Hence adding correct processes does not help to solve Byzantine Agreement. A natural extension of this work could be to consider partially synchronous models.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-31104-8_15">doi:10.1007/978-3-642-31104-8_15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xwnffn2ddbg4fff3p7bxnypgjy">fatcat:xwnffn2ddbg4fff3p7bxnypgjy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170928233458/https://hal.archives-ouvertes.fr/hal-00687836/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/ad/09/ad09f88d85122affa60416cacec937ec632a1ce9.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-31104-8_15"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Byzantine agreement in the full-information model in O(log n) rounds

Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
<span title="">2006</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jlc5kugafjg4dl7ozagimqfcbm" style="color: black;">Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC &#39;06</a> </i> &nbsp;
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players.  ...  For any constant > 0, the constructed protocol tolerates t non-adaptive Byzantine faults, as long as n ≥ (4 + )t.  ...  Reaching Byzantine Agreement Given a Common Coin We briefly describe how to get Byzantine Agreement given a common coin protocol, for the sake of completeness.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1132516.1132543">doi:10.1145/1132516.1132543</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/stoc/Ben-OrPV06.html">dblp:conf/stoc/Ben-OrPV06</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2ur5zh66zvaqljkvbvnguegh4q">fatcat:2ur5zh66zvaqljkvbvnguegh4q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060818232829/http://www.mit.edu:80/~vinodv/papers/fp65-ben-or.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/ab/54/ab54176ae15509d7b11235f2db17fc96134e8ccb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1132516.1132543"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 2,397 results