Reputation
4,951
Next tag badge:
51/100 score
30/20 answers
Badges
1 6 21
Newest
 Yearling
Impact
~47k people reached

Aug
1
comment How to correctly convert TAG value to the right format so that to Verify HMAC?
What programming language is that? $\;$
Aug
1
comment Is constructing IND-CCA2 public key encryption schemes particularly easy with the KEM/DEM approach?
By the syntax above your post's grey line, $\: \operatorname{Range}(\hspace{.05 in}f_K) \subseteq \mathcal{C} \:$, $\:$ so the left part of the disjunction can be removed. $\;\;\;$ (Also, I've now convinced myself that without the assumption I mentioned, even the integrated scheme could be malleable, rather than just the KEM.) $\;\;\;\;\;\;\;\;$
Aug
1
comment Is constructing IND-CCA2 public key encryption schemes particularly easy with the KEM/DEM approach?
That is reasonable, it's just something to make sure of, since otherwise the KEM can be malleable. $\hspace{.48 in}$
Aug
1
comment Is constructing IND-CCA2 public key encryption schemes particularly easy with the KEM/DEM approach?
No, since you wrote $\mathcal{C}$ instead of $\operatorname{Range}(\hspace{.05 in}f_K)$ and wrote $\hspace{.04 in}f_K$ instead of $\hspace{.04 in}f_K^{-1}$. $\;$
Aug
1
comment Is constructing IND-CCA2 public key encryption schemes particularly easy with the KEM/DEM approach?
Is $\hspace{.04 in}f_K^{-1}$ assumed to not output an element of $\operatorname{Dom}(\hspace{.05 in}f_K)$ whenever $\hspace{.04 in}f_K^{-1}$'s $\hspace{1.93 in}$ input is not an element of $\operatorname{Range}(\hspace{.05 in}f_K)$? $\;$
Jul
30
comment Cryptanalysis on two time pad ciphers?
crypto.stackexchange.com/q/2249/991 $\;$
Jul
30
comment Prove that certain amount of data was stored
eprint.iacr.org/2013/805.pdf $\;$
Jul
30
comment Present an attack for the combination of OTP and textbook RSA
@Ruggero : $\;\;\;$ Presumably, he means ​ length(r) = length(m) . $\;\;\;\;\;\;\;\;$
Jul
30
comment Knowing that $G(s)$ is a PRG, is the following construction $G'(s) = G(s||0)$ a PRG?
That depends entirely on the rest of $G$'s description. $\;$
Jul
30
comment Knowing that $G(s)$ is a PRG, is the following construction $G'(s) = G(s||0)$ a PRG?
One can "know that in advance" by choosing $G$. $\:$ "this doesn't say you nothing about the possible output," which is why the answer to your title is "Maybe". $\;\;\;\;$
Jul
30
answered Knowing that $G(s)$ is a PRG, is the following construction $G'(s) = G(s||0)$ a PRG?
Jul
29
comment Attack on Double Encryption Scheme
Is the PKE scheme assumed to be CCA-secure? $\;$
Jul
29
comment Signature and hash function properties
@YehudaLindell : ​ I mean you're pointlessly making a stronger assumption. ​ ​ ​ ​
Jul
28
comment Signature and hash function properties
"collision resistance implies preimage resistance" only in the sense that second-preimage resistance also implies preimage resistance. $\;$
Jul
27
comment CPA-security of a pseudorandom permutation encryption scheme
You appear to be missing the "prove that this scheme is CPA-secure for ..." part. $\;$
Jul
26
comment Show How to Efficiently Solve the Computational Diffie-Hellman Assumption given an Algorithm that Solves the Square-DH Problem
cross-posted from MSE after less than 2 minutes, and answered there $\;$
Jul
26
comment Example: pre-image resistance to second pre-image resistance
You would need to make the same tests as for any arbitrary construction: crypto.stackexchange.com/q/183/991
Jul
26
comment Converting a pre-image resistant hash to second pre-image resistant
The only better description I can think of would be a summary of the abstract. $\;$
Jul
26
revised Converting a pre-image resistant hash to second pre-image resistant
gave paper's title
Jul
25
answered Simulator in Private Outsourced Computation over Outsourced Datasets