Filters








207 Hits in 4.5 sec

Round Complexity of Authenticated Broadcast with a Dishonest Majority

Juan A. Garay, Jonathan Katz, Chiu-Yuen Koo, Rafail Ostrovsky
2007 Foundations of Computer Science (FOCS), IEEE Annual Symposium on  
This in particular rules out expected constant-round protocols when the fraction of honest parties is sub-constant.  ...  Recently, however, randomized protocols running in expected constant rounds have been shown for the case of t < n/2.  ...  Randomized Broadcast Protocols for Dishonest Majority As a warm-up, we first construct an expected constant-round broadcast protocol for the special case of t = n/2 (and n even) before dealing with the  ... 
doi:10.1109/focs.2007.4389534 fatcat:jlzi3xaeqveane7cmjbtxnjifu

Round Complexity of Authenticated Broadcast with a Dishonest Majority

Juan A. Garay, Jonathan Katz, Chiu-Yuen Koo, Rafail Ostrovsky
2007 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)  
This in particular rules out expected constant-round protocols when the fraction of honest parties is sub-constant.  ...  Recently, however, randomized protocols running in expected constant rounds have been shown for the case of t < n/2.  ...  Randomized Broadcast Protocols for Dishonest Majority As a warm-up, we first construct an expected constant-round broadcast protocol for the special case of t = n/2 (and n even) before dealing with the  ... 
doi:10.1109/focs.2007.44 dblp:conf/focs/KimMT07 fatcat:6tbi2gqqq5e6rpfhih66yeo4wq

On expected constant-round protocols for Byzantine agreement

Jonathan Katz, Chiu-Yuen Koo
2009 Journal of computer and system sciences (Print)  
Here, resolving a question that had been open since their work, we show an expected constant-round protocol for authenticated Byzantine agreement assuming honest majority (i.e., t < n/2), and relying only  ...  In a seminal paper, Feldman and Micali show an n-party Byzantine agreement protocol in the plain model that tolerates t < n/3 malicious parties and runs in expected constant rounds.  ...  Byzantine agreement in expected constant rounds In this section, we construct expected constant-round protocols for Byzantine agreement in both the unconditional (t < n/3) and authenticated (t < n/2) settings  ... 
doi:10.1016/j.jcss.2008.08.001 fatcat:3b3taekqkjgs3elnj2xf5fbhiu

On Expected Constant-Round Protocols for Byzantine Agreement [chapter]

Jonathan Katz, Chiu-Yuen Koo
2006 Lecture Notes in Computer Science  
Here, we show an expected constant-round protocol for authenticated Byzantine agreement assuming honest majority (i.e., t < n/2), and relying only on the existence of a secure signature scheme and a public-key  ...  In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds.  ...  Validity If the dealer is honest, then all honest parties output M . ♦ Byzantine Agreement in Expected Constant Rounds In this section, we construct expected constant-round protocols for Byzantine agreement  ... 
doi:10.1007/11818175_27 fatcat:vfi2lflcsfaw7fo34voqljgkvi

Fault-Tolerant Distributed Computing in Full-Information Networks

Shafi Goldwasser, Elan Pavlov, Vinod Vaikuntanathan
2006 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)  
For any constant > 0, there exists a BA protocol BA in a synchronous full-information network tolerating t < ( 1 3 − )n Byzantine faults, and runs for expected O( log n 2 ) rounds.  ...  Our main results are the following: • An O(log n)-round randomized Byzantine Agreement (BA) protocol in a synchronous full-information network tolerating t < n 3+ faulty players (for any constant > 0).  ...  Ultimately, [15] achieved expected constant-round randomized protocols for Byzantine agreement, by first constructing global common coins in a constant number of rounds, and then applying the round preserving  ... 
doi:10.1109/focs.2006.30 dblp:conf/focs/GoldwasserPV06 fatcat:yfdtn3nmrbdbzdwow75ylapif4

Fast and unconditionally secure anonymous channel

Juan A. Garay, Clinton Givens, Rafail Ostrovsky, Pavel Raykov
2014 Proceedings of the 2014 ACM symposium on Principles of distributed computing - PODC '14  
Our anonymous channel protocol's reduction to VSS is broadcast-round-preserving, thus making * the fewest (known to date) calls to the broadcast channel while running in an overall constant number of rounds  ...  Dining Cryptographers networks) and present a construction requiring a very low (constant) number of rounds of interaction while tolerating actively malicious behavior by some of the participants (up to  ...  Our anonymous channel protocol's reduction to VSS is broadcast-round-preserving, thus making the fewest (known to-date) calls to the broadcast channel (namely, two) while running in an overall constant  ... 
doi:10.1145/2611462.2611494 dblp:conf/podc/GarayGOR13 fatcat:zozxcmrufvacta334227uiuk5a

Efficient Synchronous Byzantine Consensus [article]

Ittai Abraham, Srinivas Devadas, Danny Dolev, Kartik Nayak, Ling Ren
2017 arXiv   pre-print
Our protocol also solves synchronous authenticated Byzantine agreement in expected 8 rounds. The best previous solution (Katz and Koo, 2006) requires expected 24 rounds.  ...  We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting.  ...  Our quorum-based approach cannot solve Byzantine broadcast in the dishonest majority case (f ≥ n/2). Related Work Byzantine agreement and broadcast.  ... 
arXiv:1704.02397v2 fatcat:f32yncnnqvftvpduoc243j3rrq

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

Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang
2021 arXiv   pre-print
., 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.  ...  More details of the expected constant round BB protocol can be found in [33] .  ... 
arXiv:2102.07240v2 fatcat:zzcvcz7s7rbsjhhfhyzq5kynf4

Secure Multi-Party Computation without Agreement

Shafi Goldwasser, Yehuda Lindell
2005 Journal of Cryptology  
It has recently been shown that authenticated Byzantine agreement, in which more than a third of the parties are corrupted, cannot be securely realized under concurrent or parallel (stateless) composition  ...  An important corollary of our result is the ability to obtain multi-party protocols that remain secure under composition, without assuming a broadcast channel. * An extended abstract of this work appeared  ...  Since there are no known (expected) constant-round protocols for authenticated Byzantine agreement, we have that the resulting protocol for secure computation is not constant-round. .  ... 
doi:10.1007/s00145-005-0319-z fatcat:i2narlrnsjahplxte6po2wo4by

Leakage-Resilient Coin Tossing [chapter]

Elette Boyle, Shafi Goldwasser, Yael Tauman Kalai
2011 Lecture Notes in Computer Science  
In the case of dishonest majority, it was shown to be impossible to achieve less than 1 r bias in O(r) rounds (Cleve STOC '86).  ...  In the case of honest majority, in contrast, unconditionally secure O(1)-round protocols for generating common perfectly unbiased coins follow from general completeness theorems on multiparty secure protocols  ...  Round 1: Each party P i broadcasts his share s i . 2.  ... 
doi:10.1007/978-3-642-24100-0_16 fatcat:tbdyurs2gbbsjcvqd6wcrsnoqy

Simple and efficient leader election in the full information model

Rafail Ostrovsky, Sridhar Rajagopalan, Umesh Vazirani
1994 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94  
That is, our protocol is resilient against any coalition of size less then N for some constant but small value of .  ...  First, we exhibit a constructive Olog N round protocol that is resilient against linear size coalitions.  ...  channel or less then 1 3 without a broadcast FM-88 of the players are dishonest.  ... 
doi:10.1145/195058.195141 dblp:conf/stoc/OstrovskyRV94 fatcat:rrx4boyulfh7vlgqp2xugpksru

Leakage-resilient coin tossing

Elette Boyle, Shafi Goldwasser, Yael Tauman Kalai
2014 Distributed computing  
In the case of dishonest majority, it was shown to be impossible to achieve less than 1 r bias in O(r) rounds (Cleve STOC '86).  ...  In the case of honest majority, in contrast, unconditionally secure O(1)-round protocols for generating common perfectly unbiased coins follow from general completeness theorems on multiparty secure protocols  ...  Round 1: Each party P i broadcasts his share s i . 2.  ... 
doi:10.1007/s00446-013-0206-z fatcat:tgcwsevzfrdvtgqtgitamlhwku

Optimal Randomized Fair Exchange with Secret Shared Coins [chapter]

Felix Freiling, Maurice Herlihy, Lucia Draque Penso
2006 Lecture Notes in Computer Science  
Both protocols have an optimal expected running time, completing in a constant (3) expected number of rounds. They also have optimal resilience.  ...  If f < n/2, for every process the expected number of rounds of ConsensusSR is 3, and the protocol terminates with probability 1.  ...  Our protocols are time optimal, completing in a constant (3) expected number of rounds. They are also optimal in terms of resilience.  ... 
doi:10.1007/11795490_7 fatcat:7reas7gaqbenhaj4wjqppx6ike

LinSBFT: Linear-Communication One-Step BFT Protocol for Public Blockchains [article]

Xiaodong Qi and Yin Yang and Zhao Zhang and Cheqing Jin and Aoying Zhou
2020 arXiv   pre-print
This paper presents LinSBFT, a Byzantine Fault Tolerance (BFT) protocol with the capacity of processing over 2000 smart contract transactions per second in production.  ...  Further, in the ordinary case, LinSBFT involves only a single round of voting instead of two in PBFT, which reduces both communication overhead and confirmation time, and employs the proof-of-stake scheme  ...  In practice, number I floats around E(I) in the vast majority of cases. Hence, the consensus for each height is terminated after constant number of rounds.  ... 
arXiv:2007.07642v1 fatcat:qrxrbda5jnagdho72nj43qhlsq

Round-Efficient Secure Computation in Point-to-Point Networks [chapter]

Jonathan Katz, Chiu-Yuen Koo
2007 Lecture Notes in Computer Science  
strict constant number of rounds.  ...  Is it possible to construct constant-round (or even sub-linear-round) protocols for secure computation that use only a single round of broadcast?  ...  in an expected constant number of rounds [12, 14, 22] .  ... 
doi:10.1007/978-3-540-72540-4_18 fatcat:lt54glncwndbrkud3vez3zdbru
« Previous Showing results 1 — 15 out of 207 results