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

Dec
5
comment Creating serial key generator using ECDSA, how to get signature short enough?
BLS or maybe "very short weakly secure signatures" or "shorter signatures with random oracles", $\hspace{.08 in}$ although for the latter two, security will generally degrade significantly as more messages are signed $\hspace{.35 in}$
Dec
4
comment Why is proving “parties' views are simulatable” enough in semi-honest model?
For example, malicious-Alice could change a wikipedia article that Bob will use to decide on his input. $\hspace{.24 in}$
Dec
4
comment Why is proving “parties' views are simulatable” enough in semi-honest model?
honest-Alice "doesn't know the value of $y$", but adversary-Alice chooses the value of $y$. $\hspace{1.11 in}$
Dec
4
comment Why is proving “parties' views are simulatable” enough in semi-honest model?
Proving that "parties' views are simulatable" is enough in the semi-honest model because Alice can distinguish $y$ from $y'$. $\;$
Dec
4
revised Why is proving “parties' views are simulatable” enough in semi-honest model?
fixed title's grammar
Dec
4
comment Why is proving “parties' views are simulatable” enough in semi-honest model?
"about the proof in semi-honest model" is not a question. $\:$ Do you mean "What is wrong with my proof about a protocol in the semi-honest model?"? $\;\;\;\;$
Dec
4
comment Should we MAC-then-encrypt or encrypt-then-MAC?
... Yes we are, otherwise there would be no point to any of these constructions. $\;$
Dec
4
comment Should we MAC-then-encrypt or encrypt-then-MAC?
"the MAC is not meant to preserve the integrity of the plaintext" would be just as good a reason to avoid MAC-then-encrypt too. $\;$
Dec
2
comment Creating serial key generator using ECDSA, how to get signature short enough?
If signature length is an issue, why are you public-key-encrypting the signatures? $\:$ A scheme with $\hspace{.24 in}$ shorter signatures "is the way to go for generating serial keys". $\;\;\;\;$
Dec
2
comment Creating serial key generator using ECDSA, how to get signature short enough?
Why are you specifying ECDSA? $\;$
Dec
1
comment Implementing a pseudo random function in practice
No, I'm saying that for most hash functions (even MD5), HMAC is believed to be a PRF. $\:$ I do not know whether something similar holds for CMAC, although there is another construction that's based on CMAC. $\:$ Every PRF with large output space is a MAC, but if there is a MAC then there is a MAC that is not a PRF. $\;\;$
Dec
1
comment Implementing a pseudo random function in practice
HMAC-SHA256 is "a function that gets used in practice for this this situation." $\;$
Nov
26
comment Computation indistinguishability questions
@Dramal : $\:$ $P\hspace{.02 in}(\hspace{.02 in}D\hspace{.02 in}(\hspace{.02 in}X_{\hspace{.02 in}n}\hspace{.02 in}))$ might make the "polynomial-time" constraint too strict. $\hspace{1.65 in}$
Nov
25
answered Computation indistinguishability questions
Nov
24
comment Efficient proof of knowledge using Wegman-Carter hash
No; I just mean that a similar analysis may work. $\;$
Nov
24
comment Efficient proof of knowledge using Wegman-Carter hash
I suspect that working with polynomials will have similar properties to working with integers. $\hspace{.94 in}$
Nov
21
comment Designing hash function in space-efficient identity based encryption
@poncho : $\:$ It would probably be important that the sampling of values $\hspace{2 in}$ with a Jacobi symbol of 1 be oblivious. $\;\;\;\;$
Nov
20
revised Cryptographic Operations and Security
improved grammar
Nov
19
answered Availability of a simple limited PRNG algorithm
Nov
19
comment Availability of a simple limited PRNG algorithm
Yes, there are at least 5 such PRNGs. $\;$