238 reputation
18
bio website emboss.github.com
location Germany
age
visits member for 3 years
seen Oct 9 '13 at 1:12

Developer of PKI solutions, web applications and security consultant. Committer to CRuby (MRI) and maintainer of the Ruby OpenSSL extension. Author of krypt. @_emboss_ on Twitter.


Jun
15
comment Can I pre-define the points in Shamir's Secret Sharing algorithm
But to my understanding k=1 means having one share alone allows you to reconstruct the secret directly, without needing another share. In SSS, this results in handing S to the 4 people directly, because a_0 = S and there are no random coefficients to be chosen.
Jun
14
comment Can I pre-define the points in Shamir's Secret Sharing algorithm
k=1 doesn't require a sharing scheme?
Feb
15
comment Is there a known vulnerability when using identical key and salt with PBKDF2?
Thanks for your insight, has already helped a lot!
Feb
13
comment Is there a known vulnerability when using identical key and salt with PBKDF2?
I should have added this, actually same files yielding the same output is a feature, not a bug :) The entire scheme is a "convergent encryption" scheme. This means that given the same file, both parties need to be able to come up with the same salt, too. That's why the initial idea was to just reuse the file hash for the salt. But you're still right, I see now that doing so would kind of take the whole parallelization aspect of the salt away. Thanks!