331 reputation
6
bio website
location
age
visits member for 9 months
seen Jul 3 at 21:08

Jul
2
awarded  Curious
Jun
6
comment Hamiltonicity proof of knowledge
@RickeyDemer 1.Why did you assigned 0 to $\kappa (|x|)$? 2.Why do you need a minimum-length witness? 3.$K_w$ cannot output a witness with certainity, if $P^*$ is lying then $K_w$ wouldn't be able to output a witness. 4. I don't understand your conclusion (where is it stems from?).
Jun
5
comment Hamiltonicity proof of knowledge
$L_R$ is the set of all $x$s s.t. there exists $y$ s.t. $(x,y)\in R$. The construction of the knowledge extractor is trivial bur what can you say about the running time requirement, which related to the knowledge error? (As I wrote in the 'question' part)
Jun
4
comment Hamiltonicity proof of knowledge
@RickyDemer, it's a typo - fixed
Jun
4
revised Hamiltonicity proof of knowledge
deleted 4 characters in body
Jun
3
revised Hamiltonicity proof of knowledge
added 51 characters in body
Jun
3
asked Hamiltonicity proof of knowledge
May
13
comment What are Cryptographic Multi-linear Maps?
No, this is another problem that I encounter, even to find out what are the topics that I should study beforehand.
May
13
asked What are Cryptographic Multi-linear Maps?
Feb
7
accepted Can you prove the existance of a PRG $G$ s.t. for each even $k$: $G(k)=G(k+1)$?
Feb
1
comment Can you prove the existance of a PRG $G$ s.t. for each even $k$: $G(k)=G(k+1)$?
Well, that's my question.. why does the cloned is considered as a PRG? How can you prove that the cloned is a PRG as well?
Feb
1
comment Can you prove the existance of a PRG $G$ s.t. for each even $k$: $G(k)=G(k+1)$?
And since the attacker doesn't control the input to a PRG he cannot distinguish between its output and a random string. This is my intuition, I just don't know how to prove.
Feb
1
comment Can you prove the existance of a PRG $G$ s.t. for each even $k$: $G(k)=G(k+1)$?
@PaĆ­loEbermann - note that it holds for even inputs $k$. so if it's true - it means that each to consecutive inputs to $G$ yield the same output. (If $k$ is odd the it's not mandatory that $G(k)=G(k+1)$ , only that $G(k)=G(k-1)$.
Feb
1
asked Can you prove the existance of a PRG $G$ s.t. for each even $k$: $G(k)=G(k+1)$?
Jan
31
comment Why does a perfect secrecy can be achieved when decryption correctness is not totally required?
Can you please give a more concrete answer? (with a lower bound..)
Jan
31
asked Why does a perfect secrecy can be achieved when decryption correctness is not totally required?
Jan
12
comment Can you show how that RSA does/doesn't provide anonymity?
@fgrieu - so the expected maximum is N-1 (in the case of a quadratic residue group) and the mean is $~e^{n/2} \mod N$? How can I analyze the probability of success here?
Jan
9
comment Can you show how that RSA does/doesn't provide anonymity?
Also, changed the adversary to be CPA, it is not matter though because in public key an eavesdropper is also a cpa.
Jan
9
revised Can you show how that RSA does/doesn't provide anonymity?
added 326 characters in body
Jan
9
comment Can you show how that RSA does/doesn't provide anonymity?
This is a direction but I'm talking about the cpa experiment. Adding it to the question.