network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 7 months |
| seen | Feb 26 at 20:00 | |
| stats | profile views | 0 |
|
Jan 10 |
comment |
How to construct yes/no - election protocol, such that only the result is revealed? thanks, this is amazing |
|
Dec 18 |
comment |
construct an election protocol for the following election problem..? only individual votes should be kept private |
|
Dec 11 |
comment |
Contruct a protocol to determine if three secret keys are different, without revealing any of them? when A and B have the same age, after protocol it should be known that two people in the group have the same age. and it shouldn't be known that A and B have the same age, because this makes A know how old is B, and vice versa...(No one shall discover which numbers are equal.) |
|
Dec 11 |
comment |
Contruct a protocol to determine if three secret keys are different, without revealing any of them? @ Paŭlo Ebermann, Actaully i am new to cryptography, but for example it can be used to determine if three persons are from the same age or not, without revealing any information about their ages. |
|
Dec 11 |
comment |
Contruct a protocol to determine if three secret keys are different, without revealing any of them? they communicate sequentially, and the last person may tell the others the result .... but i am also interested in protocols where everyone of them can communicate with everyone else ... |
|
Dec 11 |
comment |
Contruct a protocol to determine if three secret keys are different, without revealing any of them? actually, there is no fourth person to compare the values(trusted center), every thing should be done only between the three persons.. and therefore depending in your comment, if two numbers are equal then two of the persons will know which numbers are equal. |
|
Dec 5 |
comment |
Non-Interactive Zero-Knowledge-Proof for discret Logarithm? the question is edited. |
|
Dec 5 |
comment |
Non-Interactive Zero-Knowledge-Proof for discret Logarithm? sorry, i mean the prover has the value of the discrete logarithm $x$, and he want to convenes the verifier that he knows the value of $x$ without giving the verifier this value .. |
|
Nov 12 |
comment |
Breaking RSA, given a special kind of oracle that decrypts related ciphertexts for us okay, thank you very very much |
