BETA
Back to courses
Share

Zero Knowledge Proofs

The Zero Knowledge Proofs course introduces the principles and applications of cryptographic protocols that allow one party to prove knowledge of information to another party without revealing the actual information.

Berkeley RDI

Posted on Jul 24, 2023 04:20 · Latest update on May 12, 2024

The Zero Knowledge Proofs course is a comprehensive exploration of cryptographic protocols that enable a party, the prover, to demonstrate knowledge of certain information to another party, the verifier, without revealing any details about the knowledge itself. Throughout the course, students delve into the theoretical foundations of zero knowledge proofs, including interactive proof systems, probabilistic encryption, and commitment schemes. They learn about different types of zero knowledge proofs, such as non-interactive and succinct zero knowledge proofs, and examine their applications in various fields, from secure authentication and identity verification to privacy-preserving computations and secure multiparty computations. The course equips students with a solid understanding of the mathematical principles and computational techniques underlying zero knowledge proofs, empowering them to design and analyze secure protocols for real-world scenarios where privacy and confidentiality are of utmost importance.

Chapters

14 Chapters / 32 Classes / 21H 5Mins

  • Chapters
  • Lessons
  • Duration
  • Progress
Chapter 1Lecture 1: Introduction to Zero Knowledge Interactive Proofs
5
1H 38Mins

ZKP Lecture 1: Introduction to Zero Knowledge Interactive Proofs (Part 1)

12Mins

ZKP Lecture 1: Introduction to Zero Knowledge Interactive Proofs (Part 2)

15Mins

ZKP Lecture 1: Introduction to Zero Knowledge Interactive Proofs (Part 3)

21Mins

ZKP Lecture 1: Introduction to Zero Knowledge Interactive Proofs (Part 4)

26Mins

ZKP Lecture 1: Introduction to Zero Knowledge Interactive Proofs (Part 5)

24Mins

Chapter 2Lecture 2: Overview of Modern SNARK Constructions
3
1H 20Mins

ZKP MOOC Lecture 2: Overview of Modern SNARK Constructions (Part 1)

17Mins

ZKP MOOC Lecture 2: Overview of Modern SNARK Constructions (Part 2)

23Mins

ZKP MOOC Lecture 2: Overview of Modern SNARK Constructions (Part 3)

40Mins

Chapter 3Lecture 3: Programming ZKPs
3
1H 41Mins

ZKP MOOC Lecture 3: Programming ZKPs (Part 1)

34Mins

ZKP MOOC Lecture 3: Programming ZKPs (Part 2)

42Mins

ZKP MOOC Lecture 3: Programming ZKPs (Part 3)

25Mins

Chapter 4Lecture 4:Interactive Proofs (IP)
5
2H 6Mins

ZKP MOOC Lecture 4: Interactive Proofs (Part 1)

21Mins

ZKP MOOC Lecture 4: Interactive Proofs (Part 2)

21Mins

ZKP MOOC Lecture 4: Interactive Proofs (Part 3)

20Mins

ZKP MOOC Lecture 4: Interactive Proofs (Part 4)

39Mins

ZKP MOOC Lecture 4: Interactive Proofs (Part 5)

25Mins

Chapter 5Lecture 5: The Plonk SNARK
3
1H 28Mins

ZKP Lecture 5: The Plonk SNARK (Part 1)

25Mins

ZKP Lecture 5: The Plonk SNARK (Part 2)

38Mins

ZKP Lecture 5: The Plonk SNARK (Part 3)

25Mins

Chapter 6Lecture 6: Discrete-log-based Polynomial Commitments
5
1H 30Mins

ZKP Lecture 6: Polynomial Commitments based on Pairing and Discrete Logarithm (Part 1)

15Mins

ZKP Lecture 6: Polynomial Commitments based on Pairing and Discrete Logarithm (Part 2)

11Mins

ZKP Lecture 6: Polynomial Commitments based on Pairing and Discrete Logarithm (Part 3)

20Mins

ZKP Lecture 6: Polynomial Commitments based on Pairing and Discrete Logarithm (Part 4)

15Mins

ZKP Lecture 6: Polynomial Commitments based on Pairing and Discrete Logarithm (Part 5)

29Mins

Chapter 7Lecture 7: Polynomial Commitments based on Error-correcting Codes
1
1H 30Mins

ZKP MOOC Lecture 7: Polynomial Commitments based on Error-correcting Codes

1H 30Mins

Chapter 8Lecture 8: FRI-based Polynomial Commitments and Fiat-Shamir
1
2H 0Min

ZKP MOOC Lecture 8: FRI-based Polynomial Commitments and Fiat-Shamir

2H 0Min

Chapter 9Lecture 9: SNARKs based on Linear PCP
1
1H 36Mins

ZKP MOOC Lecture 9: SNARKs based on Linear PCP

1H 36Mins

Chapter 10Lecture 10: Recursive SNARKs
1
1H 21Mins

ZKP MOOC Lecture 10: Recursive SNARKs

1H 21Mins

Chapter 11Lecture 11: From Practice to Theory
1
1H 34Mins

ZKP MOOC Lecture 11: From Practice to Theory

1H 34Mins

Chapter 12Lecture 12: zkEVM Design, Optimization and Applications
1
1H 44Mins

ZKP MOOC Lecture 12: zkEVM Design, Optimization and Applications

1H 44Mins

Chapter 13Lecture 13: Secure ZK Circuits with Formal Methods
1
1H 7Mins

ZKP MOOC Lecture 13: Secure ZK Circuits with Formal Methods

1H 7Mins

Chapter 14Lecture 14: Hardware Acceleration of ZKP
1
30Mins

ZKP MOOC Lecture 14: Hardware Acceleration of ZKP

30Mins

Speaker


...

26 Builders


Requirements

None


Take Away

ZK Basics

Product

  • Learn
  • Build
  • Developer Profile
  • On-Chain Contract & Payment

Community

  • Discord
  • Twitter
  • Github

Company

  • Apply for Cooperation
  • Terms of Use Agreement
  • Privacy Policy
  • Press Kit

© 2023 OpenBuild, All rights reserved.