Problem 1 : Zero Knowledge Proof
نویسنده
چکیده
a. To check that the graph is represented correctly, Bob asks Alice to remove all the paper cups covering the endpoints of every edge. This reveals an isomorphism to the original graph, which Bob cannot check efficiently; thus, Bob also removes the paper cups corresponding to the green numbers, revealing the original labelling of the vertices. This reveals nothing about the vertex cover, but allows Bob to efficiently check that the graphs are indeed equal.
منابع مشابه
Quantum statistical zero-knowledge
In this paper we propose a definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZK. We prove several facts regarding this class: • The following natural problem is a complete promise problem for QSZK: given instructions for preparing two mixed quantum states, are the states close together or far...
متن کاملEfficient Zero-Knowledge Proofs of Knowledge of Double Discrete Logarithm
Zero-knowledge proof protocol is a basic cryptographic technique. And zero-knowledge proof of double discrete logarithm has some particular properties, so it has been widely applied in many security systems. But the efficient problem of zero-knowledge proof of double discrete logarithm has not been solved to this day, since there are some special difficulties in computing this kind of knowledge...
متن کاملimits on the Power of Quantum Statistical Zero-Knowledge
In this paper we propose a definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZKHV . We prove several facts regarding this class, including: The following problem is a complete promise problem for QSZKHV : given instructions for preparing two mixed quantum states, are the states close together...
متن کاملStudy on Quantum Zero Knowledge Proof System
Zero-knowledge proof is a very interesting problem in modern cryptography, which attracts the attention of many cryptographers, and there are plenty of researches. It is one of the hot research field in cryptography. First, we made a simple introduction of zero-knowledge proof. Then we had given a perfect quantum zero knowledge proof system on a specific NP – complete problem "graph 3-coloring"...
متن کاملLimits on the power of quantum statistical zero-knowledge
In this paper we propose a definition for honest verifier quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZKHV. We prove several facts regarding this class, including: • The following problem is a complete promise problem for QSZKHV: given instructions for preparing two mixed quantum states, are the states close together o...
متن کامل