Zero Knowledge Proof - ZKP

preview_player
Показать описание
Protecting your online privacy could become a lot easier with Zero Knowledge Proof. A technique that allows you to prove things without disclosing what it is you're proving.

Need to have a certain age before you can signup for a service? You can deliver a proof that you meet the criteria without sharing your actual age. Or you could prove to your bank that your salary is sufficient to get a loan, without revealing your real salary.

📚 Sources

🌍 Social

Рекомендации по теме
Комментарии
Автор

You should make a part 2 because I am still confused. How does the non-interactive zk proof work?

somethingelse
Автор

Hey ! We need a math example to understand the ZKP.

eddybash
Автор

I still don't get it :D How does the ball example transfer to atomic weapons? How does the non-interactive proof work?

guy.incognito
Автор

imagine Fermat used zero knowledge proof to prove that he knew the proof to his theorem (Fermat's last theorem)

proveen
Автор

I find that I can understand this video more easily than the one provided by that computer scientist who explained this concept to 5 levels of people.

donspaceye
Автор

I finally get the two balls example. It is the skeptical color blind friend who is holding the balls, and he is secretly switching or not switching. Only the skeptical color blind friend knows whether he switched behind his back. So in order for you to prove to him they are different colors you would have to point out to him exactly each time they switch color, corresponding exactly to each of his secret switches.

evanfreethy
Автор

Great Explanation. Waiting for part 2, maybe more in-depth on non-interactive zk Proof

TrendRain
Автор

I need to review this again. I'm lost!

nwabuezeozuzu
Автор

Awesome, but can you please explain about non interactive zero knowledge proof in another video?
Thanks~

jgobi
Автор

Can you provide clear example of non interactive knowledge proof ? Specifically the ING bank application

monkeyhammer
Автор

2:50
The probability of guessing right *10 times in a row* is low. But the probability of each guess is still 50% (unless you swapped to having 2 identical balls, using sleight of hand).

silver
Автор

it would be good if you mention real life examples of solving problems by mentioning them in another videos.
one thing is clear you really explain in simple way, simplicity is mother of complexity.
So your channel is like a boss of other channels, who do explain things in complex manner.

elseifforwhile
Автор

I really liked the example using color blindness, it was a neat solution. An alternative to repeating the shuffle and question process to get higher probability of correctness would be to cut a piece out of one ball, then cut up the other ball into many pieces, then mix the pieces in such a way that the person doing the mixing knew where the one piece was, while the person asserting that the balls are a different color does not. This is more destructive, and more complex, but possibly faster if you needed high probabilities of correctness quickly.

As many other comments have said, I’d be interested in further videos on this topic.

noahmccann
Автор

Great explantation of interactive proof. I really like your color scheme. An explanation on non- interactive proof would be nice.

YouTubist
Автор

Much better than the computerphile vid

sayandcode
Автор

This video could be better explained.
> You have normal eyesight and claim that the two balls are differently colored red and green.
> Your color-blind friend sees both balls as green (a common color-blind problem is to see a red rose as a green one) and suspects that you are trying to trick him.
> Your color-blind friend knows when he switches the balls around and whether you are right in saying that he switched or didn't.
> Your many multiple correct guesses convince your friend that the balls do indeed have different colors.
> There is no need to specify which color is which to your color blind friend to prove (based on a high statistical probability) that the balls have different colors.

> This interactive proof requires many efforts but blockchain requires proof with many nodes and therefore needs a non-interactive proof (not explained here).

pranavb
Автор

The problem with ZKP is that it over states it’s utility. There’s only limited use cases in the real world, without incurring more complexity in system design. Intellectually interesting. More hype than practical.

wryltxw
Автор

The probability is now low enough to convince the friend? This is confusing

dominicsosnov
Автор

Happy new year to you and all your family Xavier :)
All the best for 2019! Keep it up the great job <3

blackmennewstyle
Автор

Personal data, privacy, alternative way to share data so that we do not have to share more than we wanted

cecilechau