Summary of Computer Scientist Explains One Concept in 5 Levels of Difficulty | WIRED

00:00:00 - 00:20:00

In the video, computer scientist William Gasarch explains the concept of zero knowledge proofs in five levels of difficulty. He starts with a level 1 explanation, which is easy to understand, and then moves on to more difficult concepts. Gasarch explains how zero knowledge proofs can be used to log in to a computer without revealing the user's password, and how they can be used to hide information in a way that is still efficient.

• 00:00:00 Zero knowledge proofs are a way for approver to convince a verifier that some statement is true, without revealing additional information beyond the fact that the statement is true. They are being used in blockchains and cryptocurrencies, and can be used to log in to a computer without revealing the user's password.
• 00:05:00 In a zero knowledge proof, two people communicate without sharing any information about the conversation. The proof shows that the statements made by the speaker are true, without revealing any information about the conversation.
• 00:10:00 Computer scientist explains one concept in 5 levels of difficulty, starting with level 1 (easy). New colors don't work with old colors in the previous video, but this new color works. This example is a zero knowledge proof, which is a proof where the details are not revealed. This concept goes beyond just proofs, and is about hiding information in a way that is still efficient.
• 00:15:00 Computer scientist explains one concept in 5 levels of difficulty. Main bottleneck in applications tends to lie on the approver, who can take the provers job and split it up into lots of parallel computations. This insight is an amazing insight into how knowledge is gained, and why big data does not imply a knowledge.
• 00:20:00 Computer Scientist explains one concept in 5 levels of difficulty. He discusses how cryptographic hardness is essential to the development of efficient zero-knowledge proofs and zero-knowledge algorithms. He also touches on quantum computing and its potential implications for cryptography.