Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Smart contract

Related publications (18)

Towards General-Purpose Decentralized Computing with Permissionless Extensibility

Enis Ceyhun Alp

Smart contracts have emerged as the most promising foundations for applications of the blockchain technology. Even though smart contracts are expected to serve as the backbone of the next-generation web, they have several limitations that hinder their wide ...

EPFL2024

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

Rachid Guerraoui, Vincent Gramoli, Seth Gilbert, Jovan Komatovic, Manuel José Ribeiro Vidigueira, Pierre Philippe Civit

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic (in the number of processes) communication complexity in the worst case: given a system with n processes and at most f < n/3 failures, any solution t ...

2023

Chat2Code: A Chatbot for Model Specification and Code Generation, The Case of Smart Contracts

Shailesh Mishra

The potential of automatic code generation through Model-Driven Engineering (MDE) frameworks has yet to be realized. Beyond their ability to help software professionals write more accurate, reusable code, MDE frameworks could make programming accessible fo ...

Ieee Computer Soc2023

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony!

Rachid Guerraoui, Vincent Gramoli, Seth Gilbert, Jovan Komatovic, Manuel José Ribeiro Vidigueira, Pierre Philippe Civit

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic communication complexity in the worst case. While it has been shown that the bound is tight in synchronous environments, it is still unknown whether ...

Dagstuhl Publishing2022

CALYPSO: Private Data Management for Decentralized Ledgers

Bryan Alexander Ford, Philipp Svetolik Jovanovic, Linus Gasser, Eleftherios Kokoris Kogias, Enis Ceyhun Alp

Distributed ledgers provide high availability and integrity, making them a key enabler for practical and secure computation of distributed workloads among mutually distrustful parties. Many practical applications also require strong confidentiality, howeve ...

2021

Smart Contract With Secret Parameters

Serge Vaudenay

By design, smart contracts' data and computations are public to all participants. In this paper, we study how to create smart contracts with parameters that need to stay secret. We propose a way to keep some of the parameters off-chain, while guaranteeing ...

2020

The Performance of Byzantine Fault Tolerant Blockchains

Vincent Gramoli

Blockchains have captured the attention of many, resulting in an abundance of new systems available for use. However, selecting an appropriate blockchain for an application is challenging due to the lack of comparative information discussing core metrics s ...

IEEE2020

Cooperative energy management of a community of smart-buildings: A Blockchain approach

Maher Kayal, Olivier Valentin Henri Van Cutsem

Demand Response (DR) is progressively moving from a centralized, unidirectional structure to a set of advanced decentralized mechanisms that better balance distributed supply and demand. This paper presents a decentralized cooperative DR framework to manag ...

ELSEVIER SCI LTD2020

Replicated state machines without replicated execution

Kirill Nikitin

This paper introduces a new approach to reduce end-to-end costs in large-scale replicated systems built under a Byzantine fault model. Specifically, our approach transforms a given replicated state machine (RSM) to another RSM where nodes incur lower costs ...

IEEE2020

Malware in the SGX supply chain: Be careful when signing enclaves!

Rafael Pereira Pires

Malware attacks are a significant part of the new software security threats detected each year. Intel Software Guard Extensions (SGX) are a set of hardware instructions introduced by Intel in their recent lines of processors that are intended to provide a ...

2022

Rethinking General-Purpose Decentralized Computing

Bryan Alexander Ford, Eleftherios Kokoris Kogias, Georgia Fragkouli, Enis Ceyhun Alp

While showing great promise, smart contracts are difficult to program correctly, as they need a deep understanding of cryptography and distributed algorithms, and offer limited functionality, as they have to be deterministic and cannot operate on secret da ...

Association for Computing Machinery2019

MedChain: Accountable and Auditable Data Sharing in Distributed Medical Scenarios

Jean-Pierre Hubaux, Bryan Alexander Ford, Juan Ramón Troncoso-Pastoriza, Jean Louis Raisaro, Linus Gasser

The current trend towards personalized medicine creates an urgent need to share data among different hospitals and health institutions, which endangers the privacy of the data subjects if not done with the appropriate precautions. Conversely, the frequency ...

2019

A Blueprint for a Blockchain-Based Architecture to Power a Distributed Network of Tamper-Evident Learning Trace Repositories

Denis Gillet, Maria Jesus Rodriguez Triana, Juan Carlos Farah, Andrii Vozniuk

The need to ensure privacy and data protection in educational contexts is driving a shift towards new ways of securing and managing learning records. Although there are platforms available to store educational activity traces outside of a central repositor ...

2018

Privacy Preserving and Cost Optimal Mobile Crowdsensing using Smart Contracts on Blockchain

Boi Faltings, Sujit Prakash Gujar

The popularity and applicability of mobile crowdsensing applications are continuously increasing due to the widespread of mobile devices and their sensing and processing capabilities. However, we need to offer appropriate incentives to the mobile users who ...

IEEE2018

A High-Throughput Byzantine Fault-Tolerant Protocol

Nikola Knezevic

State-machine replication (SMR) is a software technique for tolerating failures and for providing high availability in large-scale systems, through the use of commodity hardware. A replicated state-machine comprises a number of replicas, each of which runs ...

EPFL2012

Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms

André Schiper, Martin Hutle, Fatemeh Borran

We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We show that for \emph{the algorithms we analyzed}, in most cases, the decentralized ...

IEEE2011

A Leader-Free Byzantine Consensus Algorithm

André Schiper, Fatemeh Borran

The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorithms that solve consensus with Byzantine faults are leader-based. This is not ...

Springer-Verlag2010

A Leader-Free Byzantine Consensus Algorithm

André Schiper, Fatemeh Borran

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010