3,447 reputation
1519
bio website
location United States
age
visits member for 2 years, 9 months
seen 2 hours ago

Jun
25
comment What is the quantum-resistant signature scheme with the smallest signature + pubkey?
As I vaguely alluded to in my previous comment, one can trade-off time for signature size. $\hspace{.98 in}$
Jun
25
comment What is the quantum-resistant signature scheme with the smallest signature + pubkey?
I said that, and that's what I did. $\:$ That link uses a significantly larger iteration count. $\hspace{1.33 in}$
Jun
25
answered What is the quantum-resistant signature scheme with the smallest signature + pubkey?
Jun
24
comment Exchanging session keys over symmetric-key channel?
en.wikipedia.org/wiki/Kerberos_(protocol) $\;$
Jun
24
comment What is the quantum-resistant signature scheme with the smallest signature + pubkey?
@CodesInChaos : $\:$ However, that doesn't help me figure out how much time verification takes. $\hspace{.69 in}$
Jun
24
comment What is the quantum-resistant signature scheme with the smallest signature + pubkey?
I'm too theoretical to have an idea of what "ECDSA-type ballpark" is, but I can see a way to do it by taking up barely under 1000 bytes and requiring around 600 hash operations to verify, despite only being one-time. $\;$
Jun
22
comment How to prove NIZK proof of knowledge?
Is $H$ modeled as a random oracle? $\;$
Jun
22
comment Password-based encrypted key storage?
They probably would have. $\;$
Jun
21
revised How can I find the multiplicative inverse in the first transformation of the SubBytes() transformation in AES?
copy-editing
Jun
21
comment Is it possible to perform a rudimentary asymmetric key encryption algorithm by hand?
crypto.stackexchange.com/q/8747/991 $\;$
Jun
21
comment Is it possible to perform a rudimentary asymmetric key encryption algorithm by hand?
They "employ a type of asymmetric cryptography"; that type is not asymmetric encryption. $\hspace{.93 in}$
Jun
21
comment Is it possible to perform a rudimentary asymmetric key encryption algorithm by hand?
Digital signatures do not "use asymmetric key encryption". $\:$ They do not even have $\hspace{1.35 in}$ to be based on asymmetric key encryption. $\;\;\;\;$
Jun
21
comment Is it possible to perform a rudimentary asymmetric key encryption algorithm by hand?
That thought would need digital signatures, not asymmetric key encryption. $\;$
Jun
20
comment Ballot box with multiple parties. All can read it, or none can read it
The other problem is that the commitment scheme might be malleable. $\;$
Jun
20
revised Ballot box with multiple parties. All can read it, or none can read it
elaborated on distributed moderators
Jun
20
comment Password-based encrypted key storage?
If the (padded) plaintext is longer than one block, then a MAC would probably $\hspace{1.67 in}$ be useful for the attack scenario I described. $\;$
Jun
20
revised Ballot box with multiple parties. All can read it, or none can read it
increased answer's optimism
Jun
19
comment Ballot box with multiple parties. All can read it, or none can read it
When using the "lots of moderators" option, it would take at least half of the moderators to violate the $\;\;\;$ all-or-none property, not just "one detractor". $\:$ Also, even if that happens, each detracting player can only hide that player's own message from the rest of the players, i.e., the non-detractors' messages still get revealed and still must be independent of each other. $\;\;\;\;$
Jun
19
comment Ballot box with multiple parties. All can read it, or none can read it
I suppose one could try something like that, but I don't see any reason to prefer doing so $\hspace{.92 in}$ over using an actually secure commitment scheme. $\;$
Jun
19
comment Ballot box with multiple parties. All can read it, or none can read it
That doesn't work, since one can just try inputs. $\;$