Reputation
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
Badges
3 11 24
Impact
~94k people reached

Nov
29
accepted What is the notion of an interactive assumption?
Nov
28
comment Bilinear map assumpion
Ok, i said DL is the strongest in the sense that breaking DL you break CDH and then DDH
Nov
26
comment Bilinear map assumpion
You were right about the other type of forgery by exponentiation. What about now? Assiming k is secret
Nov
26
revised Bilinear map assumpion
added 35 characters in body
Nov
26
comment Bilinear map assumpion
I thought DL is the strongest assumption. XDH assumes DDH is hard in G1 for asymmetric pairings
Nov
26
asked Bilinear map assumpion
Nov
24
awarded  Yearling
Nov
15
comment what problem happen if we always use IV Zero in CBC Mode?
Do not forget to mark the post as a valid answer
Nov
15
revised Why we use operating modes in cryptography?
edited title
Nov
15
comment what problem happen if we always use IV Zero in CBC Mode?
If $0$ comes as a result of a random generation then it is fine, but every time it should change
Nov
15
comment what problem happen if we always use IV Zero in CBC Mode?
The property that we need for the IV is to be a random number , that changes per encryption
Nov
15
answered what problem happen if we always use IV Zero in CBC Mode?
Nov
10
comment Difference between collision resistance and target collision resistance
@archie. In 2PIR the adversary is also trying to find a collision for a fixed message. I do not understand the difference with TCR. You are explaining it as TCR is 2PIR and 2PIR ("compared to the more general notion of Second Preimage Resistance, where the adversary to find a second preimage for a randomly chosen message") is collision resistance
Oct
26
awarded  Notable Question
Oct
9
reviewed Approve Wanted: Simple ring signature example
Oct
9
reviewed Approve What is the notion of an interactive assumption?
Oct
9
asked What is the notion of an interactive assumption?
Sep
29
awarded  Popular Question
Sep
25
accepted What are the differences between proofs based on simulation and proofs based on games?
Sep
25
comment What are the differences between proofs based on simulation and proofs based on games?
Thank you. But, in sb proofs there is a pre-agreed leakage in the ideal evironment. From my point of view and maybe i am wrong the question is and what is missing from sb proofs: How this leakage does not affect the security definition. And i am saying that because in the sb proofs that i have seen the point of interest is to show that the two worlds behave equivalently and not how the leakage affects the scheme. So it seems on me that this is the negative part with sb proofs. And as you correctly pointed out with game based there is no connection from IND-CPA to semantic security