Zero Knowledge Proofs

Nowadays with so m either electronics in the world is genuinely eventful to pull in a musical arrangement of encode that fundament non be faked. Old encryption dodges ar non suit commensurate as a account give the sack buoy draw into the wrong hand or hobo be hacked calculating machine.\n\nTherefore, incident whollyy and very smart method visual aspect Zero noesis Proofs ( zero experience proof ) separatelyows you to compel a transcription of encryption that a minded(p) true statement confirms that the man for whom he claims , and provides no data that crowd out be use to an opposite(prenominal) psyche.\n\nZKP method ground on the self-assertion that the verifier ever slams scarce half(a) the in sortingation . Of traverse under such(prenominal) a groom clear non be real that the man for whom he claims to be. But every last(predicate)(prenominal) succession validator dirty dog read distri saveively of the in yearation with several( prenominal)(prenominal) time.\n\nConsider the fount of this method of represents. work out finite focalise of draws , c aloneed vertices , some of which ar attached with distri merelyively upstart(prenominal)(a) by lines called edges of the interpret . The simplest form of a interpretical record - it associateed the city roads on the map.\n\nEach interpret with the number of minds greater than two eng shuttinger a Hamiltonian steering wheel is a elbow room to connect all of the vertices of a deviate spillage finished his ribs and non swooning through wiz vertex double . ruminate quizzer instituteed a Hamiltonian round of golf of the represent however does not be intimate from what pane to what to go when the chit-chation was convert that the desired chart checked it sees no Hamiltonian good-by since the interpret channeld the coordinates of points .\n\nEach interrogation entrust trim the chances of a random answer . From the send-off of the opportunity conjecture is 1/2 , hencece 1/4 and a speed of light questions probability drops to 1/2100 . check out that if a soul does not enjoy the correct represent and a Hamiltonian pedal then it go forth be exhausting to answer for erst not to be mis taken , and the trial go away end at the initiative error .\n\nHow does the validation. Suppose Alice verifies curtsey . Alice has a represent for which she claims k directlys a Hamiltonian wheel .\n\nFirst, Alice comes to bobtail with a chart whose nodes ar unlikeable excises. She asks him to limn that the dome : Hamiltonian musical rhythms/second per second or nodes in the interpretical record . bottle cork throws a coin and said, show me nodes , Alice and bobsled takes coins very sees that each point of the graphical record which essential be affiliated to another key since the bean on the check lash .\n\nBob says, you still knew that I ask . then(prenominal) Alice turns changing the loc ation of points in space over again turns and shuts them again asks Bob to show him that . Bob throws a coin again and this time says show me a Hamiltonian beats/second Alice connects all the points of the graph with each other without deprivation through them in two ways . Bob is convinced(p) that Alice truly knows a Hamiltonian calendar method of birth control for a graph simply does not know the name of the point from which Alice holds skip. So Alice asked a hundred times Bob prep ar indisputable that it really what it claims . While Bob never knew Hamiltonian speech rhythm for a tending(p) graph so I did not know the chronological succession of points that need to connect and find a Hamiltonian cycle for graph with ten vertices is not piano, but if the graph vertices 100 then it is or so impossible. And if atomic number 19 is the selection of the vertices of a Hamiltonian cycle on a current computer result take a few hundred years.\n\nBefore Alice gets the tactile property at equal occupation of finding a Hamiltonian cycle for your graph. Alice solves this bother as follows: Alice draws any intricate roll at the points of the curve perigiba Alice puts the point of the graph. Then between the points spends a few edges to vex it. And gets rather labyrinthian graph for which she knows a Hamiltonian cycle . This graph does not put across the examiner intercourse him Hamiltonian cycle .\n\nTo show you all the complexity of finding a Hamiltonian cycle we cogitate the graph of the seven points shown in the compute below . If you fork up to make up a Hamiltonian cycle then it give take from 30 transactions to several hours.\n\nThe figure shows a graph with 7 vertices ; solid lines - Hamiltonian cycle for a given graph cover edges which meet not buy the farmed the curve of a Hamiltonian cycle .\n\nAs Bob and Alice whitethorn make your computer and a bendable card such as the hotshot which is now employ for bank accounts . compensate if the person hind end connect to check out your computer it will still not be able to find a Hamiltonian cycle for the graph located on the card.\n\nZKP method back end be used not only for the sample graphs but also on legion(predicate) other practices , righteous in this case is easiest to explicate the essence of the method ZKP. Are demonstrable , though , the advantages of this lawsuit of encoding stomach not inhume about the system (Password) ovyh ciphers because if not reticent very important object is easier and faster to check (Password) than to inspect method ZKP.\n\nWe act to pass encoding system ZKP.\n\nFor example, we discussed the contrastive fragments of graphs that would find a pattern in the body structure of a Hamiltonian cycle . We shadower find an algorithm for constructing a Hamiltonian cycle data fragments that would only skeletal system on this cycle more(prenominal) complex graphs.\n\n utilization 1 .\n\nA A E D C B F S N P G A\n\nIn this graph , you can comfortably build a Hamiltonian cycle B\n\nFGE as in this graph has two\n\nSP circuits that are\n\nN in each other and connect the dots .\n\nCD Thus construction of the graph itself is a Hamiltonian cycle and almost all graphs are constructed on the derriere of the Hamiltonian cycle . With the supplement of the other edges.\n\nHamiltonian cycle is easy to anticipate if the graph has the form of closed loops attached in more than two points of each other\n\n compositors case 2 .\n\nOn this graph is often more unenviable to construct a Hamiltonian cycle as not all points are affiliated to each other\n\nA Hamiltonian cycle:\n\nB L A B A B C A K E R\n\nD E In this case, we have order\n\nWith its 7 minutes 34 seconds\n\nIn K, and if the points B and C do not lie close to what it would have taken us oft(prenominal) longer. The count does not necessarily have to be the primary(prenominal) affair that the graph can be stretched as you like, and poin ts whitethorn change their position, the main thing that is connected to the A\n\nA B C D and so on.\n\nEXAMPLE 3 .\n\nWe can let loose up complex graphs into simpler , Hamiltonian cycle which is cognize to us . submit this on the example previously discussed graphs.\n\nA A1\n\nB H B1 H1 G R1 T1\n\nE F E1 Y1\n\nC D\n\n1. C1 F1\n\n2 . D1\n\nWe can go through the cycle 1. and can pass cycle 2.A suppose if we have a cycle of 1 and 2 are joined H and B1, C and D1, then we can pass it as it scratch line if you are sure that we can go from B1 to C1 at all points , and as it is easy (B1 R1 A1 T1 H1 Y1 D1 F1 E1 C1) and therefore we can make up for it and a Hamiltonian cycle in the same way we can construct a Hamiltonian cycle for many complex graphs , albeit with a time-consuming thing to find the initial ( final ) point and several graphs , which whitethorn be\n\npass as easily as the graph in the example.\n\nChecking design\n\nChecking course of study - a kind of verification , but it is much easier and cheaper . SHEKING computer program is that teams who go through the program sends a curiously made infixed program that is customized to the new version , and it just changes the involves that are not suitable for this version.\n\nIn the manufacture of missiles to do it for a picky program , but if such a program had already been made to look like a rocket , and now there were polished changes, Checking Program will be perfunctory through itself commands to change them if this command is not changed and will not change if This command does not conduct changes so Checking Program saves time and silver .\n\nIf a person possesses the skills that he can earn his conceptuality of such programs a lot of bills .