What is zero-knowledge proof?<\/p>\n\n\n

In cryptography, a zero-knowledge proof or zero-knowledge protocol is a method by which one party (the prover) can prove to another party (the verifier) that they know a value x, without conveying any information apart from the fact that they know the value x. The essence of zero-knowledge proofs is that it is trivial to prove that one possesses knowledge of certain information by simply revealing it; the challenge is to prove such possession without revealing the information itself or any additional information. (Wikipedia)<\/p>\n\n\n\n

Formal definition <\/strong><\/p>\n\n\n

Suppose a prover proves to a verifier that a statement is true. Both prover and verifier follow a proving protocol. The protocol is a zero-knowledge proof if and only if it satisfies the following three properties:<\/p>\n\n\n

\n
1. \nCompleteness<\/b>: if the statement is true, the verifier will be convinced of this statement by the protocol.<\/li>\n\n\n\n
2. \nSoundness<\/b>: if the statement is false, the protocol never convince the verifier that it is true.<\/li>\n\n\n\n
3. \nZero-knowledge<\/b>: if the statement is true, the verifier learns nothing other than the fact that the statement is true. For example, when the statement is “Prover knows the secret password x <\/em>to open a door,” the verifier never learn the secret information x<\/em>.<\/li>\n<\/ol>\n\n\n

   The first two of these are properties of general proof systems. The third is what makes the proof zero-knowledge.<\/p>\n\n\n\n

   ---

   \n\n\n

   Simple example: Fining Waldo (Wally) <\/strong>(https:\/\/blockgeeks.com\/guides\/what-is-zksnarks\/)<\/em><\/p>\n\n\n

   Finding Waldo is a game where you have to find “Waldo” among a sea of people. It is a simple “Spot the guy” game:<\/p>\n\n\n

   <\/figure>\n\n\n

   And Waldo looks like this:<\/p>\n\n\n

   <\/figure>\n\n\n

   Ok, so where does the concept of Zero Knowledge come in here? Imagine there are two people Anna and Carl. Anna tells Carl that she knows where Wally is but she doesn’t want to show him where exactly he is. So, how can she prove to him that she has found Wally without showing his exact position?<\/p>\n\n\n

   There was, an interesting paper by Naor, Naor and Reingold which shows two Zero Knowledge solutions to this problem. There is a “Mid-Tech Solution” and a “Low-Tech Solution”. Let’s discuss both of them.<\/p>\n\n\n

   \n<\/span>Mid-Tech Solution<\/strong>\n<\/h2>\n\n\n

   The reason why this solution is “mid-tech” is because our prover and verifier need access to a photocopy machine to make this work. So this is how it goes. First, Anna and Carl would make a photocopy of the original game. Then Anna, whilst making sure that Carl isn’t looking, will cut out Waldo from the photocopy and then destroy the leftovers. After that she can show the Waldo cut out to Carl and prove that she did know where Waldo was after all without pinpointing his exact location to Carl.<\/p>\n\n\n

   There are problems with this solution. While it does fulfill the “Zero Knowledge” criteria, it doesn’t fulfill the “Soundness” criteria. There are many ways that Anna could have cheated here. She could have had a random Waldo cut out with her from the very beginning and could have just shown it to Carl without actually knowing where Waldo was. So what is the solution to this?<\/p>\n\n\n

   The solution to this is meticulous and careful testing. Firstly, Anna and Carl will take a photocopy of the game. Then Carl will draw a distinctive pattern at the back of the photocopy. After that, Carl will escort Anna to a room where she will be isolated and have no chance of cheating whatsoever. If Anna comes out with a cutout of Waldo, then Carl can be convinced that she actually knew where Waldo was without revealing the solution. They can repeat this experiment multiple times and Carl can compare the different cutouts of Waldo to be even further sure about the validity of Anna’s claim.<\/p>\n\n\n

   \n<\/span>Low-Tech Solution<\/strong>\n<\/h2>\n\n\n

   This solution required very basic equipment. The idea is simple. Get a huge cardboard, one that is twice the size of the game and cut out a small rectangle on it. Now, when Carl isn’t looking, Anna can move the cardboard on the game in such a way that the rectangle is directly on top of Waldo. Now, she can tell Carl to have a look and this is what he will see:<\/p>\n\n\n

   <\/figure>\n\n\n

   Image Courtesy: Applied Kid Cryptography by Naor And Reingold<\/p>\n\n\n

   So, while Carl may get a very basic idea of where Waldo actually can be, he doesn’t know the exact location. Anna has hence proved to Carl that she knows where Waldo is without pinpointing his exact location.<\/p>\n","protected":false},"excerpt":{"rendered":"

   영지식 증명관련 국문설명자료 링크 Groth16 프로토콜의 MATLAB 구현체 다운로드 & 실행 (Download and run a MATLAB implementation of Groth16 protocol) What is zero-knowledge proof? In cryptography, a zero-knowledge proof or zero-knowledge protocol is a method by which one party (the prover) can prove to another party (the verifier) that they know a value x, without conveying any information apart from the …<\/p>\n","protected":false},"author":74,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[26,30],"tags":[],"class_list":["post-28523","post","type-post","status-publish","format-standard","hentry","category-research","category-blockchain"],"_links":{"self":[{"href":"https:\/\/heungno.net\/index.php?rest_route=\/wp\/v2\/posts\/28523","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/heungno.net\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/heungno.net\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/heungno.net\/index.php?rest_route=\/wp\/v2\/users\/74"}],"replies":[{"embeddable":true,"href":"https:\/\/heungno.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=28523"}],"version-history":[{"count":3,"href":"https:\/\/heungno.net\/index.php?rest_route=\/wp\/v2\/posts\/28523\/revisions"}],"predecessor-version":[{"id":28526,"href":"https:\/\/heungno.net\/index.php?rest_route=\/wp\/v2\/posts\/28523\/revisions\/28526"}],"wp:attachment":[{"href":"https:\/\/heungno.net\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=28523"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/heungno.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=28523"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/heungno.net\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=28523"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}