搜索结果: 1-15 共查到“军事学 synchronous”相关记录23条 . 查询时间(0.062 秒)
Synchronous Consensus with Optimal Asynchronous Fallback Guarantees
cryptographic protocols Byzantine agreement
2019/6/13
Typically, protocols for Byzantine agreement (BA) are designed to run in either a synchronous network (where all messages are guaranteed to be delivered within some known time ΔΔ from when they are se...
Afgjort -- A Semi-Synchronous Finality Layer for Blockchains
blockchain finality Byzantine agreement
2019/5/21
Most existing blockchains either rely on a Nakamoto-style of consensus, where the chain can fork and produce rollbacks, or on a committee-based Byzantine fault tolerant (CBFT) consensus, where no roll...
Sync HotStuff: Synchronous SMR with 2∆ Latency and Optimistic Responsiveness
Distributed computing blockchains consensus protocols
2019/3/13
Synchronous solutions for building Byzantine Fault Tolerance (BFT) replication can be safe when < 1/2 of the replicas fail. Assuming ΔΔ is an upper bound on the time for messages to arrive, these solu...
Murphy, Murky, Mopey, Moody, and Morose decide to write a paper together over the Internet and submit it to the prestigious CRYPTO’19 conference that has the most amazing PC. They encounter a few prob...
Robust MPC: Asynchronous Responsiveness yet Synchronous Security
secure multiparty computation byzantine agreement synchronous
2019/2/25
Two paradigms for secure MPC are synchronous and asynchronous protocols, which differ substantially in terms of the guarantees they provide. While synchronous protocols tolerate more corruptions and a...
We describe PiLi, an extremely simple synchronous blockchain that tolerates minority corruptions. The protocol description is the extremely natural and intuitive. Informally, every epoch, an eligible ...
Classical-style BFT protocols use two or more rounds of voting to confirm each block, e.g., in PBFT, they are called the “prepare” round and the “commit” round respectively. Recently, an elegant pipel...
Synchronous Byzantine Agreement with Expected $O(1)$ Rounds, Expected $O(n^2)$ Communication, and Optimal Resilience
Optimal Resilience authenticated setting
2018/11/2
We present new protocols for Byzantine agreement in the synchronous and authenticated setting, tolerating the optimal number of ff faults among n=2f+1n=2f+1 parties. Our protocols achieve an expected ...
Combining Asynchronous and Synchronous Byzantine Agreement: The Best of Both Worlds
cryptographic protocols Byzantine agreement
2018/3/9
In the problem of byzantine agreement (BA), a set of n parties wishes to agree on a value v by jointly running a distributed protocol. The protocol is deemed secure if it achieves this goal in spite o...
A Simple Reduction from State Machine Replication to Binary Agreement in Partially Synchronous or Asynchronous Networks
SMR BA
2018/1/17
The recent advent of blockchains has spurred a huge interest in the research and development of numerous cryptocurrencies as well as understanding the fundamental concepts that underly this technology...
CP-consensus: a Blockchain Protocol Based on Synchronous Timestamps of Compass Satellite
blockchainBlockchain consensus throughput
2017/11/1
Bitcoin, the first decentralized cryptocurrency, achieves great success but also encounters many challenges. In this paper, we mainly focus on Bitcoin's five challenges: low network synchronization; p...
Round and Communication Efficient Unconditionally-secure MPC with tSynchronous Network
Verifiable Secret Sharing Partial Synchronous Multi-party computation
2017/10/16
In this work, we study unconditionally-secure multi-party computation (MPC) tolerating tcorruptions, where nn is the total number of parties involved. In this setting, it is well known that ...
Ouroboros Praos: An adaptively-secure, semi-synchronous proof-of-stake protocol
blockchain consensus proof of stake
2017/6/15
We present “Ouroboros Praos”, a new proof-of-stake blockchain protocol that provides, for the first time, a robust distributed ledger that is provably secure in the semi-synchronous adversarial settin...
Practical Synchronous Byzantine Consensus
Byzantine state machine replication Byzantine agreement
2017/4/11
We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The celebrated PBFT state machine replication protocol tolerates ...
Peer-to-peer (P2P) systems such as BitTorrent and Bitcoin are susceptible to serious attacks from byzantine nodes that join as peers. Due to well-known impossibility results for designing P2P primitiv...