English
Related papers

Related papers: The Latency Price of Threshold Cryptosystem in Blo…

200 papers

Consensus in decentralized systems that asynchronously receive events and which are subject to Byzantine faults is a common problem with many real-life applications. Advances in decentralized systems, such as distributed ledger (i.e.,…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-09-05 Fedor Muratov , Andrei Lebedev , Nikolai Iushkevich , Bulat Nasrulin , Makoto Takemiya

Recently, the blockchain technique was put in the spotlight as it introduced a systematic approach for multiple parties to reach consensus without needing trust. However, the application of this technique in practice is severely restricted…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-07-17 Zhijie Ren , Kelong Cong , Johan Pouwelse , Zekeriya Erkin

This paper introduces a new way to incorporate verifiable secret sharing (VSS) schemes into Byzantine Fault Tolerance (BFT) protocols. This technique extends the threshold guarantee of classical Byzantine Fault Tolerant algorithms to…

Cryptography and Security · Computer Science 2018-12-27 Soumya Basu , Alin Tomescu , Ittai Abraham , Dahlia Malkhi , Michael K. Reiter , Emin Gün Sirer

Despite broad use of BFT consensus in blockchains, censorship resistance is weak: leaders can exclude transactions, a growing concern for trading and DeFi. We address this by introducing a new abstraction and protocol stack. First, we…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-04 Zhuolun Xiang , Andrei Tonkikh , Alexander Spiegelman

We present TRAIL: an algorithm that uses a novel consensus procedure to tolerate failed or malicious shards within a blockchain-based cryptocurrency. Our algorithm takes a new approach of selecting validator shards for each transaction from…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-14 Mitch Jacovetty , Joseph Oglio , Mikhail Nesterenko , Gokarna Sharma

Blockchains use peer-to-peer networks for disseminating information among peers, but these networks currently do not have any provable guarantees for desirable properties such as Byzantine fault tolerance, good connectivity and small…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-02-01 Vijeth Aradhya , Seth Gilbert , Aquinas Hobor

Distributed Ledger Technologies (DLTs), when managed by a few trusted validators, require most but not all of the machinery available in public DLTs. In this work, we explore one possible way to profit from this state of affairs. We devise…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-10 Marco Benedetti , Francesco De Sclavis , Marco Favorito , Giuseppe Galano , Sara Giammusso , Antonio Muci , Matteo Nardelli

Blockchain technology enables stakeholders to conduct trusted data sharing and exchange without a trusted centralized institution. These features make blockchain applications attractive to enhance trustworthiness in very different contexts.…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-07-18 Xiaohui Zhang , Mingying Xue , Xianghua Miao

The growing interest in reliable multi-party applications has fostered widespread adoption of Byzantine Fault-Tolerant (BFT) consensus protocols. Existing BFT protocols need f more replicas than Paxos-style protocols to prevent equivocation…

Databases · Computer Science 2022-11-03 Suyash Gupta , Sajjad Rahnama , Shubham Pandey , Natacha Crooks , Mohammad Sadoghi

There is a resurgence of interest in Byzantine fault-tolerant (BFT) systems due to blockchains. However, leader-based BFT consensus protocols used by permissioned blockchains have limited scalability and robustness. To alleviate the leader…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-27 Fangyu Gai , Jianyu Niu , Ivan Beschastnikh , Chen Feng , Sheng Wang

Byzantine consensus is a critical component in many permissioned Blockchains and distributed ledgers. We propose a new paradigm for designing BFT protocols called DQBFT that addresses three major performance and scalability challenges that…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-03-01 Balaji Arun , Binoy Ravindran

Existing blockchain systems scale poorly because of their distributed consensus protocols. Current attempts at improving blockchain scalability are limited to cryptocurrency. Scaling blockchain systems under general workloads (i.e.,…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-03-13 Hung Dang , Tien Tuan Anh Dinh , Dumitrel Loghin , Ee-Chien Chang , Qian Lin , Beng Chin Ooi

Permissioned blockchains employ Byzantine fault-tolerant (BFT) state machine replication (SMR) to reach agreement on an ever-growing, linearly ordered log of transactions. A new paradigm, combined with decades of research in BFT SMR and…

Cryptography and Security · Computer Science 2021-03-02 Fangyu Gai , Ali Farahbakhsh , Jianyu Niu , Chen Feng , Ivan Beschastnikh , Hao Duan

Blockchain protocols typically aspire to run in the permissionless setting, in which nodes are owned and operated by a large number of diverse and unknown entities, with each node free to start or stop running the protocol at any time. This…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-03-05 Andrew Lewis-Pye , Tim Roughgarden

Byzantine fault tolerant (BFT) state machine replication (SMR) is an important building block for constructing permissioned blockchain systems. In contrast to Nakamoto Consensus where any block obtains higher assurance as buried deeper in…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-12 Zhuolun Xiang , Dahlia Malkhi , Kartik Nayak , Ling Ren

The performance of partially synchronous BFT-based consensus protocols is highly dependent on the primary node. All participant nodes in the network are blocked until they receive a proposal from the primary node to begin the consensus…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-02 Mohammad M. Jalalzai , Chen Feng , Costas Busch , Golden G. Richard , Jianyu Niu

Lower bounds and impossibility results in distributed computing are both intellectually challenging and practically important. Hundreds if not thousands of proofs appear in the literature, but surprisingly, the vast majority of them apply…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-10-13 Guy Goren , Yoram Moses , Alexander Spiegelman

Large Language Models (LLMs) have achieved remarkable success across a wide range of applications. However, individual LLMs often produce inconsistent, biased, or hallucinated outputs due to limitations in their training corpora and model…

Cryptography and Security · Computer Science 2025-05-09 Haoxiang Luo , Gang Sun , Yinqiu Liu , Dongcheng Zhao , Dusit Niyato , Hongfang Yu , Schahram Dustdar

Asynchronous Byzantine Fault Tolerant (BFT) consensus protocols have garnered significant attention with the rise of blockchain technology. A typical asynchronous protocol is designed by executing sequential instances of the Asynchronous…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-18 Xiaohai Dai , Chaozheng Ding , Wei Li , Jiang Xiao , Bolin Zhang , Chen Yu , Albert Y. Zomaya , Hai Jin

Currently there exist many blockchains with weak trust guarantees, limiting applications and participation. Existing solutions to boost the trust using a stronger blockchain, e.g., via checkpointing, requires the weaker blockchain to give…

Cryptography and Security · Computer Science 2023-09-22 Peiyao Sheng , Xuechao Wang , Sreeram Kannan , Kartik Nayak , Pramod Viswanath