English
Related papers

Related papers: YODA: Enabling computationally intensive contracts…

200 papers

Raziel combines secure multi-party computation and proof-carrying code to provide privacy, correctness and verifiability guarantees for smart contracts on blockchains. Effectively solving DAO and Gyges attacks, this paper describes an…

Cryptography and Security · Computer Science 2020-02-17 David Cerezo Sánchez

In recent years, the blockchain-based Internet of Things (IoT) has been researched and applied widely, where each IoT device can act as a node in the blockchain. However, these lightweight nodes usually do not have enough computing power to…

Cryptography and Security · Computer Science 2023-09-20 Jianxiong Guo , Weili Wu

Programmable blockchains have long been a hot research topic given their tremendous use in decentralized applications. Smart contracts, using blockchains as their underlying technology, inherit the desired properties such as verifiability,…

Cryptography and Security · Computer Science 2025-08-19 Zhaorun Lin

Numerous distributed tasks have to be handled in a setting where a fraction of nodes behaves Byzantine, that is, deviates arbitrarily from the intended protocol. Resilient, deterministic protocols rely on the detection of majorities to…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-02-10 Philipp Schneider

This paper proposes a model that enables permissionless and decentralized networks for complex computations. We explore the integration and optimize load balancing in an open, decentralized computational network. Our model leverages…

Computational Finance · Quantitative Finance 2025-01-03 German Rodikov

In this work, we propose Ocior, a practical asynchronous Byzantine fault-tolerant (BFT) consensus protocol that achieves the optimal performance in resilience, communication, computation, and round complexity. Unlike traditional BFT…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-09-11 Jinyuan Chen

Byzantine agreement enables n processes to agree on a common L-bit value, despite up to t > 0 arbitrary failures. A long line of work has been dedicated to improving the bit complexity of Byzantine agreement in synchrony. This has…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-08-21 Pierre Civit , Muhammad Ayaz Dzulfikar , Seth Gilbert , Rachid Guerraoui , Jovan Komatovic , Manuel Vidigueira , Igor Zablotchi

This paper studies the message complexity of authenticated Byzantine agreement (BA) in synchronous, fully-connected distributed networks under an honest majority. We focus on the so-called {\em implicit} Byzantine agreement problem where…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-07-13 Manish Kumar , Anisur Rahaman Molla

Multi-party data management and blockchain systems require data sharing among participants. To provide resilient and consistent data sharing, transactions engines rely on Byzantine FaultTolerant consensus (BFT), which enables operations…

Databases · Computer Science 2021-02-24 Suyash Gupta , Jelle Hellings , Sajjad Rahnama , Mohammad Sadoghi

The rapid evolution of Internet of Things (IoT) environments has created an urgent need for secure and trustworthy distributed computing systems, particularly when dealing with heterogeneous devices and applications where centralized trust…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-05-02 Murtaza Rangwala , Rajkumar Buyya

This thesis proposes techniques aiming to make blockchain technologies and smart contract platforms practical by improving their scalability, latency, and privacy. This thesis starts by presenting the design and implementation of…

Cryptography and Security · Computer Science 2021-02-25 Alberto Sonnino

Network coding achieves optimal throughput in multicast networks. However, throughput optimality \emph{relies} on the network nodes or routers to code \emph{correctly}. A Byzantine node may introduce junk packets in the network (thus…

Networking and Internet Architecture · Computer Science 2011-08-11 Raluca Ada Popa , Alessandro Chiesa , Tural Badirkhanli , Muriel Médard

We analyze the impact of transient and Byzantine faults on the construction of a maximal independent set in a general network. We adapt the self-stabilizing algorithm presented by Turau `for computing such a vertex set. Our algorithm is…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-06-11 Johanne Cohen , Laurence Pilard , François Pirot , Jonas Sénizergues

Public blockchains lack native mechanisms to attribute on-chain actions to legally accountable entities, creating a fundamental barrier to institutional adoption and regulatory compliance. This paper presents an architecture that extends…

Cryptography and Security · Computer Science 2026-01-21 Awid Vaziry , Christoph Wronka , Sandro Rodriguez Garzon , Axel Küpper

The problem of Byzantine consensus has been key to designing secure distributed systems. However, it is particularly difficult, mainly due to the presence of Byzantine processes that act arbitrarily and the unknown message delays in general…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-05 Alejandro Ranchal-Pedrosa , Vincent Gramoli

Permissionless blockchain protocols are known to consume an outrageous amount of computing power and suffer from a trade-off between latency and confidence in transaction confirmation. The recently proposed Algorand blockchain protocol…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-05-03 Kadir Korkmaz , Joachim Bruneau-Queyreix , Sonia Ben Mokthar , Laurent Réveillère

A smart contract on a blockchain cannot keep a secret because its data is replicated on all nodes in a network. To remedy this problem, it has been suggested to combine blockchains with trusted execution environments (TEEs), such as Intel…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-05-23 Marcus Brandenburger , Christian Cachin , Rüdiger Kapitza , Alessandro Sorniotti

We address the Threshold Information Disclosure (TID) problem on Ethereum: An arbitrary number of users commit to the scheduled disclosure of their individual messages recorded on the Ethereum blockchain if and only if all such messages are…

Cryptography and Security · Computer Science 2022-01-04 Oliver Stengele , Markus Raiber , Jörn Müller-Quade , Hannes Hartenstein

Decentralized smart contracts enable trustless collaboration but suffer from limited privacy and scalability, which hinders broader adoption. Trusted Execution Environment (TEE) based off-chain execution frameworks offer a promising…

Cryptography and Security · Computer Science 2025-11-07 Keyu Zhang , Andrew Martin

Securing blockchain-enabled IoT networks against sophisticated adversarial attacks remains a critical challenge. This paper presents a trust-based delegated consensus framework integrating Fully Homomorphic Encryption (FHE) with…

Cryptography and Security · Computer Science 2025-12-30 Soham Padia , Dhananjay Vaidya , Ramchandra Mangrulkar