Reputation
4,418
Next tag badge:
45/100 score
28/20 answers
Badges
1 6 21
Newest
 Yearling
Impact
~43k people reached

37m
revised Mutual verification of shared secret
mentioned lower bound
13h
comment Does authenticated encryption add any protection to a signed digital envelope?
Is "that structure" just the PK-encrypted-symmetric-key, or that together with $\hspace{1.78 in}$ the symmetrically encrypted plaintext? $\;$
14h
comment Does authenticated encryption add any protection to a signed digital envelope?
"structure what" $\: \mapsto \:$ "structure is what" $\;\;\;\;$
15h
revised Mutual verification of shared secret
removed non-proof
17h
comment Mutual verification of shared secret
(I don't see how the next-to-last sentence of this answer helps, since one could just have the $x$ and $y$ be chosen by only-revelaed-to-one-party coin flips, with no fairness needed for those flips.) $\:$
17h
comment Mutual verification of shared secret
As far as I can see, the equality protocol might also be "only secure for malicious adversaries but not $\hspace{.37 in}$ for fail-stop adversaries." $\:$ How do you handle that possibility? $\;\;\;\;$
18h
revised Mutual verification of shared secret
fixed typos in my non-proof
18h
comment Mutual verification of shared secret
The paper I used for $\hspace{.04 in}f$'s definition proves that $\hspace{.04 in}f$ can be fairly computed. $\:$ (Thus, either that paper is wrong or the "proof" in the bottom 2/3 of my answer is not valid.) $\;\;\;\;$
18h
comment Mutual verification of shared secret
How is it that "the above" is a proof but what I just added to my answer is not valid? $\:$ Also, the paper you linked to "only considers finite functions (where the size of the domain is not dependent on the security parameter)", whereas equality has an infinite domain. $\;\;\;\;$
18h
revised Mutual verification of shared secret
added in what Yehuda Lindell should see
23h
comment Mutual verification of shared secret
(Okay, I did not realize you were an author for that paper.) $\:$ However, where above did you show that that paper's result does NOT cover the equality function? $\;\;\;\;$
23h
comment Mutual verification of shared secret
I am very far from sure that will go through; see section 4, which starts on page 16. $\hspace{1.51 in}$
1d
comment Simulation aborted because the adversary doesn't use the random oracle
Do you really need perfect simulation? $\:$ (For general PKE purposes, computational simulation is enough.) $\;\;$
2d
comment Mutual verification of shared secret
@StephenM347 : $\;\;\;$ In the last sentence of your bounty message, is "It" having "two parties establish a shared key, such that either they both know the key or neither do" or what the OP asked about? $\:$ I don't see any way to formalize what you described in the middle sentence of your bounty message, and I also do not see why the ability to do what the OP asked about would suffice for such a formalization. $\;\;\;\;\;\;\;\;$
Jun
28
comment Block Ciphers - Standardize plain text
en.wikipedia.org/wiki/Padding_(cryptography)#Bit_padding $\;$
Jun
27
reviewed No Action Needed HMAC for encrypted authentication token: recommended iteration number
Jun
27
reviewed Close Is algorithm with more than $2^{word size}$ words secure?
Jun
27
reviewed Close SQL-Like queries in CRYPTDB doesn't work
Jun
25
comment Is algorithm with more than $2^{word size}$ words secure?
What are "inter collisions"? $\:$ Do you have a formal definition for the $wordsize$ of an algorithm? $\hspace{.82 in}$
Jun
25
comment Why is HMAC-SHA1 still considered secure?
@user93353 : $\:$ Yes, signatures or more generally, direct use in the verification of documents. $\hspace{.86 in}$