Blockchain

Merkle Trees

Oblivious transfer (OT)

IoT Security

Zero-knowledge proof

Garbled Circuits

Sandboxing

Cryptocurrency

Infrastructure Security

Oblivious Computation

Secure Analytics

Secure Computation

Attacks on ML

Secure Communications

Hardware Security

Applied MPC

Mobile Security

CS 261 Security in Computer Systems UC Berkeley Fall 2022 A graduate-level course surveying modern topics in computer systems security, including secure messaging, blockchain, hardware security, and secure federated computation. It requires completion of CS 162 and CS 161 or equivalent for enrollment. Graduate survey of modern topics in computer systems security, including secure messaging, blockchain and cryptocurrencies, hardware security, secure federated computation, language-based security, anonymous communication, privacy and others. (3 units)  CS 162 and CS 161 or equivalent. 

CS 261 Security in Computer Systems

Computer Security and Cryptography

Ethics

Optimization

Algorithmic decision-making

Algorithmic bias

Algorithmic fairness

Accountability

Privacy

Surveillance

Civil liberties

Artificial intelligence

Labor and automation

Platforms

Social media

Misinformation

Decentralization

CS 182: Ethics, Public Policy, and Technological Change Stanford University Winter 2023 This course examines the intersections of philosophy, public policy, social science, and engineering in the context of recent computing technology and platforms. Key areas of focus include algorithmic decision-making, data privacy, AI, the influence of private computing platforms, and issues of diversity in tech. Students need to have completed CS106A. Examination of recent developments in computing technology and platforms through the lenses of philosophy, public policy, social science, and engineering.  Course is organized around five main units: algorithmic decision-making and bias; data privacy and civil liberties; artificial intelligence and autonomous systems; the power of private computing platforms; and issues of diversity, equity, and inclusion in the technology sector.  Each unit considers the promise, perils, rights, and responsibilities at play in technological developments.  ### Menu of Topics

The course will focus on six frontiers that (a) you are likely to play a role in shaping over the next decade and (b) where engagement with material from philosophy, social science, and public policy is likely to be helpful.

1. Algorithmic Decision-Making 
2. Political Economy of Tech Sector
3. Data Collection, Privacy, and Civil Liberties 
4. Artificial Intelligence and Autonomous Systems
5. Power of Private Platforms
6. Blockchain, Decentralization, and Cryptocurrency
 CS106A ### Cross-Cutting Themes

Throughout the course, we will foreground two cross-cutting themes:

- First, issues of diversity, equity, and inclusion which focus our attention on who has power, voice, and influence in shaping the design and regulation of technology.
- Second, issues of political economy which focus our attention on the interplay of markets and governments in shaping what technology gets built, who benefits from that technology, and how any harmful impacts are/are not mitigated.

CS 182: Ethics, Public Policy, and Technological Change

Computer Ethics

The Internet

Classical synchronization

Concurrency

Time Synchronization

Distributed Mutual Exclusion

Remote Procedure Call (RPC)

Distributed File Systems

Concurrency Control

Logging and Crash Recovery

Fault Tolerance

RAID (Redundant Array of Inexpensive Disks)

Distributed Replication

Distributed Databases

Spanner

Google File System (GFS)

Apache Hadoop Distributed File System (HDFS)

Data-Intensive Computing

MapReduce

Hadoop

In-memory cluster compute

Apache Spark

Distributed ML

Internet Content Delivery

DNS (Domain Name System)

Content Delivery Network (CDN)

Publish-Subscribe

Kafka

Virtualization

3-tier Web Service Architecture

Security Protocols

Byzantine Fault Tolerance

P2P Network

Distributed Ledgers

 15-440 Distributed Systems Carnegie Mellon University Fall 2020 A course offering both theoretical understanding and practical experience in distributed systems. Key themes include concurrency, scheduling, network communication, and security. Real-world protocols and paradigms like distributed filesystems, RPC, MapReduce are studied. Course utilizes C and Go programming languages. Most software is now distributed in some sense. This course is meant to serve as an introduction to distributed systems, emphasizing techniques for creating functional, usable, and high-performance distributed systems.

This course aims to: (1) provide students with an understanding of the principles and techniques behind the design of distributed systems, such as locking, concurrency, scheduling, and communication across the network. (2) provide students with practical experience designing, implementing, and debugging real distributed systems.

Major themes covered in this course include scarcity, scheduling, concurrency and concurrent programming, naming, abstraction and modularity, imperfect communication and other types of failure, protection from accidental and malicious harm, optimism, and the use of instrumentation and monitoring and debugging tools in problem solving. As the creation and management of software systems is a fundamental goal of any undergraduate systems course, students will design, implement, and debug large programming projects. After this course, students will have learned to…

- Implement and structure distributed systems programs.
- Write programs that can interoperate using well-defined protocols.
- Debug highly concurrent code that spans multiple programs running on multiple cores and machines.
- Reason about distributed algorithms for locking, synchronization and concurrency, scheduling, and replication.
- Use standard network communication primitives such as UDP and TCP.
- Understand the general properties of networked communication necessary for distributed systems programming in clusters and on the Internet.
- Employ and create common paradigms for easing the task of distributed systems programming, such as distributed filesystems, RPC, and MapReduce. Be able to clearly elucidate their benefits, drawbacks, and limitations.
- Identify the security challenges faced by distributed systems programs.
- Be able to select appropriate security solutions to meet the needs of commonly encountered distributed programming scenarios. Because this course has a big project component, you must be proficient in C and programming on UNIX systems. We will use the [Go programming language](https://golang.org/) throughout the term. It is required that you have taken 15-213 and gotten a “C-“ or higher since many of the programming skills you will need are taught in that course. **However, if you received a C in 15-213, you must meet with your academic advisor to discuss your background before taking 15-440/640, perhaps taking an additional course to sharpen your systems skills. Your advisor must email us approval and an explanation of why you have sufficient background to take 15-440/640.** 

 15-440 Distributed Systems

Parallelism and Distributed Systems

Cryptography

One-time pad

Computational assumptions

Symmetric-key encryption

Public-key cryptography

ElGamal public key encryption

DSA signature schemes

RSA (cryptosystem)

Diffie-Hellman key exchange

Authenticated encryption

Secure Hash Algorithm (SHA)

Pseudorandom generator (PRG)

CBC-MAC

Password-based authentication

Sigma protocol

Succinct Non-Interactive Arguments (SNARGs)

GMW: MPC for any function

Fully homomorphic encryption

Private information retrieval

Hardware security module (HSM)

Differential privacy

Shannon's Theorem

Message integrity

Collision-resistant hash functions

Hash-based Message Authentication Code (HMAC)

Pseudorandom function/permutation (PRF/PRP)

Secure shell protocol (SSH)

Two-factor authentication

Diffie-Hellman tuple

Non-interactive zero-knowledge (NIZK) proof

Secure multi-party computation (MPC)

Malicious security: GMW compiler

Somewhat homomorphic encryption over integers

Bootstrapping SWHE to FHE

Cryptography in blockchain

Privacy in machine learning

Computational security

Message authentication code (MAC)

Birthday attack

HKDF

Block cipher

Certificates

Secure authentication

Proof of knowledge

Fiat-Shamir heuristic

Garbled circuit

Cut-and-choose for garbled circuits

GSW: SWHE from LWE

Secure deployment of MPC applications

Random oracle model

Hash-and-Sign paradigm

Modes of operation

Public key infrastructure (PKI)

Single Sign-On (SSO) authentication

Schnorr's identification protocol

Anonymous online voting

Private set intersection

BFV: SWHE from RLWE

Secure hardware: secure enclaves (Intel SGX)

 CSCI 1515 Applied Cryptography Brown University Spring 2023 Applied Cryptography at Brown University offers a practical take on securing systems. By learning foundational cryptographic algorithms and advanced topics like zero-knowledge proofs and post-quantum cryptography, students gain both theoretical insights and hands-on experience in implementing cryptosystems using C++ and crypto libraries. Label: State-of-art concepts. ### Welcome to Applied Cryptography (CSCI 1515) at Brown!

This course teaches cryptography from a practical perspective and provides hands-on experience in building secure systems.

We first introduce foundational cryptographic algorithms including secret-key and public-key encryption schemes, message authentication codes, digital signatures, and hash functions, from which you will build secure communication and authentication systems.

More advanced topics that are covered include zero-knowledge proofs, secure multi-party computation, fully homomorphic encryption, post-quantum cryptography, and differential privacy. You will learn how these cryptographic techniques can be used to develop more advanced applications such as secure online anonymous voting, secure computation, and private information retrieval.

Besides the high-level design of these cryptosystems, you will also get hands-on experience implementing them using tools from the existing crypto libraries written in C++.    ## Textbooks

- [MOV] [Handbook of Applied Cryptography](https://cacr.uwaterloo.ca/hac/) by Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone
- [BS] [A Graduate Course in Applied Cryptography](http://toc.cryptobook.us/book.pdf) by Dan Boneh and Victor Shoup
- [KL] [Introduction to Cryptography](https://eclass.uniwa.gr/modules/document/file.php/CSCYB105/Reading%20Material/%5BJonathan_Katz%2C_Yehuda_Lindell%5D_Introduction_to_Mo%282nd%29.pdf) by Jonathan Katz and Yehuda Lindell
- [R] [The Joy of Cryptography](https://joyofcryptography.com/pdf/book.pdf) by Mike Rosulek

 CSCI 1515 Applied Cryptography

Blockchain

4 courses cover this concept

CS 261 Security in Computer Systems

CS 182: Ethics, Public Policy, and Technological Change

15-440 Distributed Systems

CSCI 1515 Applied Cryptography