Zero Knowledge Proofs

Computational Thinking
Computational Thinking
45.7 هزار بار بازدید - 2 سال پیش - In zero-knowledge proofs, one can
In zero-knowledge proofs, one can prove to know a secret, without revealing absolutely anything about the secret! We give three examples: Where is Waldo?, the color blind problem, and hamiltonian circuits. We show to what degree these are zero-knowledge, and how we can generally prove that a protocol is zero knowledge.
2 سال پیش در تاریخ 1401/08/02 منتشر شده است.
45,799 بـار بازدید شده
... بیشتر