English
Related papers

Related papers: Be Prepared When Network Goes Bad: An Asynchronous…

200 papers

We present HotStuff, a leader-based Byzantine fault-tolerant replication protocol for the partially synchronous model. Once network communication becomes synchronous, HotStuff enables a correct leader to drive the protocol to consensus at…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-07-24 Maofan Yin , Dahlia Malkhi , Michael K. Reiter , Guy Golan Gueta , Ittai Abraham

Blockchain is becoming a new generation of information infrastructures. However, the current blockchain solutions rely on a continuous connectivity network to query and modify the state of the blockchain. The emerging satellite technology…

Cryptography and Security · Computer Science 2022-04-06 Yijing Lin , Zhipeng Gao , Qian Wang , Lanlan Rui , Yang Yang

Byzantine fault-tolerant agreement (BFT) in a partially synchronous system usually requires 3f + 1 nodes to tolerate f faulty replicas. Due to their high throughput and finality property BFT algorithms build the core of recent permissioned…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-26 Ines Messadi , Markus Horst Becker , Kai Bleeke , Leander Jehl , Sonia Ben Mokhtar , Rüdiger Kapitza

Blockchain technology enables the execution of collaborative business processes involving untrusted parties without requiring a central authority. Specifically, a process model comprising tasks performed by multiple parties can be…

Software Engineering · Computer Science 2016-12-12 Luciano García-Bañuelos , Alexander Ponomarev , Marlon Dumas , Ingo Weber

Traditional blockchain design gives miners or validators full control over transaction ordering, i.e., they can freely choose which transactions to include or exclude, as well as in which order. While not an issue initially, the emergence…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-12-19 Andrei Constantinescu , Diana Ghinea , Lioba Heimbach , Zilin Wang , Roger Wattenhofer

SURFACE, standing for Secure, Use-case adaptive, and Relatively Fork-free Approach of Chain Extension, is a consensus algorithm that is designed for real-world networks and enjoys the benefits from both the Nakamoto consensus and Byzantine…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-08-17 Zhijie Ren , Ziheng Zhou

We present the notion of multilevel slashing, where proof-of-stake blockchain validators can obtain gradual levels of assurance that a certain block is bound to be finalized in a global consensus procedure, unless an increasing and…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-30 Kenan Wood , Hammurabi Mendes , Jonad Pulaj

We consider the problem of perfect (information-theoretically) secure message transmission (PSMT) from a sender $S$ to a receiver $R$ in asynchronous directed networks tolerating dual adversary. The adversary can control at most $t_p$ nodes…

Cryptography and Security · Computer Science 2019-01-11 Anupriya Inumella

Blockchain is a decentralized system that allows transaction transmission and storage according to the roles of the Consensus algorithm and Smart contracts. Non-fungible tokens (NFTs) consolidate the best characteristics of blockchain…

Cryptography and Security · Computer Science 2022-09-07 Subhash Shankar Pandey , Tadasha Dash , Prasanta K. Panigrahi , Ahmed Farouk

In service exchange platforms, anonymous users exchange services with each other: clients request services and are matched to servers who provide services. Because providing good-quality services requires effort, in any single interaction a…

Computer Science and Game Theory · Computer Science 2013-10-10 Yuanzhang Xiao , Mihaela van der Schaar

Autonomous control systems use various sensors to decrease the amount of uncertainty under which they operate. While providing partial observation of the current state of the system, sensors require resources such as energy, time and…

Logic in Computer Science · Computer Science 2016-02-29 Eva Tesarova , Maria Svorenova , Jiri Barnat , Ivana Cerna

We present a general consensus framework that allows to easily introduce a customizable Byzantine fault tolerant consensus algorithm to an existing (Delegated) Proof-of-Stake blockchain. We prove the safety of the protocol under the…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-05-06 Jan Hackfeld

What are the optimal times for an Internet of Things (IoT) device to act as a blockchain miner? The aim is to minimize the energy consumed by low-power IoT devices that log their data into a secure (tamper-proof) distributed ledger. We…

Cryptography and Security · Computer Science 2023-08-21 Anurag Gupta , Vikram Krishnamurthy

There has been recently a lot of progress in designing efficient partially synchronous BFT consensus protocols that are meant to serve as core consensus engines for Proof of Stake blockchain systems. While the state-of-the-art solutions…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-19 Daniel Kane , Andreas Fackler , Adam Gągol , Damian Straszak

Synchronous Flooding (SF) protocols can enhance the wireless connectivity between Internet of Things (IoT) devices. However, existing SF solutions fail to introduce sufficient security measures due to strict time synchronisation…

Networking and Internet Architecture · Computer Science 2023-03-07 Charles Lockie , Ioannis Mavromatis , Aleksandar Stanoev , Yichao Jin , George Oikonomou

Building Management Systems (BMSs) have evolved in recent years, in ways that require changes to existing network architectures that follow the store-then-analyse approach. The primary cause is the increasing deployment of a diverse range…

Networking and Internet Architecture · Computer Science 2021-03-17 Rohit Verma , Justas Brazauskas , Vadim Safronov , Matthew Danish , Jorge Merino , Xiang Xie , Ian Lewis , Richard Mortier

Byzantine Fault-Tolerant (BFT) protocols have been proposed to tolerate malicious behaviors in state machine replications. With classic BFT protocols, the total number of replicas is known and fixed a priori. The resilience of BFT…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-06-12 Jiangshan Yu

Opportunistic scheduling and beamforming schemes are proposed for multiuser MIMO-SDMA downlink systems with linear combining in this work. Signals received from all antennas of each mobile terminal (MT) are linearly combined to improve the…

Information Theory · Computer Science 2016-11-18 Man-On Pun , Visa Koivunen , H. Vincent Poor

Byzantine Fault Tolerance (BFT) enables correct operation of distributed, i.e., replicated applications in the face of malicious take-over and faulty/buggy individual instances. Recently, BFT designs have gained traction in the context of…

Networking and Internet Architecture · Computer Science 2019-08-15 Ermin Sakic , Nemanja Deric , Endri Goshi , Wolfgang Kellerer

In this work, we present IBFT 2.0 (Istanbul BFT 2.0), which is a Proof-of-Authority (PoA) Byzantine-fault-tolerant (BFT) blockchain consensus protocols that (i) ensures immediate finality, (ii) is robust in an eventually synchronous network…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-09-24 Roberto Saltini , David Hyland-Wood
‹ Prev 1 8 9 10 Next ›