"Zero Knowledge Proof" is an interactive method for one party to prove to another that a statement is true, without revealing anything other than the veracity of the statement.

learn more… | top users | synonyms

0
votes
1answer
64 views

Explanation of the Fiat-Shamir heuristic

The Wikipedia page on the topic (http://en.wikipedia.org/wiki/Fiat%E2%80%93Shamir_heuristic) is completely useless as it only explains what it is and not how it works. I looked at the original paper ...
0
votes
1answer
47 views

Group Dependent Language

The text below has been taken from the below paper Groth-Sahai Paper. The relevant part is highlighted in red. What does this group-dependent language mean in this context? From the definition of a ...
0
votes
1answer
23 views

Constructing set membership proof for private set

Is it possible to construct a set membership proof to show $\delta \in \Psi$ where $\delta$ is publicly known and $\Psi$ should stay only known to the prover? It seems rather impossible but I would ...
0
votes
0answers
42 views

Role of trusted party in the Ideal model in Malicious case

Imagine there is a protocol supporting outosurced multi party computation. There are three parties involved in the protocol: client $A$, client $B$ and a server. Client $A$ and $B$ send their private ...
0
votes
0answers
46 views

arithmetic calculation problem to quadratic arithmetic program

I am reading the Pinocchio paper (verifiable computation): http://research.microsoft.com/pubs/180286/pinocchio.pdf The paper is rather hard for me. I am considering this calculation problem: ...
0
votes
1answer
24 views

Figure 2 in the Verifiable Computation - Pinocchio

I am reading the Pinocchio paper (verifiable computation): http://research.microsoft.com/pubs/180286/pinocchio.pdf The paper is rather hard for me. For the Figure 2, I guess $v_1(x)$ should be ...
0
votes
1answer
56 views

Verification of Pinocchio (verifiable computation)

I am reading the Pinocchio paper. The calculated result $y$ is a part of the verification input, but it seems to me, the verification procedure does not utilize the result $y$. Can anyone can help me ...
0
votes
0answers
25 views

Hiding and Binding key in Groth-Sahai NIZK proof system

In context of Groth-Sahai NIZK proof system, I have a couple of doubts on Hiding and Binding keys. In case of hiding keys (highlighted in red), how is it ensured that $\tau(A) \subseteq \langle ...
0
votes
0answers
74 views

How does multi platform encrypted cloud storage work?

I'm really interested in end-to-end encrypted cloud storage and couldn't find out how following scenario could work: A user of a cloud provider which provides zero-knowledge-authentication (like for ...
0
votes
0answers
67 views

Simplifying the zero-knowledge proof example? [duplicate]

There is this http://en.wikipedia.org/wiki/Zero-knowledge_proof#Abstract_example. Now I'm curious about this. Why is it not possible for Victor to stand at the entrance and watch Peggy take one path ...
0
votes
0answers
25 views

Calculating cost of variables and equation in Groth-Sahai (DLIN) proof system

In Groth-Sahai proof system under DLIN assumption [Page 29], they have provided a few number denoting the cost of each variable and equation. Can anyone please explain how did they calculated the ...
-1
votes
1answer
143 views

Burn after read algorythm. Software verification on compromised environment. Software smart card

Please help me pick right design of software… I have to design client-server software, where the server should verify that the client runs software from specific source code. It has to be verifiable ...
-1
votes
1answer
93 views

Isn't Groth-Sahai proof system applicable beyond Bilinear groups?

Classical paper by Groth-Sahai on NIZK proof system is titled as "Efficient Non-interactive Proof Systems for Bilinear Groups". To my understanding, only (Pairing Product Equation) PPE are defined ...
-2
votes
1answer
158 views

Zero Knowledge Proof for Correctness of the product of additive ElGamal Ciphers [duplicate]

Suppose we use Additive ElGamal defined as follows: Let $(K,E,D)$ be a triple. The key-generator $K$ outputs the description of a finite multiplicative group $G$ of prime order $q$, with three ...