0
(
ratings
)
1
students
Created by:
Last updated:
September 8, 2022
Duration:
Unlimited Duration
FREE
This course includes:
Unlimited Duration
Badge on Completion
Certificate of completion
Unlimited Duration
Description
The topics covered in this course include interactive proofs
zero-knowledge proofs, zero-knowledge proofs of knowledge, non-interactive zero-knowledge proofs, secure protocols, two-party secure computation, multiparty secure computation, and chosen-ciphertext security.
Course Curriculum
- Interactive Proofs and Zero-Knowledge Proofs Unlimited
- The Notion of Zero-Knowledgeness Unlimited
- Zero-Knowledge Proofs (cont.) Unlimited
- ZK Proofs and Proofs of Knowledge Unlimited
- ZK Proofs for all of NP Unlimited
- Power and Efficiency of ZK Unlimited
- Variations on ZK Unlimited
- Communication Efficiency for NP Arguments Unlimited
- A Bounded NIZK Proof System for a Special Language Unlimited
- Non-Interactive ZK Proofs for all of NP Unlimited
- Generalizing Non-Interactive Zero-Knowledge Proofs Unlimited
- Improved Non-Interactive Zero-Knowledge Unlimited
- NIZK and the Lunchtime Attack Unlimited
- Lunchtime and Chosen Ciphertext Security Unlimited
- A Practical CCA-2 PK Cryptosystem Unlimited
- Defining ZK Proofs of Knowledge Unlimited
- Mutually Independent Commitments Unlimited
- Concurrent Zero-Knowledge Unlimited
- Concurrent Zero-Knowledge in Polylogarithmic Rounds Unlimited
- Secure Multi-Party Computation in the HBC Model Unlimited
- Compiling an Honest but Curious Protocol Unlimited
- Multi-Party Computation with Perfect Channels Unlimited
About the instructor
5
5
Instructor Rating
1
Reviews
1520
Courses
1916
Students
Massachusetts Institute of Technology
