Algorand

End-to-end encryption

Man-in-the-middle attacks

Public key infrastructure (PKI)

Merkle trees

Certificate Transparency

Anonymous messaging

Encrypted search

Bitcoin

Ethereum

Smart contracts

Zero-knowledge proof

Rollups

Zero-knowledge smart contracts

Web3

Multi-Party Computation (MPC)

Cryptocurrency wallets

Backdoor-resilient authentication

Federated learning

CS 294-163: Secure Systems from Decentralized Trust UC Berkeley Fall 2022 This graduate seminar focuses on the development of secure systems built from decentralized trust, including end-to-end encryption systems and secure collaborative learning. It requires a solid introduction to cryptography and systems. Topics include blockchain, smart contracts, and zero-knowledge proofs, among others. This course is a graduate seminar on developing (secure) systems from decentralized trust.

In the past years, there has been much excitement in both academia and industry around the notion of decentralized security, which refers to, loosely speaking, security mechanisms that do not rely on the trustworthiness of any central entity. In only a few years, this area has generated many beautiful cryptographic constructs as well as a tremendous amount of real-world adoption, through blockchain, secure custody of secrets, secure collaborative learning – and now forming the technical backbone of the movement on “web3.0”.

The course will cover topics such as decentralized ledger systems, decentralized authentication and access control, end-to-end encryption systems, secure collaborative learning through secure multi-party computation, and others. For concrete learning, throughout the class we will develop a decentralized trust stack enabling common decentralized trust applications (3 units).  This is an advanced course, requiring a solid introduction to cryptography (CS161 or equivalent) and to systems (CS162 or equivalent). There is no required textbook for this class. You can refer to the [Berkeley CS161 textbook](https://textbook.cs161.org/) to refresh on security concepts and [A Graduate Course in Applied Cryptography](http://toc.cryptobook.us/) for cryptography.

CS 294-163: Secure Systems from Decentralized Trust

Blockchain

Computer Security and Cryptography

Cryptographic primitives

Nakamoto consensus

P2P Network

Bitcoin system

Bitcoin safety

Bitcoin liveness

Scaling throughput

Scaling latency

Sharding

Proof of stake

Side Blockchains

Payment Channels

Streamlet and Hotstuff

BFT protocols

Longest Chain Protocols

Bootstrapping blockchains

Zcash architecture

Privacy bridge

Fair transaction ordering

MEV and PBS architecture

Principles of Blockchains Princeton University Fall 2022 This course by Princeton University provides a full-stack design overview of blockchains, focusing on Bitcoin's design, scaling strategies, and additional considerations such as privacy and finality. It features a practical approach, with students implementing a Bitcoin client in Rust by the end of the course. Blockchains are decentralized digital trust engines and are a potential replacement to “digital platforms” that we encounter in today’s world. Digital platform companies occupy 7 of the largest companies in the world based on market capitalization (eg: Apple, Google, Microsoft, Amazon, Alibaba, Tencent). Blockchains came into prominence through Bitcoin, a cryptocurrency, introduced in 2009. In the decade since its inception, blockchain designs have evolved significantly, although the corresponding evolution of applications (beyond cryptocurrencies) have not caught up yet. In this course, we study a full-stack design of blockchains: we view the blockchains as a whole integrated system involving networking, incentives, consensus, application layer support. The course covers the foundations of blockchains, and is divided into 3 parts: in the first part we study the Bitcoin design in detail. Although very secure and remarkably incentive compatible in the real world, Bitcoin has very poor performance in many ways: throughput, latency, energy, compute, storage and communication. In the second part we study the various efforts to scale the performance of Bitcoin in all the different dimensions, while maintaining the incentive compatibility and security of Bitcoin. In the final part, we study aspects of blockchain design that were simply not considered in Bitcoin (e.g., privacy, finality). In the spirit of Nakamoto (who implemented and tested the Bitcoin client before writing the white paper), this course will be implementation-heavy. We will use the Rust programming language for our assignments and projects for the foundation component of the course. By the end of the course, you will implement a Bitcoin client in Rust.   The basic technical prerequisites are a background in probability and algorithms. Decent amount of software programming background is essential.  Supplemental reading:
- Bitcoin and Cryptocurrency Technologies, A. Narayanan, J. Bonneau, E. Felten, A. Miller and S. Goldfeder, Princeton University Press. Henceforth termed as PUP (Princeton university press).
- [Introduction to Cryptocurrencies](https://nakamoto.com/introduction-to-cryptocurrency/), a basic online course by Haseeb Qureshi.

Principles of Blockchains

Algorand

2 courses cover this concept

CS 294-163: Secure Systems from Decentralized Trust

Principles of Blockchains