Author details
Author's Published Works
Scheduled Maintenance on Monday 1/13/2025
Single article sales and account management will be unavailable from 5:00 AM - 7:00 PM ET (09:00 - 23:00 UTC). We apologize for the inconvenience.
Author details
Showing 1-25 of 32 results
- Sort
Filter Results
Show
Sort By
Results
Quick Order Fairness: Implementation and Evaluation
2024 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)
Year: 2024 | Conference Paper |
Decentralized finance revolutionizes traditional financial systems by leveraging blockchain technology to reduce trust. However, some vulnerabilities persist, notably front-running by malicious actors who exploit transaction information to gain financial advantage. Consensus with a fair order aims at preventing such attacks, and in particular, the differential order fairness property addresses thi...Show More
How to Trust Strangers: Composition of Byzantine Quorum Systems
2021 40th International Symposium on Reliable Distributed Systems (SRDS)
Year: 2021 | Conference Paper |
Cited by: Papers (5)
Trust is the basis of any distributed, fault-tolerant, or secure system. A trust assumption specifies the failures that a system, such as a blockchain network, can tolerate and determines the conditions under which it operates correctly. In systems subject to Byzantine faults, the trust assumption is usually specified through sets of processes that may fail together. Trust has traditionally been s...Show More
On the Synchronization Power of Token Smart Contracts
Orestis Alpos;Christian Cachin;Giorgia Azzurra Marson;Luca Zanolini
2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)
Year: 2021 | Conference Paper |
Cited by: Papers (4)
Modern blockchains support a variety of distributed applications beyond cryptocurrencies, including smart contracts, which let users execute arbitrary code in a distributed and decentralized fashion. Regardless of their intended application, blockchain platforms implicitly assume consensus for the correct execution of a smart contract, thus requiring that all transactions are totally ordered. It w...Show More
TZ4Fabric: Executing Smart Contracts with ARM TrustZone : (Practical Experience Report)
Christina Müller;Marcus Brandenburger;Christian Cachin;Pascal Felber;Christian Göttel;Valerio Schiavoni
2020 International Symposium on Reliable Distributed Systems (SRDS)
Year: 2020 | Conference Paper |
Cited by: Papers (7)
Blockchain technology promises to revolutionize manufacturing industries. For example, several supply chain use cases may benefit from transparent asset tracking and automated processes using smart contracts. Several real-world deployments exist where the transparency aspect of a blockchain is both an advantage and a disadvantage at the same time. The exposure of assets and business interaction re...Show More
Consensus Beyond Thresholds: Generalized Byzantine Quorums Made Live
2020 International Symposium on Reliable Distributed Systems (SRDS)
Year: 2020 | Conference Paper |
Cited by: Papers (4)
Existing Byzantine fault-tolerant (BFT) consensus protocols address only threshold failures, where the participating nodes fail independently of each other, each one fails equally likely, and the protocol’s guarantees follow from a simple bound on the number of faulty nodes. With the widespread deployment of Byzantine consensus in blockchains and distributed ledgers today, however, more sophistica...Show More
Trusted Computing Meets Blockchain: Rollback Attacks and a Solution for Hyperledger Fabric
Marcus Brandenburger;Christian Cachin;Rüdiger Kapitza;Alessandro Sorniotti
2019 38th Symposium on Reliable Distributed Systems (SRDS)
Year: 2019 | Conference Paper |
Cited by: Papers (44)
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 combining blockchains with trusted execution environments (TEEs), such as Intel SGX, for executing applications that demand confidentiality. As a consequence, untrusted blockchain nodes cannot get access to the data and computations inside th...Show More
Scalable Key Management for Distributed Cloud Storage
Mathias Bjorkqvist;Christian Cachin;Felix Engelmann;Alessandro Sorniotti
2018 IEEE International Conference on Cloud Engineering (IC2E)
Year: 2018 | Conference Paper |
Cited by: Papers (1)
As use of cryptography increases in all areas of computing, efficient solutions for key management in distributed systems are needed. Large deployments in the cloud can require millions of keys for thousands of clients. The current approaches for serving keys are centralized components, which do not scale as desired. This work reports on the realization of a key manager that uses an untrusted dist...Show More
Blockchains and Consensus Protocols: Snake Oil Warning
2017 13th European Dependable Computing Conference (EDCC)
Year: 2017 | Conference Paper |
Cited by: Papers (59)
A blockchain is a public ledger for recording transactions, maintained by many nodes without central authority through a distributed cryptographic protocol. All nodes validate the information to be appended to the blockchain, and a consensus protocol ensures that the nodes agree on a unique order in which entries are appended. Consensus protocols for tolerating Byzantine faults have received renew...Show More
Rollback and Forking Detection for Trusted Execution Environments Using Lightweight Collective Memory
Marcus Brandenburger;Christian Cachin;Matthias Lorenz;Rüdiger Kapitza
2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)
Year: 2017 | Conference Paper |
Novel hardware-aided trusted execution environments, as provided by Intel's Software Guard Extensions (SGX), enable to execute applications in a secure context that enforces confidentiality and integrity of the application state even when the host system is misbehaving. While this paves the way towards secure and trustworthy cloud computing, essential system support to protect persistent applicati...Show More
One of the main reasons why Byzantine fault-tolerant (BFT) systems are currently not widely used lies in their high resource consumption: $3f+1$ replicas are required to tolerate only $f$ faults. Recent works have been able to reduce the minimum number of replicas to $2f+1$ by relying on trusted subsystems that prevent a faulty replica from making conflicting statements to other replicas withou...Show More
Information-Theoretic Interactive Hashing and Oblivious Transfer to a Storage-Bounded Receiver
Christian Cachin;Claude Crépeau;Julien Marcil;George Savvides
Interactive hashing has featured as an essential ingredient in protocols realizing a large variety of cryptographic tasks, notably oblivious transfer in the bounded storage model. In interactive hashing, a sender transfers a bit string to a receiver such that two strings are received, the original string and a second string that appear to be chosen at random. This paper presents a self-contained, ...Show More
On limitations of using cloud storage for data replication
IEEE/IFIP International Conference on Dependable Systems and Networks Workshops (DSN 2012)
Year: 2012 | Conference Paper |
Cited by: Papers (4)
Cloud storage services often provide a key-value store (KVS) functionality, an object-based interface for accessing a collection of unstructured data items or blobs. Every blob is associated with a key that serves as identifier to access the blob. In the simplest form, a key-value store provides only methods for writing and reading an entire blob, for removing blobs, and for listing all defined ke...Show More
Robust data sharing with key-value stores
Cristina Băsescu;Christian Cachin;Ittay Eyal;Robert Haas;Alessandro Sorniotti;Marko Vukolić;Ido Zachevsky
IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012)
Year: 2012 | Conference Paper |
A key-value store (KVS) offers functions for storing and retrieving values associated with unique keys. KVSs have become the most popular way to access Internet-scale “cloud” storage systems. We present an efficient wait-free algorithm that emulates multi-reader multi-writer storage from a set of potentially faulty KVS replicas in an asynchronous environment. Our implementation serves an unbounded...Show More
This past April, Amazon's Elastic Compute Cloud service crashed during a system upgrade, knocking customers' websites off-line for anywhere from several hours to several days. That same month, hackers broke into the Sony PlayStation Network, exposing the personal information of 77 million people around the world. And in June a software glitch at cloud-storage provider Dropbox temporarily allowed v...Show More
Encryption keys are sometimes encrypted themselves; doing that properly requires special care. Although it might look like an oversight at first, the broadly accepted formal security definitions for cryptosystems don't allow encryption of key-dependent messages. Furthermore, key-management systems frequently use key encryption or wrapping, which might create dependencies among keys that lead to pr...Show More
Fail-Aware Untrusted Storage
2009 IEEE/IFIP International Conference on Dependable Systems & Networks
Year: 2009 | Conference Paper |
We consider a set of clients collaborating through an online service provider that is subject to attacks, and hence not fully trusted by the clients. We introduce the abstraction of a fail-aware untrusted service, with meaningful semantics even when the provider is faulty. In the common case, when the provider is correct, such a service guarantees consistency (linearizability) and liveness (wait-f...Show More
A Secure Cryptographic Token Interface
2009 22nd IEEE Computer Security Foundations Symposium
Year: 2009 | Conference Paper |
Cited by: Papers (15)
Cryptographic keys must be protected from exposure. In real-world applications, they are often guarded by cryptographic tokens that employ sophisticated hardware-security measures. Several logical attacks on the key management operations of cryptographic tokens have been reported in the past, which allowed to expose keys merely by exploiting the token API in unexpected ways. This paper proposes a ...Show More
Cryptographic Security for a High-Performance Distributed File System
24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007)
Year: 2007 | Conference Paper |
Storage systems are increasingly subject to attacks. Cryptographic file systems mitigate the danger of exposing data by using encryption and integrity protection methods and guarantee end-to-end security for their clients. This paper describes a generic design for cryptographic file systems and its realization in a distributed storage-area network (SAN) file system. Key management is integrated wi...Show More
Intrusion-tolerant middleware: the road to automatic security
P.E. Verissimo;N.F. Neves;C. Cachin;J. Poritz;D. Powell;Y. Deswarte;R. Stroud;I. Welch
The pervasive interconnection of systems throughout the world has given computer services a significant socioeconomic value that both accidental faults and malicious activity can affect. The classical approach to security has mostly consisted of trying to prevent bad things from happening-by developing systems without vulnerabilities, for example, or by detecting attacks and intrusions and deployi...Show More
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
International Conference on Dependable Systems and Networks (DSN'06)
Year: 2006 | Conference Paper |
We analyze the problem of efficiently storing large amounts of data on a distributed set of servers that may be accessed concurrently from multiple clients by sending messages over an asynchronous network. Up to one third of the servers and an arbitrary number of clients may be faulty and exhibit Byzantine behavior. We provide the first simulation of a multiple-writer multiple-reader atomic read/w...Show More
Lazy revocation in cryptographic file systems
Third IEEE International Security in Storage Workshop (SISW'05)
Year: 2005 | Conference Paper |
A crucial element of distributed cryptographic file systems are key management solutions that allow for flexible but secure data sharing. We consider efficient key management schemes for cryptographic file systems using lazy revocation. We give rigorous security definitions for three cryptographic schemes used in such systems, namely symmetric encryption, message-authentication codes and signature...Show More
Asynchronous verifiable information dispersal
24th IEEE Symposium on Reliable Distributed Systems (SRDS'05)
Year: 2005 | Conference Paper |
Information dispersal addresses the question of storing a file by distributing it among a set of servers in a storage-efficient way. We introduce the problem of verifiable information dispersal in an asynchronous network, where up to one third of the servers as well as an arbitrary number of clients might exhibit Byzantine faults. Verifiability ensures that the stored information is consistent des...Show More
Secure distributed DNS
International Conference on Dependable Systems and Networks, 2004
Year: 2004 | Conference Paper |
A correctly working domain name system (DNS) is essential for the Internet. Due to its significance and because of deficiencies in its current design, the DNS is vulnerable to a wide range of attacks. This paper presents the design and implementation of a secure distributed name service on the level of a DNS zone. Our service is able to provide fault tolerance and security even in the presence of ...Show More
Secure INtrusion-Tolerant Replication on the Internet
Proceedings International Conference on Dependable Systems and Networks
Year: 2002 | Conference Paper |
This paper describes a Secure INtrusion-Tolerant Replication Architecture (SINTRA) for coordination in asynchronous networks subject to Byzantine faults. SINTRA supplies a number of group communication primitives, such as binary and multi-valued Byzantine agreement, reliable and consistent broadcast, and an atomic broadcast channel. Atomic broadcast immediately provides secure state-machine replic...Show More
IEEE Account
Purchase Details
Profile Information
Need Help?
- US & Canada: +1 800 678 4333
- Worldwide: +1 732 981 0060
- Contact & Support
- About IEEE Xplore
- Contact Us
- Help
- Accessibility
- Terms of Use
- Nondiscrimination Policy
- Sitemap
- Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.