Various Notions of Interactive Zero-Knowledge proof with an Open problem.
Hi Folks! Before reading tis blog, i hope you have checked my previous blog on Zero knowledge proof of knowledge. Directly jumping to zero knowledge notions we first discuss ensembles. Ensembles : It is a probability distribution. Example: {X n } n ∊ I , where I denotes countable set. Going back to your high school a a countable set is those set whose bijection is possible with the set of natural numbers (as you know set of integers is countable: positive integers maps to even natural number and negative integers maps to odd natural numbers). Random variable: It is a function whose outcome is an event from sample space. Now, come to agenda of this Blog. Zero Knowledge proof of knowledge: We say that an interactive proof system (P, V) for a language 'L' o input "x" is zero knowledge if whatever can be efficiently computed after interacting with P can also be computed by "x" itself (without interaction). Keep remember that zero knowle...