Share This Author
Hyperledger fabric: a distributed operating system for permissioned blockchains
This paper describes Fabric, its architecture, the rationale behind various design decisions, its most prominent implementation aspects, as well as its distributed application programming model, and shows that Fabric achieves end-to-end throughput of more than 3500 transactions per second in certain popular deployment configurations.
Architecture of the Hyperledger Blockchain Fabric
- C. Cachin
- Computer Science
A report of Swanson compares the two models of blockchains, where anyone can operate a node and participate through spending CPU cycles and demonstrating a “proof-of-work” in the “permissioned” model.
An information-theoretic model for steganography
- C. Cachin
- Computer ScienceInf. Comput.
- 14 April 1998
Computationally Private Information Retrieval with Polylogarithmic Communication
A single-database computationally private information retrieval scheme with polylogarithmic communication complexity based on a new, but reasonable intractability assumption, which is essentially the difficulty of deciding whether a small prime divides φ(m), where m is a composite integer of unknown factorization.
Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography
A new protocol for Byzantine agreement in a completely asynchronous network is presented that makes use of new cryptographic protocols, specifically protocols for threshold signatures and coin-tossing based on the Diffie-Hellman problem.
Secure and Efficient Asynchronous Broadcast Protocols
This paper addresses secure service replication in an asynchronous environment with a static set of servers, where a malicious adversary may corrupt up to a threshold of servers and controls the network.
Introduction to Reliable and Secure Distributed Programming
The authors follow an incremental approach by first introducing basic abstractions in simple distributed environments, before moving to more sophisticated abstractions and more challenging environments, and each core chapter is devoted to one topic, covering reliable broadcast, shared memory, consensus, and extensions of consensus.
Blockchain Consensus Protocols in the Wild
The process of assessing and gaining confidence in the resilience of a consensus protocols exposed to faults and adversarial nodes is discussed, and the consensus protocols in some prominent permissioned blockchain platforms with respect to their fault models and resilience against attacks are reviewed.
Asynchronous verifiable secret sharing and proactive cryptosystems
- C. Cachin, K. Kursawe, Anna Lysyanskaya, R. Strobl
- Computer Science, MathematicsCCS '02
- 18 November 2002
The first practical verifiable secret sharing protocol for asynchronous networks is proposed, which yields the first asynchronous Byzantine agreement protocol in the standard model whose efficiency makes it suitable for use in practice.
CheapBFT: resource-efficient byzantine fault tolerance
CheapBFT is presented, a BFT system that tolerates that all but one of the replicas active in normal-case operation become faulty, and which allows the system to safely switch to another, more resilient agreement protocol.