Accountability (1) SMR (8) VSS (1) accumulators (1) asynchrony (2) bilinear accumulators (1) bilinear maps (1) blockchain (1) blockchain 101 (1) blockchain databases (2) blockchain101 (9) collision-resistance (1) collision-resistant-hash-function (1) crypto101 (2) cryptography (5) dist101 (28) encrypted search (2) game_theory (1) hash-function (1) hashing (1) integrity (2) kzg (1) lowerbound (11) merkle-hash-tree (1) models (4) non-equivocation (1) one-wayness (1) polynomials (2) private-set-intersection (3) raft (1) random-oracle (1) range-proofs (1) research (7) synchronous protocols (1) zero-knowledge (2)

 Accountability (1)

BFT Protocol Forensics

 SMR (8)

2-round BFT SMR with n=4, f=1
Good-case Latency of Byzantine Broadcast: a Complete Categorization
Resolving the Availability-Finality Dilemma
Commit-Notify Paradigm for Synchronous Consensus with Omission Faults
On the Optimality of Optimistic Responsiveness
Sync HotStuff, A Simple and Practical State Machine Replication
Primary-Backup for Two Servers and One Omission Failure is Impossible
Primary-Backup State Machine Replication for Crash Failures

 VSS (1)

Asynchronous Fault Tolerant Computation with Optimal Resilience

 accumulators (1)

Bilinear Accumulators for Cryptocurrency Enthusiasts

 asynchrony (2)

Living with Asynchrony: the Gather protocol
Living with Asynchrony: Bracha's Reliable Broadcast

 bilinear accumulators (1)

Bilinear Accumulators for Cryptocurrency Enthusiasts

 bilinear maps (1)

Bilinear Accumulators for Cryptocurrency Enthusiasts

 blockchain (1)

Blockchain Selfish Mining

 blockchain 101 (1)

On the Optimality of Optimistic Responsiveness

 blockchain databases (2)

Encrypted Blockchain Databases (Part II)
Encrypted Blockchain Databases (Part I)

 blockchain101 (9)

Benign Hotstuff
Resolving the Availability-Finality Dilemma
The First Blockchain or How to Time-Stamp a Digital Document
Streamlet: A Simple Textbook Blockchain Protocol
Data, Consensus, Execution: Three Scalability Bottlenecks for State Machine Replication
Security proof for Nakamoto Consensus
A Payment Channel is a two person BFS-SMR system
Dont Trust. Verify. and Checkpoint?
Do Bitcoin and Ethereum have any trusted setup assumptions?

 collision-resistance (1)

What is a Cryptographic Hash Function?

 collision-resistant-hash-function (1)

What is a Merkle Tree?

 crypto101 (2)

A Simple and Succinct Zero Knowledge Proof
The Trusted Setup Phase

 cryptography (5)

What is a Merkle Tree?
What is a Cryptographic Hash Function?
Private Set Intersection #2
Bilinear Accumulators for Cryptocurrency Enthusiasts
Private Set Intersection

 dist101 (28)

Neither Non-equivocation nor Transferability alone is enough for tolerating minority corruptions in asynchrony
Benign Hotstuff
Living with Asynchrony: the Gather protocol
Raft does not Guarantee Liveness in the face of Network Faults
The Lock-Commit Paradigm: Multi-shot and Mixed Faults
The Lock-Commit Paradigm
Living with Asynchrony: Bracha's Reliable Broadcast
Broadcast from Agreement and Agreement from Broadcast
Commit-Notify Paradigm for Synchronous Consensus with Omission Faults
Dolev-Strong Authenticated Broadcast
The FLP Impossibility, Asynchronous Consensus Lower Bound via Uncommitted Configurations
Synchronous Consensus Lower Bound via Uncommitted Configurations
Consensus Lower Bounds via Uncommitted Configurations
Sync HotStuff, A Simple and Practical State Machine Replication
Primary-Backup for Two Servers and One Omission Failure is Impossible
Primary-Backup State Machine Replication for Crash Failures
A Payment Channel is a two person BFS-SMR system
Flavours of State Machine Replication
Consensus for State Machine Replication
Flavours of Partial Synchrony
Does Byzantine Agreement need Quadratic Messages?
Byzantine Agreement is Impossible for $n \leq 3 f$ if the Adversary can Simulate
The Trusted Setup Phase
What is Consensus?
Byzantine Agreement is impossible for $n \leq 3 f$ under partial synchrony
The threshold adversary
The power of the adversary
Synchrony, Asynchrony and Partial synchrony
Encrypted Blockchain Databases (Part II)
Encrypted Blockchain Databases (Part I)

 game_theory (1)

Blockchain Selfish Mining

 hash-function (1)

What is a Cryptographic Hash Function?

 hashing (1)

What is a Cryptographic Hash Function?

 integrity (2)

What is a Merkle Tree?
What is a Cryptographic Hash Function?

 kzg (1)

Range Proofs from Polynomial Commitments, Re-explained

 lowerbound (11)

Neither Non-equivocation nor Transferability alone is enough for tolerating minority corruptions in asynchrony
Good-case Latency of Byzantine Broadcast: the Synchronous Case
Good-case Latency of Byzantine Broadcast: a Complete Categorization
Asynchronous Fault Tolerant Computation with Optimal Resilience
The FLP Impossibility, Asynchronous Consensus Lower Bound via Uncommitted Configurations
Synchronous Consensus Lower Bound via Uncommitted Configurations
Consensus Lower Bounds via Uncommitted Configurations
Primary-Backup for Two Servers and One Omission Failure is Impossible
Does Byzantine Agreement need Quadratic Messages?
Byzantine Agreement is Impossible for $n \leq 3 f$ if the Adversary can Simulate
Byzantine Agreement is impossible for $n \leq 3 f$ under partial synchrony

 merkle-hash-tree (1)

What is a Merkle Tree?

 models (4)

The Trusted Setup Phase
The threshold adversary
The power of the adversary
Synchrony, Asynchrony and Partial synchrony

 non-equivocation (1)

Neither Non-equivocation nor Transferability alone is enough for tolerating minority corruptions in asynchrony

 one-wayness (1)

What is a Cryptographic Hash Function?

 polynomials (2)

Bilinear Accumulators for Cryptocurrency Enthusiasts
Range Proofs from Polynomial Commitments, Re-explained

 private-set-intersection (3)

The Private Set Intersection (PSI) Protocol of the Apple CSAM Detection System
Private Set Intersection #2
Private Set Intersection

 raft (1)

Raft does not Guarantee Liveness in the face of Network Faults

 random-oracle (1)

What is a Cryptographic Hash Function?

 range-proofs (1)

Range Proofs from Polynomial Commitments, Re-explained

 research (7)

2-round BFT SMR with n=4, f=1
Good-case Latency of Byzantine Broadcast: a Complete Categorization
BFT Protocol Forensics
Resolving the Availability-Finality Dilemma
On the Optimality of Optimistic Responsiveness
Sync HotStuff, A Simple and Practical State Machine Replication
What is the difference between PBFT, Tendermint, SBFT and HotStuff ?

 synchronous protocols (1)

Good-case Latency of Byzantine Broadcast: the Synchronous Case

 zero-knowledge (2)

A Simple and Succinct Zero Knowledge Proof
Range Proofs from Polynomial Commitments, Re-explained