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.Expand
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.Expand
An information-theoretic model for steganography with passive adversaries is proposed and several secure steganographic schemes are presented; one of them is a universal information hiding scheme based on universal data compression techniques that requires no knowledge of the covertext statistics.Expand
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.Expand
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.Expand
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.Expand
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.Expand
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.Expand
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.Expand
Information-theoretic meth¬ ods are used for proving the security of unconditionally secure cryptosystems, and a new information measure, smooth entropy, is introduced to quantify the number of almost uniform random bits that can be extracted from a source by probabilistic algorithms.Expand